{"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/apply-overrides","entry":"apply_overrides","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":8,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":0,"n_papers_ran_instrument_only":7,"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":17,"n_samples_ran":11,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":11,"n_samples_unverified":6,"n_samples_fingerprinted":0,"n_places":17,"n_places_pointer_only":9,"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":11,"ran_fixture":0,"ran":0,"unverified":6},"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":"2609.00832","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2609-00832","title":"TWIX: a Two-Stage Approach for End-To-End Named Entity Recognition and Relation Extraction","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"MMartinelli-hub/GBIE26_TWIX","path":"run_baseline_entity_linker.py","file_url":"https://github.com/MMartinelli-hub/GBIE26_TWIX/blob/HEAD/run_baseline_entity_linker.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, MMartinelli-hub/GBIE26_TWIX when it was checked","code_sha256":"23b85f538a0ebc9d","code_sha256_prefix":"23b85f538a0ebc9d","mcp_get_code":{"code_sha256":"23b85f538a0ebc9d"}},{"arxiv_id":"2609.00832","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2609-00832","title":"TWIX: a Two-Stage Approach for End-To-End Named Entity Recognition and Relation Extraction","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"MMartinelli-hub/GBIE26_TWIX","path":"run_entity_linker.py","file_url":"https://github.com/MMartinelli-hub/GBIE26_TWIX/blob/HEAD/run_entity_linker.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, MMartinelli-hub/GBIE26_TWIX when it was checked","code_sha256":"343ad3f08c80f8cc","code_sha256_prefix":"343ad3f08c80f8cc","mcp_get_code":{"code_sha256":"343ad3f08c80f8cc"}},{"arxiv_id":"2609.00832","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2609-00832","title":"TWIX: a Two-Stage Approach for End-To-End Named Entity Recognition and Relation Extraction","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"MMartinelli-hub/GBIE26_TWIX","path":"run_entity_recognizer.py","file_url":"https://github.com/MMartinelli-hub/GBIE26_TWIX/blob/HEAD/run_entity_recognizer.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, MMartinelli-hub/GBIE26_TWIX when it was checked","code_sha256":"00a142e28c43a80f","code_sha256_prefix":"00a142e28c43a80f","mcp_get_code":{"code_sha256":"00a142e28c43a80f"}},{"arxiv_id":"2609.00832","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2609-00832","title":"TWIX: a Two-Stage Approach for End-To-End Named Entity Recognition and Relation Extraction","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"MMartinelli-hub/GBIE26_TWIX","path":"run_ner_ensemble.py","file_url":"https://github.com/MMartinelli-hub/GBIE26_TWIX/blob/HEAD/run_ner_ensemble.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, MMartinelli-hub/GBIE26_TWIX when it was checked","code_sha256":"a34a593a48387737","code_sha256_prefix":"a34a593a48387737","mcp_get_code":{"code_sha256":"a34a593a48387737"}},{"arxiv_id":"2609.00832","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2609-00832","title":"TWIX: a Two-Stage Approach for End-To-End Named Entity Recognition and Relation Extraction","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"MMartinelli-hub/GBIE26_TWIX","path":"run_relation_extractor.py","file_url":"https://github.com/MMartinelli-hub/GBIE26_TWIX/blob/HEAD/run_relation_extractor.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, MMartinelli-hub/GBIE26_TWIX when it was checked","code_sha256":"dcf2e724922d6e1b","code_sha256_prefix":"dcf2e724922d6e1b","mcp_get_code":{"code_sha256":"dcf2e724922d6e1b"}},{"arxiv_id":"2609.00832","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2609-00832","title":"TWIX: a Two-Stage Approach for End-To-End Named Entity Recognition and Relation Extraction","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"MMartinelli-hub/GBIE26_TWIX","path":"run_term_classifier.py","file_url":"https://github.com/MMartinelli-hub/GBIE26_TWIX/blob/HEAD/run_term_classifier.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, MMartinelli-hub/GBIE26_TWIX when it was checked","code_sha256":"c17d67ff90b6bab6","code_sha256_prefix":"c17d67ff90b6bab6","mcp_get_code":{"code_sha256":"c17d67ff90b6bab6"}},{"arxiv_id":"2608.30661","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-30661","title":"SwarmBench: Can Large Language Models Act as Agent Swarm Orchestrators?","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"ying1973/SwarmBench","path":"swarm-bench/benchmark/config.py","file_url":"https://github.com/ying1973/SwarmBench/blob/HEAD/swarm-bench/benchmark/config.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_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, ying1973/SwarmBench when it was checked","code_sha256":"1a71c59407276e4b","code_sha256_prefix":"1a71c59407276e4b","mcp_get_code":{"code_sha256":"1a71c59407276e4b"}},{"arxiv_id":"2607.12086","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-12086","title":"CityBehavEx: A Scalable and Empirically Validated LLM-Assisted Urban Simulation Platform","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"gefgu/citybehavex","path":"citybehavex/config/io.py","file_url":"https://github.com/gefgu/citybehavex/blob/HEAD/citybehavex/config/io.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"AGPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"AGPL-3.0, as GitHub detects it on this paper's repository, gefgu/citybehavex, is not in the permissive set Syntology serves inline","code_sha256":"3b8446866b6787bb","code_sha256_prefix":"3b8446866b6787bb","mcp_get_code":{"code_sha256":"3b8446866b6787bb"}},{"arxiv_id":"2606.22305","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-22305","title":"Learning at the Right Pace: Adaptive Data Scheduling Improves LLM Reinforcement Learning","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"Richard-zrx/ADS","path":"src/cluster_embeddings.py","file_url":"https://github.com/Richard-zrx/ADS/blob/HEAD/src/cluster_embeddings.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":"189c9ff78bd2b468","code_sha256_prefix":"189c9ff78bd2b468","mcp_get_code":{"code_sha256":"189c9ff78bd2b468"}},{"arxiv_id":"2606.22305","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-22305","title":"Learning at the Right Pace: Adaptive Data Scheduling Improves LLM Reinforcement Learning","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"Richard-zrx/ADS","path":"src/compute_difficulty.py","file_url":"https://github.com/Richard-zrx/ADS/blob/HEAD/src/compute_difficulty.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":"935fcc3e4436189a","code_sha256_prefix":"935fcc3e4436189a","mcp_get_code":{"code_sha256":"935fcc3e4436189a"}},{"arxiv_id":"2606.22305","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-22305","title":"Learning at the Right Pace: Adaptive Data Scheduling Improves LLM Reinforcement Learning","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"Richard-zrx/ADS","path":"src/export_cluster_examples.py","file_url":"https://github.com/Richard-zrx/ADS/blob/HEAD/src/export_cluster_examples.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":"78858b5a31e7c77f","code_sha256_prefix":"78858b5a31e7c77f","mcp_get_code":{"code_sha256":"78858b5a31e7c77f"}},{"arxiv_id":"2606.22305","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-22305","title":"Learning at the Right Pace: Adaptive Data Scheduling Improves LLM Reinforcement Learning","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"Richard-zrx/ADS","path":"src/extract_embeddings.py","file_url":"https://github.com/Richard-zrx/ADS/blob/HEAD/src/extract_embeddings.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":"b6fa95adbe2428b5","code_sha256_prefix":"b6fa95adbe2428b5","mcp_get_code":{"code_sha256":"b6fa95adbe2428b5"}},{"arxiv_id":"2606.22305","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-22305","title":"Learning at the Right Pace: Adaptive Data Scheduling Improves LLM Reinforcement Learning","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"Richard-zrx/ADS","path":"src/inspect_embeddings.py","file_url":"https://github.com/Richard-zrx/ADS/blob/HEAD/src/inspect_embeddings.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":"47c1dc9fe9a63cf6","code_sha256_prefix":"47c1dc9fe9a63cf6","mcp_get_code":{"code_sha256":"47c1dc9fe9a63cf6"}},{"arxiv_id":"2606.15359","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-15359","title":"DiRecT: Safe Diffusion-Based Planning via Receding-Horizon Denoising","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"azizanlab/DiRecT","path":"maze2d/config.py","file_url":"https://github.com/azizanlab/DiRecT/blob/HEAD/maze2d/config.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":"67e0bf797f8c5a5e","code_sha256_prefix":"67e0bf797f8c5a5e","mcp_get_code":{"code_sha256":"67e0bf797f8c5a5e"}},{"arxiv_id":"2605.30415","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-30415","title":"Domain Adaptation and Reasoning Frameworks in Language Models: A Controlled Experiment with Historical Cosmology","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"fdeberna/chat-ptolemaic","path":"pipeline/config_utils.py","file_url":"https://github.com/fdeberna/chat-ptolemaic/blob/HEAD/pipeline/config_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_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, fdeberna/chat-ptolemaic when it was checked","code_sha256":"a8685c36310c970c","code_sha256_prefix":"a8685c36310c970c","mcp_get_code":{"code_sha256":"a8685c36310c970c"}},{"arxiv_id":"2605.17373","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-17373","title":"FML-bench: A Controlled Study of AI Research Agent Strategies from the Perspective of Search Dynamics","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"qrzou/FML-bench","path":"run_agent_benchmark.py","file_url":"https://github.com/qrzou/FML-bench/blob/HEAD/run_agent_benchmark.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":"c1dad570c33f51c5","code_sha256_prefix":"c1dad570c33f51c5","mcp_get_code":{"code_sha256":"c1dad570c33f51c5"}},{"arxiv_id":"2509.23385","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2509-23385","title":"Flow Matching Calibration for Simulation-Based Inference under Model Misspecification","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"pruhlmann/FMCPE","path":"benchmark/common.py","file_url":"https://github.com/pruhlmann/FMCPE/blob/HEAD/benchmark/common.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":"5a10e7800bbc9e4d","code_sha256_prefix":"5a10e7800bbc9e4d","mcp_get_code":{"code_sha256":"5a10e7800bbc9e4d"}}],"record_sha256":"34093566b5eb16d555e33275437b3a8a777d622a734ee3c6a842fbdb1309c536","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}