{"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/should-allow-eval","entry":"should_allow_eval","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":14,"n_papers_ran":14,"n_papers_ran_no_instrument_failure":14,"n_papers_ran_instrument_only":0,"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":2,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":14,"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":0,"ran_violates":2,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"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":"2609.12243","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2609-12243","title":"Chopthin-Consensus Power Sampling: A Diversity-Preserving Approach to LLM Decoding","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"MinooAhmadii/chopthin-consensus-power-sampling","path":"ccps/graders/math_grader.py","file_url":"https://github.com/MinooAhmadii/chopthin-consensus-power-sampling/blob/HEAD/ccps/graders/math_grader.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, MinooAhmadii/chopthin-consensus-power-sampling when it was checked","code_sha256":"95f02454eddf082a","code_sha256_prefix":"95f02454eddf082a","mcp_get_code":{"code_sha256":"95f02454eddf082a"}},{"arxiv_id":"2605.21856","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-21856","title":"The Illusion of Reasoning: Exposing Evasive Data Contamination in LLMs via Zero-CoT Truncation","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"Yifan-Lan/zero-cot-probe","path":"math_grade.py","file_url":"https://github.com/Yifan-Lan/zero-cot-probe/blob/HEAD/math_grade.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"95f02454eddf082a","code_sha256_prefix":"95f02454eddf082a","mcp_get_code":{"code_sha256":"95f02454eddf082a"}},{"arxiv_id":"2605.10195","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-10195","title":"Breaking the Reward Barrier: Accelerating Tree-of-Thought Reasoning via Speculative Exploration","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"PKU-SEC-Lab/SPEX","path":"evaluate/evaluate_utils/grader.py","file_url":"https://github.com/PKU-SEC-Lab/SPEX/blob/HEAD/evaluate/evaluate_utils/grader.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, PKU-SEC-Lab/SPEX when it was checked","code_sha256":"95f02454eddf082a","code_sha256_prefix":"95f02454eddf082a","mcp_get_code":{"code_sha256":"95f02454eddf082a"}},{"arxiv_id":"2604.11510","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-11510","title":"Policy Split: Incentivizing Dual-Mode Exploration in LLM Reinforcement with Dual-Mode Entropy Regularization","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"BITHLP/PolicySplit","path":"verl/utils/reward_score/openai_math_grade.py","file_url":"https://github.com/BITHLP/PolicySplit/blob/HEAD/verl/utils/reward_score/openai_math_grade.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, BITHLP/PolicySplit when it was checked","code_sha256":"95f02454eddf082a","code_sha256_prefix":"95f02454eddf082a","mcp_get_code":{"code_sha256":"95f02454eddf082a"}},{"arxiv_id":"2604.04356","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-04356","title":"REAM: Merging Improves Pruning of Experts in LLMs","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"zai-org/glm-simple-evals","path":"evals/grading/grader.py","file_url":"https://github.com/zai-org/glm-simple-evals/blob/HEAD/evals/grading/grader.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, zai-org/glm-simple-evals when it was checked","code_sha256":"95f02454eddf082a","code_sha256_prefix":"95f02454eddf082a","mcp_get_code":{"code_sha256":"95f02454eddf082a"}},{"arxiv_id":"2602.10048","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-10048","title":"Long Chain-of-Thought Compression via Fine-Grained Group Policy Optimization","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"Mr-XcHan/FGO","path":"src/open_r1/grader.py","file_url":"https://github.com/Mr-XcHan/FGO/blob/HEAD/src/open_r1/grader.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, Mr-XcHan/FGO when it was checked","code_sha256":"95f02454eddf082a","code_sha256_prefix":"95f02454eddf082a","mcp_get_code":{"code_sha256":"95f02454eddf082a"}},{"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":"math_utils.py","file_url":"https://github.com/AlesyaIvanova/h1/blob/HEAD/math_utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, AlesyaIvanova/h1 when it was checked","code_sha256":"95f02454eddf082a","code_sha256_prefix":"95f02454eddf082a","mcp_get_code":{"code_sha256":"95f02454eddf082a"}},{"arxiv_id":"2505.13417","arxiv_id_is_arxiv":true,"paper":"/paper/adaptthink-reasoning-models-can-learn-when-to","title":"AdaptThink: Reasoning Models Can Learn When to Think","date":"2025-05-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thu-keg/adaptthink","path":"src/adapt_think_rm.py","file_url":"https://github.com/thu-keg/adaptthink/blob/HEAD/src/adapt_think_rm.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"95f02454eddf082a","code_sha256_prefix":"95f02454eddf082a","mcp_get_code":{"code_sha256":"95f02454eddf082a"}},{"arxiv_id":"2505.13379","arxiv_id_is_arxiv":true,"paper":"/paper/thinkless-llm-learns-when-to-think","title":"Thinkless: LLM Learns When to Think","date":"2025-05-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vainf/thinkless","path":"deepscaler/rewards/math_utils/utils.py","file_url":"https://github.com/vainf/thinkless/blob/HEAD/deepscaler/rewards/math_utils/utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"95f02454eddf082a","code_sha256_prefix":"95f02454eddf082a","mcp_get_code":{"code_sha256":"95f02454eddf082a"}},{"arxiv_id":"2505.03335","arxiv_id_is_arxiv":true,"paper":"/paper/absolute-zero-reinforced-self-play-reasoning","title":"Absolute Zero: Reinforced Self-play Reasoning with Zero Data","date":"2025-05-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LeapLabTHU/Absolute-Zero-Reasoner","path":"absolute_zero_reasoner/rewards/math_utils.py","file_url":"https://github.com/LeapLabTHU/Absolute-Zero-Reasoner/blob/HEAD/absolute_zero_reasoner/rewards/math_utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"95f02454eddf082a","code_sha256_prefix":"95f02454eddf082a","mcp_get_code":{"code_sha256":"95f02454eddf082a"}},{"arxiv_id":"2503.10460","arxiv_id_is_arxiv":true,"paper":"/paper/light-r1-curriculum-sft-dpo-and-rl-for-long","title":"Light-R1: Curriculum SFT, DPO and RL for Long COT from Scratch and Beyond","date":"2025-03-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Qihoo360/Light-R1","path":"deepscaler-release/deepscaler/rewards/math_utils/utils.py","file_url":"https://github.com/Qihoo360/Light-R1/blob/HEAD/deepscaler-release/deepscaler/rewards/math_utils/utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"95f02454eddf082a","code_sha256_prefix":"95f02454eddf082a","mcp_get_code":{"code_sha256":"95f02454eddf082a"}},{"arxiv_id":"2502.06703","arxiv_id_is_arxiv":true,"paper":"/paper/can-1b-llm-surpass-405b-llm-rethinking","title":"Can 1B LLM Surpass 405B LLM? Rethinking Compute-Optimal Test-Time Scaling","date":"2025-02-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RyanLiu112/compute-optimal-tts","path":"src/envs/MATH/verify_utils.py","file_url":"https://github.com/RyanLiu112/compute-optimal-tts/blob/HEAD/src/envs/MATH/verify_utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"95f02454eddf082a","code_sha256_prefix":"95f02454eddf082a","mcp_get_code":{"code_sha256":"95f02454eddf082a"}},{"arxiv_id":"2406.12809","arxiv_id_is_arxiv":true,"paper":"/paper/can-large-language-models-always-solve-easy","title":"Can Large Language Models Always Solve Easy Problems if They Can Solve Harder Ones?","date":"2024-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"QwenLM/ConsisEval","path":"math_check/grader.py","file_url":"https://github.com/QwenLM/ConsisEval/blob/HEAD/math_check/grader.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f5c7c44887cd8c88","code_sha256_prefix":"f5c7c44887cd8c88","mcp_get_code":{"code_sha256":"f5c7c44887cd8c88"}},{"arxiv_id":"2305.20050","arxiv_id_is_arxiv":true,"paper":"/paper/let-s-verify-step-by-step-1","title":"Let's Verify Step by Step","date":"2023-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"openai/prm800k","path":"prm800k/grading/grader.py","file_url":"https://github.com/openai/prm800k/blob/HEAD/prm800k/grading/grader.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"95f02454eddf082a","code_sha256_prefix":"95f02454eddf082a","mcp_get_code":{"code_sha256":"95f02454eddf082a"}}],"record_sha256":"855ffab51ec71f8fd3aafd11f9ec8e5f5526cc745b2f394b46f8a051ff4cc2dd","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}