{"about":{"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.","site":"https://codewithpapers.app","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","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/code/get-cluster-labels-from-indices","entry":"get_cluster_labels_from_indices","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+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 = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","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; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":8,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":8,"n_papers_ran_instrument_only":0,"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":2,"n_samples_ran":2,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":8,"n_places_pointer_only_link_open":4,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":2,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":0},"key_notes":{"n_samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"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":"2412.13690","arxiv_id_is_arxiv":true,"paper":"/paper/personalized-clustering-via-targeted","title":"Personalized Clustering via Targeted Representation Learning","date":"2024-12-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hhdxwen/pcl","path":"evaluation/evaluation.py","file_url":"https://github.com/hhdxwen/pcl/blob/HEAD/evaluation/evaluation.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, hhdxwen/pcl when it was checked","code_sha256":"c5807f4f8acc5c0b","code_sha256_prefix":"c5807f4f8acc5c0b","mcp_get_code":{"code_sha256":"c5807f4f8acc5c0b"}},{"arxiv_id":"2407.05246","arxiv_id_is_arxiv":true,"paper":"/paper/deep-probability-aggregation-clustering","title":"Deep Online Probability Aggregation Clustering","date":"2024-07-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aomandechenai/deep-probability-aggregation-clustering","path":"PAC_DPAC_program/evaluation.py","file_url":"https://github.com/aomandechenai/deep-probability-aggregation-clustering/blob/HEAD/PAC_DPAC_program/evaluation.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, aomandechenai/deep-probability-aggregation-clustering when it was checked","code_sha256":"c5807f4f8acc5c0b","code_sha256_prefix":"c5807f4f8acc5c0b","mcp_get_code":{"code_sha256":"c5807f4f8acc5c0b"}},{"arxiv_id":"2312.08697","arxiv_id_is_arxiv":true,"paper":"/paper/incomplete-contrastive-multi-view-clustering","title":"Incomplete Contrastive Multi-View Clustering with High-Confidence Guiding","date":"2023-12-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liunian-jay/icmvc","path":"utils/evaluation.py","file_url":"https://github.com/liunian-jay/icmvc/blob/HEAD/utils/evaluation.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, liunian-jay/icmvc when it was checked","code_sha256":"5d68c89cbe412d07","code_sha256_prefix":"5d68c89cbe412d07","mcp_get_code":{"code_sha256":"5d68c89cbe412d07"}},{"arxiv_id":"2310.11989","arxiv_id_is_arxiv":true,"paper":"/paper/image-clustering-with-external-guidance","title":"Image Clustering with External Guidance","date":"2023-10-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xlearning-scu/2024-icml-tac","path":"eval_utils.py","file_url":"https://github.com/xlearning-scu/2024-icml-tac/blob/HEAD/eval_utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, xlearning-scu/2024-icml-tac when it was checked","code_sha256":"c5807f4f8acc5c0b","code_sha256_prefix":"c5807f4f8acc5c0b","mcp_get_code":{"code_sha256":"c5807f4f8acc5c0b"}},{"arxiv_id":"2310.00377","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2310.00377","date":null,"month_inferred_from_arxiv_id":"2023-10","title_source":null,"repo":"GauravBh1010tt/DPViT","path":"eval/imagenet_cls.py","file_url":"https://github.com/GauravBh1010tt/DPViT/blob/HEAD/eval/imagenet_cls.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from hhdxwen/pcl, and GitHub detected no licence in that repository when it was checked","code_sha256":"c5807f4f8acc5c0b","code_sha256_prefix":"c5807f4f8acc5c0b","mcp_get_code":{"code_sha256":"c5807f4f8acc5c0b"}},{"arxiv_id":"2301.11045","arxiv_id_is_arxiv":true,"paper":"/paper/incomplete-multi-view-clustering-via","title":"Incomplete Multi-view Clustering via Prototype-based Imputation","date":"2023-01-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"XLearning-SCU/2023-IJCAI-ProImp","path":"model.py","file_url":"https://github.com/XLearning-SCU/2023-IJCAI-ProImp/blob/HEAD/model.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from liunian-jay/icmvc, and GitHub detected no licence in that repository when it was checked","code_sha256":"5d68c89cbe412d07","code_sha256_prefix":"5d68c89cbe412d07","mcp_get_code":{"code_sha256":"5d68c89cbe412d07"}},{"arxiv_id":"2110.07402","arxiv_id_is_arxiv":true,"paper":"/paper/self-supervised-learning-by-estimating-twin-1","title":"Self-Supervised Learning by Estimating Twin Class Distributions","date":"2021-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bytedance/TWIST","path":"evaluate_cluster.py","file_url":"https://github.com/bytedance/TWIST/blob/HEAD/evaluate_cluster.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from hhdxwen/pcl, and GitHub detected no licence in that repository when it was checked","code_sha256":"c5807f4f8acc5c0b","code_sha256_prefix":"c5807f4f8acc5c0b","mcp_get_code":{"code_sha256":"c5807f4f8acc5c0b"}},{"arxiv_id":"2009.09687","arxiv_id_is_arxiv":true,"paper":"/paper/contrastive-clustering","title":"Contrastive Clustering","date":"2020-09-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Yunfan-Li/Contrastive-Clustering","path":"evaluation/evaluation.py","file_url":"https://github.com/Yunfan-Li/Contrastive-Clustering/blob/HEAD/evaluation/evaluation.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from hhdxwen/pcl, and GitHub detected no licence in that repository when it was checked","code_sha256":"c5807f4f8acc5c0b","code_sha256_prefix":"c5807f4f8acc5c0b","mcp_get_code":{"code_sha256":"c5807f4f8acc5c0b"}}],"record_sha256":"9ef0d278372b27431ea3d38d41752cb2fae3de9e76eaca50ef4a9ccca80c085b","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}