{"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/extract-sections","entry":"extract_sections","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":6,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":2,"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":6,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":4,"n_samples_unverified":0,"n_samples_fingerprinted":4,"n_places":6,"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":0,"ran":2,"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":"2604.10261","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-10261","title":"The Amazing Agent Race: Strong Tool Users, Weak Navigators","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"minnesotanlp/the-amazing-agent-race","path":"src/trail/builder.py","file_url":"https://github.com/minnesotanlp/the-amazing-agent-race/blob/HEAD/src/trail/builder.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"16e79860878b0114","code_sha256_prefix":"16e79860878b0114","mcp_get_code":{"code_sha256":"16e79860878b0114"}},{"arxiv_id":"2506.04180","arxiv_id_is_arxiv":true,"paper":"/paper/superwriter-reflection-driven-long-form","title":"SuperWriter: Reflection-Driven Long-Form Generation with Large Language Models","date":"2025-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mozhu621/superwriter","path":"DPO/MCTS_inference.py","file_url":"https://github.com/mozhu621/superwriter/blob/HEAD/DPO/MCTS_inference.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, mozhu621/superwriter when it was checked","code_sha256":"fe3e8a34085bf9a8","code_sha256_prefix":"fe3e8a34085bf9a8","mcp_get_code":{"code_sha256":"fe3e8a34085bf9a8"}},{"arxiv_id":"2505.13934","arxiv_id_is_arxiv":true,"paper":"/paper/rlvr-world-training-world-models-with","title":"RLVR-World: Training World Models with Reinforcement Learning","date":"2025-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thuml/RLVR-World","path":"lang_wm/webagent/agent/world_model_agent.py","file_url":"https://github.com/thuml/RLVR-World/blob/HEAD/lang_wm/webagent/agent/world_model_agent.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":"ff25903c58c30586","code_sha256_prefix":"ff25903c58c30586","mcp_get_code":{"code_sha256":"ff25903c58c30586"}},{"arxiv_id":"2501.19201","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-reasoning-with-hidden-thinking","title":"Efficient Reasoning with Hidden Thinking","date":"2025-01-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shawnricecake/Heima","path":"heima/main_python/1_1-organize_dataset-num_thinking_tokens-fix_num.py","file_url":"https://github.com/shawnricecake/Heima/blob/HEAD/heima/main_python/1_1-organize_dataset-num_thinking_tokens-fix_num.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, shawnricecake/Heima when it was checked","code_sha256":"396e58efde50875b","code_sha256_prefix":"396e58efde50875b","mcp_get_code":{"code_sha256":"396e58efde50875b"}},{"arxiv_id":"2406.01940","arxiv_id_is_arxiv":true,"paper":"/paper/process-driven-autoformalization-in-lean-4","title":"Process-Driven Autoformalization in Lean 4","date":"2024-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rookie-joe/pda","path":"code/Dataset-Informalization/informalization_gemini.py","file_url":"https://github.com/rookie-joe/pda/blob/HEAD/code/Dataset-Informalization/informalization_gemini.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, rookie-joe/pda when it was checked","code_sha256":"fa8dfc944587b7b9","code_sha256_prefix":"fa8dfc944587b7b9","mcp_get_code":{"code_sha256":"fa8dfc944587b7b9"}},{"arxiv_id":"2112.05682","arxiv_id_is_arxiv":true,"paper":"/paper/self-attention-does-not-need-o-n-2-memory","title":"Self-attention Does Not Need $O(n^2)$ Memory","date":"2021-12-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"X-iZhang/Libra","path":"libra/eval/radiology_report.py","file_url":"https://github.com/X-iZhang/Libra/blob/HEAD/libra/eval/radiology_report.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":"fa3bb9e402f7460c","code_sha256_prefix":"fa3bb9e402f7460c","mcp_get_code":{"code_sha256":"fa3bb9e402f7460c"}}],"record_sha256":"5ac3a300c5100f2410cf3b2665c8b667df693bcf72aa8ef864a82fe78f2b9ceb","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}