{"data":{"full_name":"FutureComputing4AI/KiloGrams","name":"KiloGrams","description":"KiloGram algorithm for finding the top-k most frequent n-grams for large values of n quickly with fixed memory. ","stars":9.0,"forks":4.0,"language":"Java","license":"Apache-2.0","archived":0.0,"subcategory":"word-embedding-vectors","last_pushed_at":"2025-10-08T19:27:01+00:00","pypi_package":null,"npm_package":null,"downloads_monthly":0.0,"dependency_count":0.0,"commits_30d":null,"reverse_dep_count":0.0,"maintenance_score":2.0,"adoption_score":5.0,"maturity_score":16.0,"community_score":15.0,"quality_score":38.0,"quality_tier":"emerging","risk_flags":"['stale_6m', 'no_package', 'no_dependents']"},"meta":{"timestamp":"2026-04-12T13:02:47.683288+00:00"}}