{"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/dfs","entry":"dfs","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":13,"n_papers_ran":11,"n_papers_ran_no_instrument_failure":8,"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":12,"n_samples_ran":10,"n_samples_constructed":0,"n_samples_ran_checked":7,"n_samples_instrument":3,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":13,"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":1,"ran_violates":0,"ran_draft_wrong":3,"ran_fixture":0,"ran":6,"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":"2505.21825","arxiv_id_is_arxiv":true,"paper":"/paper/let-me-think-a-long-chain-of-thought-can-be","title":"Let Me Think! A Long Chain-of-Thought Can Be Worth Exponentially Many Short Ones","date":"2025-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"seyedparsa/let-me-think","path":"utils.py","file_url":"https://github.com/seyedparsa/let-me-think/blob/HEAD/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":"5a65e7c00db7acd4","code_sha256_prefix":"5a65e7c00db7acd4","mcp_get_code":{"code_sha256":"5a65e7c00db7acd4"}},{"arxiv_id":"2405.14622","arxiv_id_is_arxiv":true,"paper":"/paper/calibrated-self-rewarding-vision-language","title":"Calibrated Self-Rewarding Vision Language Models","date":"2024-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yiyangzhou/csr","path":"inference_csr/construct.py","file_url":"https://github.com/yiyangzhou/csr/blob/HEAD/inference_csr/construct.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, yiyangzhou/csr when it was checked","code_sha256":"2ba5f42674afcfe5","code_sha256_prefix":"2ba5f42674afcfe5","mcp_get_code":{"code_sha256":"2ba5f42674afcfe5"}},{"arxiv_id":"2403.16952","arxiv_id_is_arxiv":true,"paper":"/paper/data-mixing-laws-optimizing-data-mixtures-by","title":"Data Mixing Laws: Optimizing Data Mixtures by Predicting Language Modeling Performance","date":"2024-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yegcjs/mixinglaws","path":"pipeline/find_opt.py","file_url":"https://github.com/yegcjs/mixinglaws/blob/HEAD/pipeline/find_opt.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, yegcjs/mixinglaws when it was checked","code_sha256":"633fdf04a3299a5a","code_sha256_prefix":"633fdf04a3299a5a","mcp_get_code":{"code_sha256":"633fdf04a3299a5a"}},{"arxiv_id":"2402.11628","arxiv_id_is_arxiv":true,"paper":"/paper/discrete-neural-algorithmic-reasoning","title":"Discrete Neural Algorithmic Reasoning","date":"2024-02-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yandex-research/dnar","path":"generate_data.py","file_url":"https://github.com/yandex-research/dnar/blob/HEAD/generate_data.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"df4c2e1bb388ca7f","code_sha256_prefix":"df4c2e1bb388ca7f","mcp_get_code":{"code_sha256":"df4c2e1bb388ca7f"}},{"arxiv_id":"2303.11165","arxiv_id_is_arxiv":true,"paper":"/paper/computationally-budgeted-continual-learning","title":"Computationally Budgeted Continual Learning: What Does Matter?","date":"2023-03-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"drimpossible/BudgetCL","path":"scripts/check_img21k.py","file_url":"https://github.com/drimpossible/BudgetCL/blob/HEAD/scripts/check_img21k.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, drimpossible/BudgetCL, is not in the permissive set Syntology serves inline","code_sha256":"070032f773a19e6d","code_sha256_prefix":"070032f773a19e6d","mcp_get_code":{"code_sha256":"070032f773a19e6d"}},{"arxiv_id":"2303.00837","arxiv_id_is_arxiv":true,"paper":"/paper/predictive-flows-for-faster-ford-fulkerson","title":"Predictive Flows for Faster Ford-Fulkerson","date":null,"month_inferred_from_arxiv_id":"2023-03","title_source":"archive","repo":"wang-yuyan/warmstart-graphcut-algorithms-pulic","path":"augmentingPath.py","file_url":"https://github.com/wang-yuyan/warmstart-graphcut-algorithms-pulic/blob/HEAD/augmentingPath.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":"e503655d38845884","code_sha256_prefix":"e503655d38845884","mcp_get_code":{"code_sha256":"e503655d38845884"}},{"arxiv_id":"2301.11401","arxiv_id_is_arxiv":true,"paper":"/paper/causal-bandits-without-graph-learning","title":"Causal Bandits without Graph Learning","date":"2023-01-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"borealisai/raps","path":"raps/bandit.py","file_url":"https://github.com/borealisai/raps/blob/HEAD/raps/bandit.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","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, borealisai/raps (NOASSERTION)","code_sha256":"36d169e41efd9c11","code_sha256_prefix":"36d169e41efd9c11","mcp_get_code":{"code_sha256":"36d169e41efd9c11"}},{"arxiv_id":"2206.12411","arxiv_id_is_arxiv":true,"paper":"/paper/sample-efficiency-matters-a-benchmark-for","title":"Sample Efficiency Matters: A Benchmark for Practical Molecular Optimization","date":null,"month_inferred_from_arxiv_id":"2022-06","title_source":"archive","repo":"wenhao-gao/mol_opt","path":"main/jt_vae/fast_jtnn/mol_tree.py","file_url":"https://github.com/wenhao-gao/mol_opt/blob/HEAD/main/jt_vae/fast_jtnn/mol_tree.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":"4027a8a9d160edc2","code_sha256_prefix":"4027a8a9d160edc2","mcp_get_code":{"code_sha256":"4027a8a9d160edc2"}},{"arxiv_id":"2206.00668","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-untangle-genome-assembly-with","title":"Learning to Untangle Genome Assembly with Graph Convolutional Networks","date":"2022-06-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lvrcek/gnnome-assembly","path":"algorithms.py","file_url":"https://github.com/lvrcek/gnnome-assembly/blob/HEAD/algorithms.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":"ccbf684acb260268","code_sha256_prefix":"ccbf684acb260268","mcp_get_code":{"code_sha256":"ccbf684acb260268"}},{"arxiv_id":"2107.00096","arxiv_id_is_arxiv":true,"paper":"/paper/improving-black-box-optimization-in-vae","title":"Improving black-box optimization in VAE latent space using decoder uncertainty","date":"2021-06-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pascalnotin/uncertainty_guided_optimization","path":"JTVAE/fast_jtnn/mol_tree.py","file_url":"https://github.com/pascalnotin/uncertainty_guided_optimization/blob/HEAD/JTVAE/fast_jtnn/mol_tree.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":"4027a8a9d160edc2","code_sha256_prefix":"4027a8a9d160edc2","mcp_get_code":{"code_sha256":"4027a8a9d160edc2"}},{"arxiv_id":"2105.02725","arxiv_id_is_arxiv":true,"paper":"/paper/crosswalk-fairness-enhanced-node","title":"CrossWalk: Fairness-enhanced Node Representation Learning","date":"2021-05-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ahmadkhajehnejad/CrossWalk","path":"influence_maximization/fairinfMaximization.py","file_url":"https://github.com/ahmadkhajehnejad/CrossWalk/blob/HEAD/influence_maximization/fairinfMaximization.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, ahmadkhajehnejad/CrossWalk when it was checked","code_sha256":"15b2e1a629cd3e62","code_sha256_prefix":"15b2e1a629cd3e62","mcp_get_code":{"code_sha256":"15b2e1a629cd3e62"}},{"arxiv_id":"1810.08575","arxiv_id_is_arxiv":true,"paper":"/paper/supervising-strong-learners-by-amplifying","title":"Supervising strong learners by amplifying weak experts","date":"2018-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rmoehn/amplification","path":"amplification/tasks/equals.py","file_url":"https://github.com/rmoehn/amplification/blob/HEAD/amplification/tasks/equals.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, rmoehn/amplification, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"ab64ff670a8d3fc4","code_sha256_prefix":"ab64ff670a8d3fc4","mcp_get_code":{"code_sha256":"ab64ff670a8d3fc4"}},{"arxiv_id":"1409.1556","arxiv_id_is_arxiv":true,"paper":"/paper/very-deep-convolutional-networks-for-large","title":"Very Deep Convolutional Networks for Large-Scale Image Recognition","date":"2014-09-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MaliParag/ScanSSD","path":"gtdb/create_gt_math.py","file_url":"https://github.com/MaliParag/ScanSSD/blob/HEAD/gtdb/create_gt_math.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":"83cd98c436eef2a7","code_sha256_prefix":"83cd98c436eef2a7","mcp_get_code":{"code_sha256":"83cd98c436eef2a7"}}],"record_sha256":"916f4e12f57dcbdb84fa4373b954358fa13482f6b19b764d983f0b0a6db4df83","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}