{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/handle-base","entry":"handle_base","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":6,"n_papers_ran":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":1,"n_samples_ran":0,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":0,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":1},"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":"2602.02979","paper":"/paper/arxiv-2602-02979","title":"CPMöbius: Iterative Coach-Player Reasoning for Data-Free Reinforcement Learning","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"thunlp/CPMobius","path":"evaluation/utils/grader.py","file_url":"https://github.com/thunlp/CPMobius/blob/HEAD/evaluation/utils/grader.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"bb175bff1060d928","mcp_get_code":{"code_sha256":"bb175bff1060d928"}},{"arxiv_id":"2505.21297","paper":"/paper/rstar-coder-scaling-competitive-code","title":"rStar-Coder: Scaling Competitive Code Reasoning with a Large-Scale Verified Dataset","date":"2025-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/rstar","path":"fused_compute_score/prime_math/grader.py","file_url":"https://github.com/microsoft/rstar/blob/HEAD/fused_compute_score/prime_math/grader.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"bb175bff1060d928","mcp_get_code":{"code_sha256":"bb175bff1060d928"}},{"arxiv_id":"2504.16084","paper":"/paper/ttrl-test-time-reinforcement-learning","title":"TTRL: Test-Time Reinforcement Learning","date":"2025-04-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"prime-rl/ttrl","path":"verl/verl/utils/reward_score/ttrl_math/grader.py","file_url":"https://github.com/prime-rl/ttrl/blob/HEAD/verl/verl/utils/reward_score/ttrl_math/grader.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"bb175bff1060d928","mcp_get_code":{"code_sha256":"bb175bff1060d928"}},{"arxiv_id":"2502.01456","paper":"/paper/process-reinforcement-through-implicit","title":"Process Reinforcement through Implicit Rewards","date":"2025-02-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"prime-rl/prime","path":"data_preprocessing/math_util/grader.py","file_url":"https://github.com/prime-rl/prime/blob/HEAD/data_preprocessing/math_util/grader.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"bb175bff1060d928","mcp_get_code":{"code_sha256":"bb175bff1060d928"}},{"arxiv_id":"2412.01981","paper":"/paper/free-process-rewards-without-process-labels","title":"Free Process Rewards without Process Labels","date":"2024-12-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lifan-yuan/implicitprm","path":"eval/math_utils/grader.py","file_url":"https://github.com/lifan-yuan/implicitprm/blob/HEAD/eval/math_utils/grader.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"bb175bff1060d928","mcp_get_code":{"code_sha256":"bb175bff1060d928"}},{"arxiv_id":"2404.02078","paper":"/paper/advancing-llm-reasoning-generalists-with","title":"Advancing LLM Reasoning Generalists with Preference Trees","date":"2024-04-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"openbmb/eurus","path":"eval/utils/grader.py","file_url":"https://github.com/openbmb/eurus/blob/HEAD/eval/utils/grader.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"bb175bff1060d928","mcp_get_code":{"code_sha256":"bb175bff1060d928"}}]}