{"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-xml-answer","entry":"extract_xml_answer","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":8,"n_papers_ran_no_instrument_failure":2,"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":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":6,"n_places":8,"n_places_pointer_only":4,"n_places_pointer_only_link_open":1,"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":4,"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":"2606.18195","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-18195","title":"Learning from the Self-future: On-policy Self-distillation for dLLMs","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"xingzhejun/d-OPSD","path":"d-opsd/reward_func.py","file_url":"https://github.com/xingzhejun/d-OPSD/blob/HEAD/d-opsd/reward_func.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, xingzhejun/d-OPSD when it was checked","code_sha256":"08fcee8ccfd3d4a9","code_sha256_prefix":"08fcee8ccfd3d4a9","mcp_get_code":{"code_sha256":"08fcee8ccfd3d4a9"}},{"arxiv_id":"2606.16517","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-16517","title":"How Post-Training Shapes Biological Reasoning Models","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"mims-harvard/bio-posttrain","path":"BioReason/reason.py","file_url":"https://github.com/mims-harvard/bio-posttrain/blob/HEAD/BioReason/reason.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, mims-harvard/bio-posttrain (NOASSERTION)","code_sha256":"3fca4c3b8039e70a","code_sha256_prefix":"3fca4c3b8039e70a","mcp_get_code":{"code_sha256":"3fca4c3b8039e70a"}},{"arxiv_id":"2603.02215","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-02215","title":"RxnNano:Training Compact LLMs for Chemical Reaction and Retrosynthesis Prediction via Hierarchical Curriculum Learning","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"rlisml/RxnNano","path":"src/evaluation/metrics.py","file_url":"https://github.com/rlisml/RxnNano/blob/HEAD/src/evaluation/metrics.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":"697299f1698779c5","code_sha256_prefix":"697299f1698779c5","mcp_get_code":{"code_sha256":"697299f1698779c5"}},{"arxiv_id":"2602.19049","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-19049","title":"IAPO: Information-Aware Policy Optimization for Token-Efficient Reasoning","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"YinhanHe123/IAPO","path":"compute_reward.py","file_url":"https://github.com/YinhanHe123/IAPO/blob/HEAD/compute_reward.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":"ebf9846a096d47ae","code_sha256_prefix":"ebf9846a096d47ae","mcp_get_code":{"code_sha256":"ebf9846a096d47ae"}},{"arxiv_id":"2602.06462","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-06462","title":"Diffusion-State Policy Optimization for Masked Diffusion Language Models","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"dllm-reasoning/d1","path":"diffu-grpo/reward_func.py","file_url":"https://github.com/dllm-reasoning/d1/blob/HEAD/diffu-grpo/reward_func.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 xingzhejun/d-OPSD, and GitHub detected no licence in that repository when it was checked","code_sha256":"08fcee8ccfd3d4a9","code_sha256_prefix":"08fcee8ccfd3d4a9","mcp_get_code":{"code_sha256":"08fcee8ccfd3d4a9"}},{"arxiv_id":"2510.07312","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-07312","title":"BOOTSTRAPPING LLMS TO REASON OVER LONGER HORIZONS VIA REINFORCEMENT LEARNING","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"AlesyaIvanova/h1","path":"grpo.py","file_url":"https://github.com/AlesyaIvanova/h1/blob/HEAD/grpo.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, AlesyaIvanova/h1 when it was checked","code_sha256":"08fcee8ccfd3d4a9","code_sha256_prefix":"08fcee8ccfd3d4a9","mcp_get_code":{"code_sha256":"08fcee8ccfd3d4a9"}},{"arxiv_id":"2505.17018","arxiv_id_is_arxiv":true,"paper":"/paper/sophiavl-r1-reinforcing-mllms-reasoning-with","title":"SophiaVL-R1: Reinforcing MLLMs Reasoning with Thinking Reward","date":"2025-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kxfan2002/sophiavl-r1","path":"verl/workers/reward/custom.py","file_url":"https://github.com/kxfan2002/sophiavl-r1/blob/HEAD/verl/workers/reward/custom.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"816215511a181080","code_sha256_prefix":"816215511a181080","mcp_get_code":{"code_sha256":"816215511a181080"}},{"arxiv_id":"2504.01698","arxiv_id_is_arxiv":true,"paper":"/paper/tom-rl-reinforcement-learning-unlocks-theory","title":"Do Theory of Mind Benchmarks Need Explicit Human-like Reasoning in Language Models?","date":"2025-04-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bigai-ai/ToM-RL","path":"verl/utils/reward_score/explore_tom_2.py","file_url":"https://github.com/bigai-ai/ToM-RL/blob/HEAD/verl/utils/reward_score/explore_tom_2.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":"55d752fd12d893c2","code_sha256_prefix":"55d752fd12d893c2","mcp_get_code":{"code_sha256":"55d752fd12d893c2"}}],"record_sha256":"cb73e3ff11b71087cdf1338e9b982684cd7cd3614bc1b7237e6b15fca1d740e3","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}