{"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/gen","entry":"gen","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":10,"n_papers_ran_no_instrument_failure":7,"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":9,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":3,"n_samples_unverified":9,"n_samples_fingerprinted":2,"n_places":19,"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":1,"ran_draft_wrong":3,"ran_fixture":0,"ran":5,"unverified":9},"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":"2608.02985","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-02985","title":"Temporal Leakage in LLM Backtesting: Measurement, Validation, and Adjusted Scores","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"ZeyuZhang1901/Temporal-Leakage-Backtesting","path":"M1_synthetic/run_m1.py","file_url":"https://github.com/ZeyuZhang1901/Temporal-Leakage-Backtesting/blob/HEAD/M1_synthetic/run_m1.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, ZeyuZhang1901/Temporal-Leakage-Backtesting when it was checked","code_sha256":"49f00b7007ebbecd","code_sha256_prefix":"49f00b7007ebbecd","mcp_get_code":{"code_sha256":"49f00b7007ebbecd"}},{"arxiv_id":"2507.22606","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2507.22606","date":null,"month_inferred_from_arxiv_id":"2025-07","title_source":null,"repo":"SaFoLab-WISC/MetaAgent","path":"baseclass/FSM_Gen.py","file_url":"https://github.com/SaFoLab-WISC/MetaAgent/blob/HEAD/baseclass/FSM_Gen.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, SaFoLab-WISC/MetaAgent when it was checked","code_sha256":"9eb255b682028ba6","code_sha256_prefix":"9eb255b682028ba6","mcp_get_code":{"code_sha256":"9eb255b682028ba6"}},{"arxiv_id":"2503.07604","arxiv_id_is_arxiv":true,"paper":"/paper/implicit-reasoning-in-transformers-is","title":"Implicit Reasoning in Transformers is Reasoning through Shortcuts","date":"2025-03-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TianheL/LM-Implicit-Reasoning","path":"src/testllm/gen_testdata.py","file_url":"https://github.com/TianheL/LM-Implicit-Reasoning/blob/HEAD/src/testllm/gen_testdata.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":"0fd288bf0e1555c6","code_sha256_prefix":"0fd288bf0e1555c6","mcp_get_code":{"code_sha256":"0fd288bf0e1555c6"}},{"arxiv_id":"2503.00325","arxiv_id_is_arxiv":true,"paper":"/paper/cadref-robust-out-of-distribution-detection","title":"CADRef: Robust Out-of-Distribution Detection via Class-Aware Decoupled Relative Feature Leveraging","date":"2025-03-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LingAndZero/CADRef","path":"ood_methods/CADRef.py","file_url":"https://github.com/LingAndZero/CADRef/blob/HEAD/ood_methods/CADRef.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"CC0-1.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0935583dca415040","code_sha256_prefix":"0935583dca415040","mcp_get_code":{"code_sha256":"0935583dca415040"}},{"arxiv_id":"2502.12018","arxiv_id_is_arxiv":true,"paper":"/paper/atom-of-thoughts-for-markov-llm-test-time","title":"Atom of Thoughts for Markov LLM Test-Time Scaling","date":"2025-02-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qixucen/atom","path":"experiment/module.py","file_url":"https://github.com/qixucen/atom/blob/HEAD/experiment/module.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":"d649ba329da48188","code_sha256_prefix":"d649ba329da48188","mcp_get_code":{"code_sha256":"d649ba329da48188"}},{"arxiv_id":"2410.05255","arxiv_id_is_arxiv":true,"paper":"/paper/seppo-semi-policy-preference-optimization-for","title":"SePPO: Semi-Policy Preference Optimization for Diffusion Alignment","date":"2024-10-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dwanzhang-ai/seppo","path":"valid_scores.py","file_url":"https://github.com/dwanzhang-ai/seppo/blob/HEAD/valid_scores.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, dwanzhang-ai/seppo when it was checked","code_sha256":"7615925efad31c2f","code_sha256_prefix":"7615925efad31c2f","mcp_get_code":{"code_sha256":"7615925efad31c2f"}},{"arxiv_id":"2404.09730","arxiv_id_is_arxiv":true,"paper":"/paper/convergence-analysis-of-probability-flow-ode","title":"Convergence Analysis of Probability Flow ODE for Score-based Generative Models","date":"2024-04-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Zhengyu-Huang/InverseProblems.jl","path":"Baselines/WALNUTS/Funnel.py","file_url":"https://github.com/Zhengyu-Huang/InverseProblems.jl/blob/HEAD/Baselines/WALNUTS/Funnel.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, Zhengyu-Huang/InverseProblems.jl when it was checked","code_sha256":"f3d9f241c63f24aa","code_sha256_prefix":"f3d9f241c63f24aa","mcp_get_code":{"code_sha256":"f3d9f241c63f24aa"}},{"arxiv_id":"2311.09433","arxiv_id_is_arxiv":true,"paper":"/paper/backdoor-activation-attack-attack-large","title":"Trojan Activation Attack: Red-Teaming Large Language Models using Activation Steering for Safety-Alignment","date":"2023-11-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wang2226/backdoor-activation-attack","path":"clean_run.py","file_url":"https://github.com/wang2226/backdoor-activation-attack/blob/HEAD/clean_run.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, wang2226/backdoor-activation-attack when it was checked","code_sha256":"01e01256ca25545a","code_sha256_prefix":"01e01256ca25545a","mcp_get_code":{"code_sha256":"01e01256ca25545a"}},{"arxiv_id":"2303.03004","arxiv_id_is_arxiv":true,"paper":"/paper/xcodeeval-a-large-scale-multilingual","title":"xCodeEval: A Large Scale Multilingual Multitask Benchmark for Code Understanding, Generation, Translation and Retrieval","date":"2023-03-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ntunlp/xCodeEval","path":"evaluation/apr/gen_apr.py","file_url":"https://github.com/ntunlp/xCodeEval/blob/HEAD/evaluation/apr/gen_apr.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":"6a4d42b2ab72899a","code_sha256_prefix":"6a4d42b2ab72899a","mcp_get_code":{"code_sha256":"6a4d42b2ab72899a"}},{"arxiv_id":"2302.13971","arxiv_id_is_arxiv":true,"paper":"/paper/llama-open-and-efficient-foundation-language-1","title":"LLaMA: Open and Efficient Foundation Language Models","date":"2023-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ofa-sys/expertllama","path":"model/gen_demo.py","file_url":"https://github.com/ofa-sys/expertllama/blob/HEAD/model/gen_demo.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":"ef609b4fb59efa8a","code_sha256_prefix":"ef609b4fb59efa8a","mcp_get_code":{"code_sha256":"ef609b4fb59efa8a"}},{"arxiv_id":"2301.02344","arxiv_id_is_arxiv":true,"paper":"/paper/trojanpuzzle-covertly-poisoning-code","title":"TrojanPuzzle: Covertly Poisoning Code-Suggestion Models","date":"2023-01-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/codegenerationpoisoning","path":"SalesforceCodeGen/training/fine_tune.py","file_url":"https://github.com/microsoft/codegenerationpoisoning/blob/HEAD/SalesforceCodeGen/training/fine_tune.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":"ba8d70941078ed2f","code_sha256_prefix":"ba8d70941078ed2f","mcp_get_code":{"code_sha256":"ba8d70941078ed2f"}},{"arxiv_id":"2208.01230","arxiv_id_is_arxiv":true,"paper":"/paper/a-multifaceted-benchmarking-of-synthetic","title":"A Multifaceted Benchmarking of Synthetic Electronic Health Record Generation Models","date":"2022-08-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yy6linda/synthetic-ehr-benchmarking","path":"data_generation/uw/dpgan.py","file_url":"https://github.com/yy6linda/synthetic-ehr-benchmarking/blob/HEAD/data_generation/uw/dpgan.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":"a9358df49bc7df73","code_sha256_prefix":"a9358df49bc7df73","mcp_get_code":{"code_sha256":"a9358df49bc7df73"}},{"arxiv_id":"2208.01230","arxiv_id_is_arxiv":true,"paper":"/paper/a-multifaceted-benchmarking-of-synthetic","title":"A Multifaceted Benchmarking of Synthetic Electronic Health Record Generation Models","date":"2022-08-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yy6linda/synthetic-ehr-benchmarking","path":"data_generation/uw/emrwgan.py","file_url":"https://github.com/yy6linda/synthetic-ehr-benchmarking/blob/HEAD/data_generation/uw/emrwgan.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":"b2c6a7a16c604d07","code_sha256_prefix":"b2c6a7a16c604d07","mcp_get_code":{"code_sha256":"b2c6a7a16c604d07"}},{"arxiv_id":"2204.07937","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-cross-task-generalization-via","title":"Unsupervised Cross-Task Generalization via Retrieval Augmentation","date":"2022-04-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"INK-USC/ReCross","path":"metax/commons.py","file_url":"https://github.com/INK-USC/ReCross/blob/HEAD/metax/commons.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":"55ff340691da06d2","code_sha256_prefix":"55ff340691da06d2","mcp_get_code":{"code_sha256":"55ff340691da06d2"}},{"arxiv_id":"2201.03533","arxiv_id_is_arxiv":true,"paper":"/paper/scrolls-standardized-comparison-over-long","title":"SCROLLS: Standardized CompaRison Over Long Language Sequences","date":"2022-01-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tau-nlp/scrolls","path":"baselines/src/utils/namegenerator.py","file_url":"https://github.com/tau-nlp/scrolls/blob/HEAD/baselines/src/utils/namegenerator.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":"357bcaff2fb41a9f","code_sha256_prefix":"357bcaff2fb41a9f","mcp_get_code":{"code_sha256":"357bcaff2fb41a9f"}},{"arxiv_id":"2110.02912","arxiv_id_is_arxiv":true,"paper":"/paper/generative-optimization-networks-for-memory","title":"Generative Optimization Networks for Memory Efficient Data Generation","date":"2021-10-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"imperial-qore/gon_mnist","path":"src/gen.py","file_url":"https://github.com/imperial-qore/gon_mnist/blob/HEAD/src/gen.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f535d57fd3599c39","code_sha256_prefix":"f535d57fd3599c39","mcp_get_code":{"code_sha256":"f535d57fd3599c39"}},{"arxiv_id":"2102.03150","arxiv_id_is_arxiv":true,"paper":"/paper/equivariant-message-passing-for-the","title":"Equivariant message passing for the prediction of tensorial properties and molecular spectra","date":"2021-02-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"learningmatter-mit/NeuralForceField","path":"nff/nn/models/painn.py","file_url":"https://github.com/learningmatter-mit/NeuralForceField/blob/HEAD/nff/nn/models/painn.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"07fc732b54bba7cd","code_sha256_prefix":"07fc732b54bba7cd","mcp_get_code":{"code_sha256":"07fc732b54bba7cd"}},{"arxiv_id":"2003.08935","arxiv_id_is_arxiv":true,"paper":"/paper/group-sparsity-the-hinge-between-filter","title":"Group Sparsity: The Hinge Between Filter Pruning and Decomposition for Network Compression","date":"2020-03-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ofsoundof/group_sparsity","path":"model/densenet.py","file_url":"https://github.com/ofsoundof/group_sparsity/blob/HEAD/model/densenet.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":"3dd7f9208f8f454c","code_sha256_prefix":"3dd7f9208f8f454c","mcp_get_code":{"code_sha256":"3dd7f9208f8f454c"}},{"arxiv_id":"1908.08932","arxiv_id_is_arxiv":true,"paper":"/paper/learning-filter-basis-for-convolutional","title":"Learning Filter Basis for Convolutional Neural Network Compression","date":"2019-08-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ofsoundof/learning_filter_basis","path":"image_classification/model/densenet.py","file_url":"https://github.com/ofsoundof/learning_filter_basis/blob/HEAD/image_classification/model/densenet.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":"3dd7f9208f8f454c","code_sha256_prefix":"3dd7f9208f8f454c","mcp_get_code":{"code_sha256":"3dd7f9208f8f454c"}}],"record_sha256":"d75c5a164a5309f97d5c8a1b84cc016446ad4fdcfaad4ea3821ecaf9961a5d16","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}