{"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-program","entry":"extract_program","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":7,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":1,"n_papers_ran_instrument_only":6,"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":2,"n_samples_ran":2,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":1,"n_places":7,"n_places_pointer_only":6,"n_places_pointer_only_link_open":4,"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":1,"ran_fixture":0,"ran":1,"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":"2510.20342","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-20342","title":"Teaching Language Models to Reason with Tools","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"ChengpengLi1003/CoRT","path":"infer/parser.py","file_url":"https://github.com/ChengpengLi1003/CoRT/blob/HEAD/infer/parser.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, ChengpengLi1003/CoRT when it was checked","code_sha256":"1d961161c71cc153","code_sha256_prefix":"1d961161c71cc153","mcp_get_code":{"code_sha256":"1d961161c71cc153"}},{"arxiv_id":"2506.20512","arxiv_id_is_arxiv":true,"paper":"/paper/octothinker-mid-training-incentivizes","title":"OctoThinker: Mid-training Incentivizes Reinforcement Learning Scaling","date":"2025-06-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gair-nlp/octothinker","path":"eval/eval/eval_utils.py","file_url":"https://github.com/gair-nlp/octothinker/blob/HEAD/eval/eval/eval_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from ChengpengLi1003/CoRT, and GitHub detected no licence in that repository when it was checked","code_sha256":"1d961161c71cc153","code_sha256_prefix":"1d961161c71cc153","mcp_get_code":{"code_sha256":"1d961161c71cc153"}},{"arxiv_id":"2502.12067","arxiv_id_is_arxiv":true,"paper":"/paper/tokenskip-controllable-chain-of-thought","title":"TokenSkip: Controllable Chain-of-Thought Compression in LLMs","date":"2025-02-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hemingkx/TokenSkip","path":"eval/eval_utils.py","file_url":"https://github.com/hemingkx/TokenSkip/blob/HEAD/eval/eval_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from ChengpengLi1003/CoRT, and GitHub detected no licence in that repository when it was checked","code_sha256":"1d961161c71cc153","code_sha256_prefix":"1d961161c71cc153","mcp_get_code":{"code_sha256":"1d961161c71cc153"}},{"arxiv_id":"2406.18629","arxiv_id_is_arxiv":true,"paper":"/paper/step-dpo-step-wise-preference-optimization","title":"Step-DPO: Step-wise Preference Optimization for Long-chain Reasoning of LLMs","date":"2024-06-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dvlab-research/step-dpo","path":"evaluation/eval/eval_utils.py","file_url":"https://github.com/dvlab-research/step-dpo/blob/HEAD/evaluation/eval/eval_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, dvlab-research/step-dpo when it was checked","code_sha256":"1d961161c71cc153","code_sha256_prefix":"1d961161c71cc153","mcp_get_code":{"code_sha256":"1d961161c71cc153"}},{"arxiv_id":"2403.13315","arxiv_id_is_arxiv":true,"paper":"/paper/puzzlevqa-diagnosing-multimodal-reasoning","title":"PuzzleVQA: Diagnosing Multimodal Reasoning Challenges of Language Models with Abstract Visual Patterns","date":"2024-03-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"declare-lab/llm-puzzletest","path":"AlgoPuzzleVQA/python_executor.py","file_url":"https://github.com/declare-lab/llm-puzzletest/blob/HEAD/AlgoPuzzleVQA/python_executor.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from ChengpengLi1003/CoRT, and GitHub detected no licence in that repository when it was checked","code_sha256":"1d961161c71cc153","code_sha256_prefix":"1d961161c71cc153","mcp_get_code":{"code_sha256":"1d961161c71cc153"}},{"arxiv_id":"2309.17452","arxiv_id_is_arxiv":true,"paper":"/paper/tora-a-tool-integrated-reasoning-agent-for","title":"ToRA: A Tool-Integrated Reasoning Agent for Mathematical Problem Solving","date":"2023-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/tora","path":"src/utils/parser.py","file_url":"https://github.com/microsoft/tora/blob/HEAD/src/utils/parser.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from ChengpengLi1003/CoRT, and GitHub detected no licence in that repository when it was checked","code_sha256":"1d961161c71cc153","code_sha256_prefix":"1d961161c71cc153","mcp_get_code":{"code_sha256":"1d961161c71cc153"}},{"arxiv_id":"2108.00648","arxiv_id_is_arxiv":true,"paper":"/paper/from-lsat-the-progress-and-challenges-of","title":"From LSAT: The Progress and Challenges of Complex Reasoning","date":"2021-08-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhongwanjun/AR-LSAT","path":"ARM/pipeline/extract_program_argument.py","file_url":"https://github.com/zhongwanjun/AR-LSAT/blob/HEAD/ARM/pipeline/extract_program_argument.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":"3d29d2111932953c","code_sha256_prefix":"3d29d2111932953c","mcp_get_code":{"code_sha256":"3d29d2111932953c"}}],"record_sha256":"811a3e9b15adf4cae101d3287feafa7d48263181790a66dd782c4f0c8c8f18b5","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}