{"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/clustering","entry":"clustering","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":10,"n_papers_ran":4,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":2,"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":9,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":2,"n_samples_unverified":6,"n_samples_fingerprinted":0,"n_places":10,"n_places_pointer_only":5,"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":0,"ran_fixture":2,"ran":1,"unverified":6},"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":"2506.05019","arxiv_id_is_arxiv":true,"paper":"/paper/finmultitime-a-four-modal-bilingual-dataset","title":"FinMultiTime: A Four-Modal Bilingual Dataset for Financial Time-Series Analysis","date":null,"month_inferred_from_arxiv_id":"2025-06","title_source":"archive","repo":"marigoldwu/pydgc","path":"pydgc/models/magi.py","file_url":"https://github.com/marigoldwu/pydgc/blob/HEAD/pydgc/models/magi.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":"4d1191671cba756b","code_sha256_prefix":"4d1191671cba756b","mcp_get_code":{"code_sha256":"4d1191671cba756b"}},{"arxiv_id":"2410.13821","arxiv_id_is_arxiv":true,"paper":"/paper/artificial-kuramoto-oscillatory-neurons","title":"Artificial Kuramoto Oscillatory Neurons","date":"2024-10-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"autonomousvision/akorn","path":"eval_obj.py","file_url":"https://github.com/autonomousvision/akorn/blob/HEAD/eval_obj.py","status":"ran_fixture","verification_level":1,"contract_check":"DEP_MISSING","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, autonomousvision/akorn when it was checked","code_sha256":"8cd9e7e513b42a24","code_sha256_prefix":"8cd9e7e513b42a24","mcp_get_code":{"code_sha256":"8cd9e7e513b42a24"}},{"arxiv_id":"2406.09031","arxiv_id_is_arxiv":true,"paper":"/paper/a-comprehensive-graph-pooling-benchmark","title":"A Comprehensive Graph Pooling Benchmark: Effectiveness, Robustness and Generalizability","date":"2024-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"goose315/graph_pooling_benchmark","path":"Regression/layers/MUSE_pool.py","file_url":"https://github.com/goose315/graph_pooling_benchmark/blob/HEAD/Regression/layers/MUSE_pool.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, goose315/graph_pooling_benchmark when it was checked","code_sha256":"f0f8224d20e6307f","code_sha256_prefix":"f0f8224d20e6307f","mcp_get_code":{"code_sha256":"f0f8224d20e6307f"}},{"arxiv_id":"2403.09085","arxiv_id_is_arxiv":true,"paper":"/paper/meaningful-learning-advancing-abstract","title":"Meaningful Learning: Enhancing Abstract Reasoning in Large Language Models via Generic Fact Guidance","date":"2024-03-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"waste-wood/meanlearn","path":"clustering/clustering.py","file_url":"https://github.com/waste-wood/meanlearn/blob/HEAD/clustering/clustering.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, waste-wood/meanlearn when it was checked","code_sha256":"e98d6e308bad1d37","code_sha256_prefix":"e98d6e308bad1d37","mcp_get_code":{"code_sha256":"e98d6e308bad1d37"}},{"arxiv_id":"2312.01648","arxiv_id_is_arxiv":true,"paper":"/paper/characterizing-large-language-model-geometry","title":"Characterizing Large Language Model Geometry Helps Solve Toxicity Detection and Generation","date":"2023-12-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"randallbalestriero/splinellm","path":"statistic_analysis.py","file_url":"https://github.com/randallbalestriero/splinellm/blob/HEAD/statistic_analysis.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, randallbalestriero/splinellm (NOASSERTION)","code_sha256":"5c0bfe90ef68eed9","code_sha256_prefix":"5c0bfe90ef68eed9","mcp_get_code":{"code_sha256":"5c0bfe90ef68eed9"}},{"arxiv_id":"2211.12875","arxiv_id_is_arxiv":true,"paper":"/paper/a-survey-of-deep-graph-clustering-taxonomy","title":"A Survey of Deep Graph Clustering: Taxonomy, Challenge, Application, and Open Resource","date":"2022-11-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"marigoldwu/a-unified-framework-for-deep-attribute-graph-clustering","path":"pydgc/models/magi.py","file_url":"https://github.com/marigoldwu/a-unified-framework-for-deep-attribute-graph-clustering/blob/HEAD/pydgc/models/magi.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":"4d1191671cba756b","code_sha256_prefix":"4d1191671cba756b","mcp_get_code":{"code_sha256":"4d1191671cba756b"}},{"arxiv_id":"2210.12048","arxiv_id_is_arxiv":true,"paper":"/paper/ollivier-ricci-curvature-for-hypergraphs-a","title":"Ollivier-Ricci Curvature for Hypergraphs: A Unified Framework","date":"2022-10-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aidos-lab/orchid","path":"experiments/graph-clustering.py","file_url":"https://github.com/aidos-lab/orchid/blob/HEAD/experiments/graph-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":"8e91ec3a43c6a9c2","code_sha256_prefix":"8e91ec3a43c6a9c2","mcp_get_code":{"code_sha256":"8e91ec3a43c6a9c2"}},{"arxiv_id":"2112.02205","arxiv_id_is_arxiv":true,"paper":"/paper/behind-the-curtain-learning-occluded-shapes","title":"Behind the Curtain: Learning Occluded Shapes for 3D Object Detection","date":"2021-12-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xharlie/btcdet","path":"btcdet/datasets/findbestfit.py","file_url":"https://github.com/xharlie/btcdet/blob/HEAD/btcdet/datasets/findbestfit.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":"0b15dc5e864c4718","code_sha256_prefix":"0b15dc5e864c4718","mcp_get_code":{"code_sha256":"0b15dc5e864c4718"}},{"arxiv_id":"1905.10668","arxiv_id_is_arxiv":true,"paper":"/paper/is-a-single-vector-enough-exploring-node","title":"Is a Single Vector Enough? Exploring Node Polysemy for Network Embedding","date":"2019-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ninghaohello/Polysemous-Network-Embedding","path":"src/main_poly_pte.py","file_url":"https://github.com/ninghaohello/Polysemous-Network-Embedding/blob/HEAD/src/main_poly_pte.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, ninghaohello/Polysemous-Network-Embedding when it was checked","code_sha256":"43cca77a9d6e6b46","code_sha256_prefix":"43cca77a9d6e6b46","mcp_get_code":{"code_sha256":"43cca77a9d6e6b46"}},{"arxiv_id":"1902.09212","arxiv_id_is_arxiv":true,"paper":"/paper/deep-high-resolution-representation-learning","title":"Deep High-Resolution Representation Learning for Human Pose Estimation","date":"2019-02-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Vill-Lab/2022-TIP-HCGA","path":"deep_feature_clustersing.py","file_url":"https://github.com/Vill-Lab/2022-TIP-HCGA/blob/HEAD/deep_feature_clustersing.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":"5d13a519b4ca488b","code_sha256_prefix":"5d13a519b4ca488b","mcp_get_code":{"code_sha256":"5d13a519b4ca488b"}}],"record_sha256":"bb1137cb353e1177de95258fc0cbd251fa3a29b5f714b5bfd15d1f254d4da234","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}