{"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/cluster","entry":"cluster","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":18,"n_papers_ran":11,"n_papers_ran_no_instrument_failure":8,"n_papers_ran_instrument_only":3,"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":18,"n_samples_ran":11,"n_samples_constructed":0,"n_samples_ran_checked":8,"n_samples_instrument":3,"n_samples_unverified":7,"n_samples_fingerprinted":3,"n_places":18,"n_places_pointer_only":6,"n_places_pointer_only_link_open":0,"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":0,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":1,"ran":8,"unverified":7},"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":"2603.17610","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-17610","title":"AdaMuS: Adaptive Multi-view Sparsity Learning for Dimensionally Unbalanced Data","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"Hayd-coder/AdaMuS","path":"model.py","file_url":"https://github.com/Hayd-coder/AdaMuS/blob/HEAD/model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, Hayd-coder/AdaMuS when it was checked","code_sha256":"8081bb690b0a0156","code_sha256_prefix":"8081bb690b0a0156","mcp_get_code":{"code_sha256":"8081bb690b0a0156"}},{"arxiv_id":"2501.03675","arxiv_id_is_arxiv":true,"paper":"/paper/smir-efficient-synthetic-data-pipeline-to","title":"SMIR: Efficient Synthetic Data Pipeline To Improve Multi-Image Reasoning","date":"2025-01-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"togethercomputer/smir","path":"pipelines/utils.py","file_url":"https://github.com/togethercomputer/smir/blob/HEAD/pipelines/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"85f12650295bdf24","code_sha256_prefix":"85f12650295bdf24","mcp_get_code":{"code_sha256":"85f12650295bdf24"}},{"arxiv_id":"2408.15556","arxiv_id_is_arxiv":true,"paper":"/paper/divide-conquer-and-combine-a-training-free","title":"Divide, Conquer and Combine: A Training-Free Framework for High-Resolution Image Perception in Multimodal Large Language Models","date":"2024-08-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DreamMr/HR-Bench","path":"dc2_code/dc2/utils.py","file_url":"https://github.com/DreamMr/HR-Bench/blob/HEAD/dc2_code/dc2/utils.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, DreamMr/HR-Bench when it was checked","code_sha256":"3f9926a519f5ffb2","code_sha256_prefix":"3f9926a519f5ffb2","mcp_get_code":{"code_sha256":"3f9926a519f5ffb2"}},{"arxiv_id":"2404.11793","arxiv_id_is_arxiv":true,"paper":"/paper/enhancing-argument-summarization-prioritizing","title":"Enhancing Argument Summarization: Prioritizing Exhaustiveness in Key Point Generation and Introducing an Automatic Coverage Evaluation Metric","date":"2024-04-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"b14ck-sun/arg-sum","path":"Method/methods.py","file_url":"https://github.com/b14ck-sun/arg-sum/blob/HEAD/Method/methods.py","status":"ran","verification_level":1,"contract_check":null,"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, b14ck-sun/arg-sum when it was checked","code_sha256":"38af21b7320fcb58","code_sha256_prefix":"38af21b7320fcb58","mcp_get_code":{"code_sha256":"38af21b7320fcb58"}},{"arxiv_id":"2310.20046","arxiv_id_is_arxiv":true,"paper":"/paper/which-examples-to-annotate-for-in-context","title":"Which Examples to Annotate for In-Context Learning? Towards Effective and Efficient Selection","date":"2023-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"amazon-science/adaptive-in-context-learning","path":"algorithms.py","file_url":"https://github.com/amazon-science/adaptive-in-context-learning/blob/HEAD/algorithms.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a7424bb088354401","code_sha256_prefix":"a7424bb088354401","mcp_get_code":{"code_sha256":"a7424bb088354401"}},{"arxiv_id":"2308.03685","arxiv_id_is_arxiv":true,"paper":"/paper/learning-concise-and-descriptive-attributes","title":"Learning Concise and Descriptive Attributes for Visual Recognition","date":"2023-08-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wangyu-ustc/LM4CV","path":"cluster.py","file_url":"https://github.com/wangyu-ustc/LM4CV/blob/HEAD/cluster.py","status":"unverified","verification_level":0,"contract_check":null,"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, wangyu-ustc/LM4CV when it was checked","code_sha256":"dbbc089ece1bfd75","code_sha256_prefix":"dbbc089ece1bfd75","mcp_get_code":{"code_sha256":"dbbc089ece1bfd75"}},{"arxiv_id":"2305.00508","arxiv_id_is_arxiv":true,"paper":"/paper/learning-achievement-structure-for-structured","title":"Learning Achievement Structure for Structured Exploration in Domains with Sparse Reward","date":"2023-04-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pairlab/iclr-23-sea","path":"torchbeast/core/clustering.py","file_url":"https://github.com/pairlab/iclr-23-sea/blob/HEAD/torchbeast/core/clustering.py","status":"unverified","verification_level":0,"contract_check":null,"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, pairlab/iclr-23-sea when it was checked","code_sha256":"e495eadf9ce0d91a","code_sha256_prefix":"e495eadf9ce0d91a","mcp_get_code":{"code_sha256":"e495eadf9ce0d91a"}},{"arxiv_id":"2304.03376","arxiv_id_is_arxiv":true,"paper":"/paper/interpretable-statistical-representations-of","title":"Interpretable statistical representations of neural population dynamics and geometry","date":"2023-04-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Dynamics-of-Neural-Systems-Lab/MARBLE","path":"MARBLE/geometry.py","file_url":"https://github.com/Dynamics-of-Neural-Systems-Lab/MARBLE/blob/HEAD/MARBLE/geometry.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"741d528192ec3611","code_sha256_prefix":"741d528192ec3611","mcp_get_code":{"code_sha256":"741d528192ec3611"}},{"arxiv_id":"2211.13993","arxiv_id_is_arxiv":true,"paper":"/paper/combating-noisy-labels-in-object-detection","title":"Combating noisy labels in object detection datasets","date":"2022-11-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"safednn-group/safednn-clean","path":"safednn-clean.py","file_url":"https://github.com/safednn-group/safednn-clean/blob/HEAD/safednn-clean.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, safednn-group/safednn-clean, is not in the permissive set Syntology serves inline","code_sha256":"f6aa8e08cab69de8","code_sha256_prefix":"f6aa8e08cab69de8","mcp_get_code":{"code_sha256":"f6aa8e08cab69de8"}},{"arxiv_id":"2203.12082","arxiv_id_is_arxiv":true,"paper":"/paper/planemvs-3d-plane-reconstruction-from-multi","title":"PlaneMVS: 3D Plane Reconstruction from Multi-View Stereo","date":"2022-03-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"oppo-us-research/planemvs","path":"data_preparation/cluster.py","file_url":"https://github.com/oppo-us-research/planemvs/blob/HEAD/data_preparation/cluster.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e69c3883b85c1033","code_sha256_prefix":"e69c3883b85c1033","mcp_get_code":{"code_sha256":"e69c3883b85c1033"}},{"arxiv_id":"2111.08184","arxiv_id_is_arxiv":true,"paper":"/paper/air-2-for-interaction-prediction","title":"$AIR^2$ for Interaction Prediction","date":"2021-11-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"david9dragon9/air","path":"clustering.py","file_url":"https://github.com/david9dragon9/air/blob/HEAD/clustering.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b79faa5e5d306089","code_sha256_prefix":"b79faa5e5d306089","mcp_get_code":{"code_sha256":"b79faa5e5d306089"}},{"arxiv_id":"2009.06946","arxiv_id_is_arxiv":true,"paper":"/paper/graph-infoclust-leveraging-cluster-level-node","title":"Graph InfoClust: Leveraging cluster-level node information for unsupervised graph representation learning","date":"2020-09-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cmavro/HeMI","path":"layers/cluster.py","file_url":"https://github.com/cmavro/HeMI/blob/HEAD/layers/cluster.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c6f62788994e24d4","code_sha256_prefix":"c6f62788994e24d4","mcp_get_code":{"code_sha256":"c6f62788994e24d4"}},{"arxiv_id":"2007.05721","arxiv_id_is_arxiv":true,"paper":"/paper/towards-robust-classification-with-deep","title":"Towards Robust Classification with Deep Generative Forests","date":"2020-07-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AlCorreia/GeFs","path":"gefs/cluster.py","file_url":"https://github.com/AlCorreia/GeFs/blob/HEAD/gefs/cluster.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f0903cda1a853f9f","code_sha256_prefix":"f0903cda1a853f9f","mcp_get_code":{"code_sha256":"f0903cda1a853f9f"}},{"arxiv_id":"2006.06635","arxiv_id_is_arxiv":true,"paper":"/paper/modeling-shared-responses-in-neuroimaging","title":"Modeling Shared Responses in Neuroimaging Studies through MultiView ICA","date":"2020-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hbp-brain-charting/public_protocols","path":"Color/colored_patch.py","file_url":"https://github.com/hbp-brain-charting/public_protocols/blob/HEAD/Color/colored_patch.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9d5bc491034f54ec","code_sha256_prefix":"9d5bc491034f54ec","mcp_get_code":{"code_sha256":"9d5bc491034f54ec"}},{"arxiv_id":"1905.13732","arxiv_id_is_arxiv":true,"paper":"/paper/end-to-end-learning-and-optimization-on","title":"End to end learning and optimization on graphs","date":"2019-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bwilder0/clusternet","path":"models.py","file_url":"https://github.com/bwilder0/clusternet/blob/HEAD/models.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1578e3feffde89cb","code_sha256_prefix":"1578e3feffde89cb","mcp_get_code":{"code_sha256":"1578e3feffde89cb"}},{"arxiv_id":"1802.05591","arxiv_id_is_arxiv":true,"paper":"/paper/towards-end-to-end-lane-detection-an-instance","title":"Towards End-to-End Lane Detection: an Instance Segmentation Approach","date":"2018-02-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hq-jiang/instance-segmentation-with-discriminative-loss-tensorflow","path":"clustering.py","file_url":"https://github.com/hq-jiang/instance-segmentation-with-discriminative-loss-tensorflow/blob/HEAD/clustering.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"861f83b2deb0beda","code_sha256_prefix":"861f83b2deb0beda","mcp_get_code":{"code_sha256":"861f83b2deb0beda"}},{"arxiv_id":"1702.01105","arxiv_id_is_arxiv":true,"paper":"/paper/joint-2d-3d-semantic-data-for-indoor-scene","title":"Joint 2D-3D-Semantic Data for Indoor Scene Understanding","date":"2017-02-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jamycheung/trans4pass","path":"adaptations/model/memory.py","file_url":"https://github.com/jamycheung/trans4pass/blob/HEAD/adaptations/model/memory.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"525fc4fc5ea60036","code_sha256_prefix":"525fc4fc5ea60036","mcp_get_code":{"code_sha256":"525fc4fc5ea60036"}},{"arxiv_id":"aaai_6994","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_6994","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"dlinzhao/JSNet","path":"utils/clustering.py","file_url":"https://github.com/dlinzhao/JSNet/blob/HEAD/utils/clustering.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2036959ea2b2653d","code_sha256_prefix":"2036959ea2b2653d","mcp_get_code":{"code_sha256":"2036959ea2b2653d"}}],"record_sha256":"68454b51c40572c981c4cdcc5ac50743e1de50e9cfc8dc6d9ec7638dc2054804","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}