{"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/sample-data","entry":"sample_data","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":15,"n_papers_ran":13,"n_papers_ran_no_instrument_failure":9,"n_papers_ran_instrument_only":4,"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":16,"n_samples_ran":13,"n_samples_constructed":0,"n_samples_ran_checked":9,"n_samples_instrument":4,"n_samples_unverified":3,"n_samples_fingerprinted":7,"n_places":16,"n_places_pointer_only":2,"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":3,"ran_fixture":1,"ran":9,"unverified":3},"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":"2509.25050","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2509-25050","title":"Advantage Weighted Matching: Aligning RL with Pretraining in Diffusion Models","date":"2025-09-29","month_inferred_from_arxiv_id":null,"title_source":"syntology","repo":"scxue/advantage_weighted_matching","path":"advantage_weighted_matching/dataset/merge_genevaltask.py","file_url":"https://github.com/scxue/advantage_weighted_matching/blob/HEAD/advantage_weighted_matching/dataset/merge_genevaltask.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"eca464d584595994","code_sha256_prefix":"eca464d584595994","mcp_get_code":{"code_sha256":"eca464d584595994"}},{"arxiv_id":"2506.00045","arxiv_id_is_arxiv":true,"paper":"/paper/ace-step-a-step-towards-music-generation","title":"ACE-Step: A Step Towards Music Generation Foundation Model","date":null,"month_inferred_from_arxiv_id":"2025-06","title_source":"archive","repo":"ace-step/ACE-Step","path":"infer.py","file_url":"https://github.com/ace-step/ACE-Step/blob/HEAD/infer.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":"e4dd332afe7c6637","code_sha256_prefix":"e4dd332afe7c6637","mcp_get_code":{"code_sha256":"e4dd332afe7c6637"}},{"arxiv_id":"2410.22587","arxiv_id_is_arxiv":true,"paper":"/paper/toxicity-of-the-commons-curating-open-source","title":"Toxicity of the Commons: Curating Open-Source Pre-Training Data","date":"2024-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Pleias/toxic-commons","path":"src/4.1_prepare_data.py","file_url":"https://github.com/Pleias/toxic-commons/blob/HEAD/src/4.1_prepare_data.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":"65351553ca1db78e","code_sha256_prefix":"65351553ca1db78e","mcp_get_code":{"code_sha256":"65351553ca1db78e"}},{"arxiv_id":"2408.16218","arxiv_id_is_arxiv":true,"paper":"/paper/targeted-cause-discovery-with-data-driven","title":"Large-Scale Targeted Cause Discovery with Data-Driven Learning","date":"2024-08-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"snu-mllab/targeted-cause-discovery","path":"inference.py","file_url":"https://github.com/snu-mllab/targeted-cause-discovery/blob/HEAD/inference.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":"56ea6aae53a146a1","code_sha256_prefix":"56ea6aae53a146a1","mcp_get_code":{"code_sha256":"56ea6aae53a146a1"}},{"arxiv_id":"2408.16218","arxiv_id_is_arxiv":true,"paper":"/paper/targeted-cause-discovery-with-data-driven","title":"Large-Scale Targeted Cause Discovery with Data-Driven Learning","date":"2024-08-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"snu-mllab/targeted-cause-discovery","path":"train/src/inference.py","file_url":"https://github.com/snu-mllab/targeted-cause-discovery/blob/HEAD/train/src/inference.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":"b8383eea50132f3b","code_sha256_prefix":"b8383eea50132f3b","mcp_get_code":{"code_sha256":"b8383eea50132f3b"}},{"arxiv_id":"2403.14843","arxiv_id_is_arxiv":true,"paper":"/paper/local-causal-discovery-with-linear-non","title":"Local Causal Discovery with Linear non-Gaussian Cyclic Models","date":"2024-03-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"markdana/local-ling-discovery","path":"data_loader/sample_data.py","file_url":"https://github.com/markdana/local-ling-discovery/blob/HEAD/data_loader/sample_data.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":"d81335fb6c059e2a","code_sha256_prefix":"d81335fb6c059e2a","mcp_get_code":{"code_sha256":"d81335fb6c059e2a"}},{"arxiv_id":"2402.12233","arxiv_id_is_arxiv":true,"paper":"/paper/empirical-study-on-updating-key-value","title":"Empirical Study on Updating Key-Value Memories in Transformer Feed-forward Layers","date":"2024-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qiuzh20/tuning-keys-v.s.-values","path":"prompts.py","file_url":"https://github.com/qiuzh20/tuning-keys-v.s.-values/blob/HEAD/prompts.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":"a52305d9df6bf8f4","code_sha256_prefix":"a52305d9df6bf8f4","mcp_get_code":{"code_sha256":"a52305d9df6bf8f4"}},{"arxiv_id":"2305.14077","arxiv_id_is_arxiv":true,"paper":"/paper/mind-the-spikes-benign-overfitting-of-kernels","title":"Mind the spikes: Benign overfitting of kernels and neural networks in fixed dimension","date":"2023-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"moritzhaas/mind-the-spikes","path":"train_spikysmooth_nns.py","file_url":"https://github.com/moritzhaas/mind-the-spikes/blob/HEAD/train_spikysmooth_nns.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d5e547150d151fe8","code_sha256_prefix":"d5e547150d151fe8","mcp_get_code":{"code_sha256":"d5e547150d151fe8"}},{"arxiv_id":"2305.13112","arxiv_id_is_arxiv":true,"paper":"/paper/rethinking-the-evaluation-for-conversational","title":"Rethinking the Evaluation for Conversational Recommendation in the Era of Large Language Models","date":"2023-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rucaibox/ievalm-crs","path":"src/model/utils.py","file_url":"https://github.com/rucaibox/ievalm-crs/blob/HEAD/src/model/utils.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":"82d4d951d061c46e","code_sha256_prefix":"82d4d951d061c46e","mcp_get_code":{"code_sha256":"82d4d951d061c46e"}},{"arxiv_id":"2209.15486","arxiv_id_is_arxiv":true,"paper":"/paper/graph-neural-networks-for-link-prediction","title":"Graph Neural Networks for Link Prediction with Subgraph Sketching","date":"2022-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"melifluos/subgraph-sketching","path":"src/datasets/seal.py","file_url":"https://github.com/melifluos/subgraph-sketching/blob/HEAD/src/datasets/seal.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":"fd09cb2e05ebf840","code_sha256_prefix":"fd09cb2e05ebf840","mcp_get_code":{"code_sha256":"fd09cb2e05ebf840"}},{"arxiv_id":"2209.05434","arxiv_id_is_arxiv":true,"paper":"/paper/explicitly-controllable-3d-aware-portrait","title":"3DFaceShop: Explicitly Controllable 3D-Aware Portrait Generation","date":"2022-09-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"junshutang/3DFaceShop","path":"train_vae.py","file_url":"https://github.com/junshutang/3DFaceShop/blob/HEAD/train_vae.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, junshutang/3DFaceShop when it was checked","code_sha256":"76e5445b8839d546","code_sha256_prefix":"76e5445b8839d546","mcp_get_code":{"code_sha256":"76e5445b8839d546"}},{"arxiv_id":"2003.03030","arxiv_id_is_arxiv":true,"paper":"/paper/clean-label-backdoor-attacks-on-video","title":"Clean-Label Backdoor Attacks on Video Recognition Models","date":"2020-03-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ShihaoZhaoZSH/Video-Backdoor-Attack","path":"input_data.py","file_url":"https://github.com/ShihaoZhaoZSH/Video-Backdoor-Attack/blob/HEAD/input_data.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"19178582a4611840","code_sha256_prefix":"19178582a4611840","mcp_get_code":{"code_sha256":"19178582a4611840"}},{"arxiv_id":"1910.06849","arxiv_id_is_arxiv":true,"paper":"/paper/deepgcns-making-gcns-go-as-deep-as-cnns","title":"DeepGCNs: Making GCNs Go as Deep as CNNs","date":"2019-10-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lightaime/deep_gcns","path":"sem_seg/indoor3d_util.py","file_url":"https://github.com/lightaime/deep_gcns/blob/HEAD/sem_seg/indoor3d_util.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":"5b5f8b1b747b7afa","code_sha256_prefix":"5b5f8b1b747b7afa","mcp_get_code":{"code_sha256":"5b5f8b1b747b7afa"}},{"arxiv_id":"1909.09436","arxiv_id_is_arxiv":true,"paper":"/paper/codesearchnet-challenge-evaluating-the-state","title":"CodeSearchNet Challenge: Evaluating the State of Semantic Code Search","date":"2019-09-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jmg764/CodeSearchNet-Challenge","path":"src/error_analysis.py","file_url":"https://github.com/jmg764/CodeSearchNet-Challenge/blob/HEAD/src/error_analysis.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":"4071a311ada99ce3","code_sha256_prefix":"4071a311ada99ce3","mcp_get_code":{"code_sha256":"4071a311ada99ce3"}},{"arxiv_id":"1906.01930","arxiv_id_is_arxiv":true,"paper":"/paper/approximate-inference-turns-deep-networks","title":"Approximate Inference Turns Deep Networks into Gaussian Processes","date":"2019-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"team-approx-bayes/dnn2gp","path":"marglik.py","file_url":"https://github.com/team-approx-bayes/dnn2gp/blob/HEAD/marglik.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, team-approx-bayes/dnn2gp when it was checked","code_sha256":"5d4db3aeca9aaf08","code_sha256_prefix":"5d4db3aeca9aaf08","mcp_get_code":{"code_sha256":"5d4db3aeca9aaf08"}},{"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/indoor3d_util.py","file_url":"https://github.com/dlinzhao/JSNet/blob/HEAD/utils/indoor3d_util.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":"d5e2646148b5ce4e","code_sha256_prefix":"d5e2646148b5ce4e","mcp_get_code":{"code_sha256":"d5e2646148b5ce4e"}}],"record_sha256":"7eeb577b9d9c72ebedaae055486a0d2262edbb3737c26462653d4401f3c2b984","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}