{"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/handle-base","entry":"handle_base","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":6,"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":1,"n_samples_ran":1,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":1,"n_places":6,"n_places_pointer_only":0,"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":1,"ran_violates":0,"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":"2602.02979","arxiv_id_is_arxiv":true,"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":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"bb175bff1060d928","code_sha256_prefix":"bb175bff1060d928","mcp_get_code":{"code_sha256":"bb175bff1060d928"}},{"arxiv_id":"2505.21297","arxiv_id_is_arxiv":true,"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":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"bb175bff1060d928","code_sha256_prefix":"bb175bff1060d928","mcp_get_code":{"code_sha256":"bb175bff1060d928"}},{"arxiv_id":"2504.16084","arxiv_id_is_arxiv":true,"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":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"bb175bff1060d928","code_sha256_prefix":"bb175bff1060d928","mcp_get_code":{"code_sha256":"bb175bff1060d928"}},{"arxiv_id":"2502.01456","arxiv_id_is_arxiv":true,"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":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"bb175bff1060d928","code_sha256_prefix":"bb175bff1060d928","mcp_get_code":{"code_sha256":"bb175bff1060d928"}},{"arxiv_id":"2412.01981","arxiv_id_is_arxiv":true,"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":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"bb175bff1060d928","code_sha256_prefix":"bb175bff1060d928","mcp_get_code":{"code_sha256":"bb175bff1060d928"}},{"arxiv_id":"2404.02078","arxiv_id_is_arxiv":true,"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":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"bb175bff1060d928","code_sha256_prefix":"bb175bff1060d928","mcp_get_code":{"code_sha256":"bb175bff1060d928"}}],"record_sha256":"02d0601b516ed94c8b8a7ea4a99c5eccedb30a78f32aeb9a4ec247814f1944c3","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}