{"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-dist","entry":"get_dist","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":12,"n_papers_ran":12,"n_papers_ran_no_instrument_failure":6,"n_papers_ran_instrument_only":6,"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":11,"n_samples_ran":11,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":5,"n_samples_unverified":0,"n_samples_fingerprinted":3,"n_places":12,"n_places_pointer_only":3,"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":4,"ran_fixture":1,"ran":6,"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":"2410.19192","arxiv_id_is_arxiv":true,"paper":"/paper/team-topological-evolution-aware-framework","title":"TEAM: Topological Evolution-aware Framework for Traffic Forecasting--Extended Version","date":"2024-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kvmduc/TEAM-topo-evo-traffic-forecasting","path":"visualize_trn_v4_pems3.py","file_url":"https://github.com/kvmduc/TEAM-topo-evo-traffic-forecasting/blob/HEAD/visualize_trn_v4_pems3.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, kvmduc/TEAM-topo-evo-traffic-forecasting when it was checked","code_sha256":"a17b41579f6c0194","code_sha256_prefix":"a17b41579f6c0194","mcp_get_code":{"code_sha256":"a17b41579f6c0194"}},{"arxiv_id":"2409.06171","arxiv_id_is_arxiv":true,"paper":"/paper/loss-distillation-via-gradient-matching-for","title":"Loss Distillation via Gradient Matching for Point Cloud Completion with Weighted Chamfer Distance","date":"2024-09-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhang-vislab/iros2024-lossdistillationweightedcd","path":"codes/models/utils.py","file_url":"https://github.com/zhang-vislab/iros2024-lossdistillationweightedcd/blob/HEAD/codes/models/utils.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0e28797864c30a24","code_sha256_prefix":"0e28797864c30a24","mcp_get_code":{"code_sha256":"0e28797864c30a24"}},{"arxiv_id":"2311.01331","arxiv_id_is_arxiv":true,"paper":"/paper/offline-imitation-from-observation-via-primal","title":"Offline Imitation from Observation via Primal Wasserstein State Occupancy Matching","date":"2023-11-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KaiYan289/PW-DICE","path":"PWDICE_continuous/dist_metric.py","file_url":"https://github.com/KaiYan289/PW-DICE/blob/HEAD/PWDICE_continuous/dist_metric.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, KaiYan289/PW-DICE when it was checked","code_sha256":"ec8e6f427087880b","code_sha256_prefix":"ec8e6f427087880b","mcp_get_code":{"code_sha256":"ec8e6f427087880b"}},{"arxiv_id":"2210.16242","arxiv_id_is_arxiv":true,"paper":"/paper/fairness-certificates-for-differentially","title":"Differential Privacy has Bounded Impact on Fairness in Classification","date":"2022-10-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pmangold/fairness-privacy","path":"compute_bounds.py","file_url":"https://github.com/pmangold/fairness-privacy/blob/HEAD/compute_bounds.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":"bcf52db59fe0c761","code_sha256_prefix":"bcf52db59fe0c761","mcp_get_code":{"code_sha256":"bcf52db59fe0c761"}},{"arxiv_id":"2110.10083","arxiv_id_is_arxiv":true,"paper":"/paper/contrastive-active-inference","title":"Contrastive Active Inference","date":"2021-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mazpie/contrastive-aif","path":"agents.py","file_url":"https://github.com/mazpie/contrastive-aif/blob/HEAD/agents.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"49f065db9df001d7","code_sha256_prefix":"49f065db9df001d7","mcp_get_code":{"code_sha256":"49f065db9df001d7"}},{"arxiv_id":"2106.03521","arxiv_id_is_arxiv":true,"paper":"/paper/redditbias-a-real-world-resource-for-bias","title":"RedditBias: A Real-World Resource for Bias Evaluation and Debiasing of Conversational Language Models","date":"2021-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"umanlp/RedditBias","path":"DataExploration/sent_plots.py","file_url":"https://github.com/umanlp/RedditBias/blob/HEAD/DataExploration/sent_plots.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":"4c322db1733a4954","code_sha256_prefix":"4c322db1733a4954","mcp_get_code":{"code_sha256":"4c322db1733a4954"}},{"arxiv_id":"2106.01703","arxiv_id_is_arxiv":true,"paper":"/paper/fingerprinting-fine-tuned-language-models-in","title":"Fingerprinting Fine-tuned Language Models in the Wild","date":"2021-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LCS2-IIITD/ACL-FFLM","path":"models/generate-embed/ft/seq_classification.py","file_url":"https://github.com/LCS2-IIITD/ACL-FFLM/blob/HEAD/models/generate-embed/ft/seq_classification.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":"0d7d5e73ca198d40","code_sha256_prefix":"0d7d5e73ca198d40","mcp_get_code":{"code_sha256":"0d7d5e73ca198d40"}},{"arxiv_id":"2105.02838","arxiv_id_is_arxiv":true,"paper":"/paper/kuranet-systems-of-coupled-oscillators-that","title":"KuraNet: Systems of Coupled Oscillators that Learn to Synchronize","date":"2021-05-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"serre-lab/KuraNet","path":"data.py","file_url":"https://github.com/serre-lab/KuraNet/blob/HEAD/data.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":"dc420f95656ab9a9","code_sha256_prefix":"dc420f95656ab9a9","mcp_get_code":{"code_sha256":"dc420f95656ab9a9"}},{"arxiv_id":"2102.13268","arxiv_id_is_arxiv":true,"paper":"/paper/robust-deep-reinforcement-learning-via-multi","title":"DRIBO: Robust Deep Reinforcement Learning via Multi-View Information Bottleneck","date":"2021-02-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"BU-DEPEND-Lab/DRIBO","path":"DRIBO/DRIBO_sac.py","file_url":"https://github.com/BU-DEPEND-Lab/DRIBO/blob/HEAD/DRIBO/DRIBO_sac.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6e2c1f59f1d53fcc","code_sha256_prefix":"6e2c1f59f1d53fcc","mcp_get_code":{"code_sha256":"6e2c1f59f1d53fcc"}},{"arxiv_id":"1810.00956","arxiv_id_is_arxiv":true,"paper":"/paper/challenges-of-using-text-classifiers-for","title":"Challenges of Using Text Classifiers for Causal Inference","date":"2018-10-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zachwooddoughty/emnlp2018-causal","path":"measurement_error.py","file_url":"https://github.com/zachwooddoughty/emnlp2018-causal/blob/HEAD/measurement_error.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, zachwooddoughty/emnlp2018-causal when it was checked","code_sha256":"9db4f3457bf0c0fe","code_sha256_prefix":"9db4f3457bf0c0fe","mcp_get_code":{"code_sha256":"9db4f3457bf0c0fe"}},{"arxiv_id":"1803.08475","arxiv_id_is_arxiv":true,"paper":"/paper/attention-learn-to-solve-routing-problems","title":"Attention, Learn to Solve Routing Problems!","date":"2018-03-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Rintarooo/VRP_DRL_MHA","path":"PyTorch/dist_matrix.py","file_url":"https://github.com/Rintarooo/VRP_DRL_MHA/blob/HEAD/PyTorch/dist_matrix.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":"25f758eab8954cab","code_sha256_prefix":"25f758eab8954cab","mcp_get_code":{"code_sha256":"25f758eab8954cab"}},{"arxiv_id":"136630375","arxiv_id_is_arxiv":false,"paper":null,"title":"id 136630375 (not an arXiv id)","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"mmmmimic/diffConvNet","path":"models/utils.py","file_url":"https://github.com/mmmmimic/diffConvNet/blob/HEAD/models/utils.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0e28797864c30a24","code_sha256_prefix":"0e28797864c30a24","mcp_get_code":{"code_sha256":"0e28797864c30a24"}}],"record_sha256":"9aba2add7780971b1e699d558d2ae4399dca9ea917330e909468f3653080622d","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}