{"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/target-distribution","entry":"target_distribution","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":16,"n_papers_ran":13,"n_papers_ran_no_instrument_failure":10,"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":9,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":3,"n_samples_unverified":2,"n_samples_fingerprinted":7,"n_places":16,"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":2,"ran_violates":0,"ran_draft_wrong":3,"ran_fixture":0,"ran":2,"unverified":2},"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":"2607.10548","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-10548","title":"Beyond Looking Up, Try Looking Around: Harmonizing Global Structure and Local Consistency in Optimal Transport for Short Text Clustering","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"YZH0905/CAOT-STC","path":"learner/cluster_utils.py","file_url":"https://github.com/YZH0905/CAOT-STC/blob/HEAD/learner/cluster_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c36909e5f178aebf","code_sha256_prefix":"c36909e5f178aebf","mcp_get_code":{"code_sha256":"c36909e5f178aebf"}},{"arxiv_id":"2605.29933","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-29933","title":"CLUBench: A Clustering Benchmark","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"xiaofeng-github/CLUBench","path":"CLUBench/algorithms/DEC.py","file_url":"https://github.com/xiaofeng-github/CLUBench/blob/HEAD/CLUBench/algorithms/DEC.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"cc8c969ec45f0b92","code_sha256_prefix":"cc8c969ec45f0b92","mcp_get_code":{"code_sha256":"cc8c969ec45f0b92"}},{"arxiv_id":"2601.13331","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-13331","title":"MultiST: A Cross-Attention-Based Multimodal Model for Spatial Transcriptomics","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"LabJunBMI/MultiST","path":"MultiST/MultiST/MultiST_model.py","file_url":"https://github.com/LabJunBMI/MultiST/blob/HEAD/MultiST/MultiST/MultiST_model.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, LabJunBMI/MultiST when it was checked","code_sha256":"3339a02639344442","code_sha256_prefix":"3339a02639344442","mcp_get_code":{"code_sha256":"3339a02639344442"}},{"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/dfcn.py","file_url":"https://github.com/marigoldwu/pydgc/blob/HEAD/pydgc/models/dfcn.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":"d9d1d0c203d5cf1b","code_sha256_prefix":"d9d1d0c203d5cf1b","mcp_get_code":{"code_sha256":"d9d1d0c203d5cf1b"}},{"arxiv_id":"2407.16863","arxiv_id_is_arxiv":true,"paper":"/paper/balanced-multi-relational-graph-clustering","title":"Balanced Multi-Relational Graph Clustering","date":"2024-07-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zxlearningdeep/bmgc","path":"BMGC/module/loss_fun.py","file_url":"https://github.com/zxlearningdeep/bmgc/blob/HEAD/BMGC/module/loss_fun.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, zxlearningdeep/bmgc when it was checked","code_sha256":"c8b8a6955c6ca85d","code_sha256_prefix":"c8b8a6955c6ca85d","mcp_get_code":{"code_sha256":"c8b8a6955c6ca85d"}},{"arxiv_id":"2405.04342","arxiv_id_is_arxiv":true,"paper":"/paper/the-curse-of-diversity-in-ensemble-based","title":"The Curse of Diversity in Ensemble-Based Exploration","date":"2024-05-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhixuan-lin/ensemble-rl-discrete","path":"ensemble_rl/agents/boot_quantile_agent.py","file_url":"https://github.com/zhixuan-lin/ensemble-rl-discrete/blob/HEAD/ensemble_rl/agents/boot_quantile_agent.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":"4e8df17f4dcd90d6","code_sha256_prefix":"4e8df17f4dcd90d6","mcp_get_code":{"code_sha256":"4e8df17f4dcd90d6"}},{"arxiv_id":"2401.03194","arxiv_id_is_arxiv":true,"paper":"/paper/learning-persistent-community-structures-in","title":"Learning Persistent Community Structures in Dynamic Networks via Topological Data Analysis","date":"2024-01-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kundtx/MFC-TopoReg","path":"Models/GraphFiltrationLayer.py","file_url":"https://github.com/kundtx/MFC-TopoReg/blob/HEAD/Models/GraphFiltrationLayer.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, kundtx/MFC-TopoReg when it was checked","code_sha256":"c8b8a6955c6ca85d","code_sha256_prefix":"c8b8a6955c6ca85d","mcp_get_code":{"code_sha256":"c8b8a6955c6ca85d"}},{"arxiv_id":"2312.14066","arxiv_id_is_arxiv":true,"paper":"/paper/upper-bounding-barlow-twins-a-novel-filter","title":"Upper Bounding Barlow Twins: A Novel Filter for Multi-Relational Clustering","date":"2023-12-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"XweiQ/BTGF","path":"losses.py","file_url":"https://github.com/XweiQ/BTGF/blob/HEAD/losses.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, XweiQ/BTGF when it was checked","code_sha256":"c8b8a6955c6ca85d","code_sha256_prefix":"c8b8a6955c6ca85d","mcp_get_code":{"code_sha256":"c8b8a6955c6ca85d"}},{"arxiv_id":"2308.05309","arxiv_id_is_arxiv":true,"paper":"/paper/homophily-enhanced-structure-learning-for","title":"Homophily-enhanced Structure Learning for Graph Clustering","date":"2023-08-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"galogm/hole","path":"models/HoLe_batch.py","file_url":"https://github.com/galogm/hole/blob/HEAD/models/HoLe_batch.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":"43b78da2e69b26ea","code_sha256_prefix":"43b78da2e69b26ea","mcp_get_code":{"code_sha256":"43b78da2e69b26ea"}},{"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/dfcn.py","file_url":"https://github.com/marigoldwu/a-unified-framework-for-deep-attribute-graph-clustering/blob/HEAD/pydgc/models/dfcn.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":"d9d1d0c203d5cf1b","code_sha256_prefix":"d9d1d0c203d5cf1b","mcp_get_code":{"code_sha256":"d9d1d0c203d5cf1b"}},{"arxiv_id":"2009.11407","arxiv_id_is_arxiv":true,"paper":"/paper/steering-a-historical-disease-forecasting","title":"Steering a Historical Disease Forecasting Model Under a Pandemic: Case of Flu and COVID-19","date":"2020-09-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AdityaLab/CALI-Net","path":"EpiDeepCN.py","file_url":"https://github.com/AdityaLab/CALI-Net/blob/HEAD/EpiDeepCN.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c8b8a6955c6ca85d","code_sha256_prefix":"c8b8a6955c6ca85d","mcp_get_code":{"code_sha256":"c8b8a6955c6ca85d"}},{"arxiv_id":"2002.01633","arxiv_id_is_arxiv":true,"paper":"/paper/structural-deep-clustering-network","title":"Structural Deep Clustering Network","date":"2020-02-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bdy9527/SDCN","path":"sdcn.py","file_url":"https://github.com/bdy9527/SDCN/blob/HEAD/sdcn.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c8b8a6955c6ca85d","code_sha256_prefix":"c8b8a6955c6ca85d","mcp_get_code":{"code_sha256":"c8b8a6955c6ca85d"}},{"arxiv_id":"1906.06532","arxiv_id_is_arxiv":true,"paper":"/paper/attributed-graph-clustering-a-deep","title":"Attributed Graph Clustering: A Deep Attentional Embedding Approach","date":"2019-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Tiger101010/DAEGC","path":"DAEGC/daegc.py","file_url":"https://github.com/Tiger101010/DAEGC/blob/HEAD/DAEGC/daegc.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c8b8a6955c6ca85d","code_sha256_prefix":"c8b8a6955c6ca85d","mcp_get_code":{"code_sha256":"c8b8a6955c6ca85d"}},{"arxiv_id":"1812.06110","arxiv_id_is_arxiv":true,"paper":"/paper/dopamine-a-research-framework-for-deep","title":"Dopamine: A Research Framework for Deep Reinforcement Learning","date":"2018-12-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google/dopamine","path":"dopamine/jax/agents/rainbow/rainbow_agent.py","file_url":"https://github.com/google/dopamine/blob/HEAD/dopamine/jax/agents/rainbow/rainbow_agent.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":"4a8a34b2b49ec731","code_sha256_prefix":"4a8a34b2b49ec731","mcp_get_code":{"code_sha256":"4a8a34b2b49ec731"}},{"arxiv_id":"1810.06339","arxiv_id_is_arxiv":true,"paper":"/paper/deep-reinforcement-learning","title":"Deep Reinforcement Learning","date":"2018-10-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"4a8a34b2b49ec731","code_sha256_prefix":"4a8a34b2b49ec731","mcp_get_code":{"code_sha256":"4a8a34b2b49ec731"}},{"arxiv_id":"1511.06335","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-deep-embedding-for-clustering","title":"Unsupervised Deep Embedding for Clustering Analysis","date":"2015-11-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yamilvindas/gdec","path":"src/utils/DEC.py","file_url":"https://github.com/yamilvindas/gdec/blob/HEAD/src/utils/DEC.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, yamilvindas/gdec (NOASSERTION)","code_sha256":"e160219c9330b06b","code_sha256_prefix":"e160219c9330b06b","mcp_get_code":{"code_sha256":"e160219c9330b06b"}}],"record_sha256":"92e50fab0838f664cee670a71206937652bac8f124f467dd7fe9174a5eadd17b","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}