{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/code/k-means","entry":"k_means","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":5,"n_papers_ran":1,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":4,"n_samples_ran":1,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":1,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"unverified":3},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2404.11731","paper":"/paper/a-learning-to-rank-formulation-of-clustering","title":"A Learning-to-Rank Formulation of Clustering-Based Approximate Nearest Neighbor Search","date":"2024-04-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tomvek/mips-learnt-ivf","path":"clustering/kmeans.py","file_url":"https://github.com/tomvek/mips-learnt-ivf/blob/HEAD/clustering/kmeans.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"8e082f767d2fbd4c","mcp_get_code":{"code_sha256":"8e082f767d2fbd4c"}},{"arxiv_id":"2305.18405","paper":"/paper/dink-net-neural-clustering-on-large-graphs","title":"Dink-Net: Neural Clustering on Large Graphs","date":"2023-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yueliu1999/awesome-deep-graph-clustering","path":"dgc/clustering/clustering.py","file_url":"https://github.com/yueliu1999/awesome-deep-graph-clustering/blob/HEAD/dgc/clustering/clustering.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8e20feda4d89a3d5","mcp_get_code":{"code_sha256":"8e20feda4d89a3d5"}},{"arxiv_id":"2109.06860","paper":"/paper/broaden-the-vision-geo-diverse-visual","title":"Broaden the Vision: Geo-Diverse Visual Commonsense Reasoning","date":"2021-09-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wadeyin9712/gd-vcr","path":"build_dataset/question_cluster.py","file_url":"https://github.com/wadeyin9712/gd-vcr/blob/HEAD/build_dataset/question_cluster.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"34b7e4798f39686c","mcp_get_code":{"code_sha256":"34b7e4798f39686c"}},{"arxiv_id":"2001.00308","paper":"/paper/ensembles-of-many-diverse-weak-defenses-can","title":"ATHENA: A Framework based on Diverse Weak Defenses for Building Adversarial Defense","date":"2020-01-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nybupt/athena","path":"src/clustering/kmeans.py","file_url":"https://github.com/nybupt/athena/blob/HEAD/src/clustering/kmeans.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"19d7c5d5624b5935","mcp_get_code":{"code_sha256":"19d7c5d5624b5935"}},{"arxiv_id":"aaai_20726","paper":null,"title":"arXiv:aaai_20726","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"yueliu1999/Awesome-Deep-Graph-Clustering","path":"dgc/clustering/clustering.py","file_url":"https://github.com/yueliu1999/Awesome-Deep-Graph-Clustering/blob/HEAD/dgc/clustering/clustering.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8e20feda4d89a3d5","mcp_get_code":{"code_sha256":"8e20feda4d89a3d5"}}]}