{"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/truncatefn","entry":"truncatefn","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":2,"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":3,"n_samples_ran":1,"n_samples_fingerprinted":1,"n_places":6,"n_places_pointer_only":0,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"unverified":2},"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":"2605.12652","paper":"/paper/arxiv-2605-12652","title":"Multi-Rollout On-Policy Distillation via Peer Successes and Failures","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"viviable/mopd_code","path":"verl/utils/reward_score/prime_code/testing_util.py","file_url":"https://github.com/viviable/mopd_code/blob/HEAD/verl/utils/reward_score/prime_code/testing_util.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"22849627aa42fa47","mcp_get_code":{"code_sha256":"22849627aa42fa47"}},{"arxiv_id":"2602.11639","paper":"/paper/arxiv-2602-11639","title":"PACE: Prefix-Protected and Difficulty-Aware Compression for Efficient Reasoning","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"LiveCodeBench/LiveCodeBench","path":"lcb_runner/evaluation/testing_util.py","file_url":"https://github.com/LiveCodeBench/LiveCodeBench/blob/HEAD/lcb_runner/evaluation/testing_util.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f23d0f0bf67cc7cb","mcp_get_code":{"code_sha256":"f23d0f0bf67cc7cb"}},{"arxiv_id":"2602.03719","paper":"/paper/arxiv-2602-03719","title":"BranPO: Scalable Contrastive Branch Sampling for Long-Horizon Agentic Reinforcement Learning","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"YubaoZhao/BranPO","path":"rllm/agents/code_agent.py","file_url":"https://github.com/YubaoZhao/BranPO/blob/HEAD/rllm/agents/code_agent.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":"f23d0f0bf67cc7cb","mcp_get_code":{"code_sha256":"f23d0f0bf67cc7cb"}},{"arxiv_id":"2507.06196","paper":"/paper/uqlm-a-python-package-for-uncertainty","title":"UQLM: A Python Package for Uncertainty Quantification in Large Language Models","date":"2025-07-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cvs-health/uqlm","path":"uqlm/code/lcb_grader.py","file_url":"https://github.com/cvs-health/uqlm/blob/HEAD/uqlm/code/lcb_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":"993984482b377429","mcp_get_code":{"code_sha256":"993984482b377429"}},{"arxiv_id":"2411.17501","paper":"/paper/inference-scaling-scriptsize-mathtt-f-laws","title":"Inference Scaling fLaws: The Limits of LLM Resampling with Imperfect Verifiers","date":"2024-11-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"benediktstroebl/inference-scaling-limits","path":"race/codeeval/execution_utils.py","file_url":"https://github.com/benediktstroebl/inference-scaling-limits/blob/HEAD/race/codeeval/execution_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"22849627aa42fa47","mcp_get_code":{"code_sha256":"22849627aa42fa47"}},{"arxiv_id":"2309.00071","paper":"/paper/yarn-efficient-context-window-extension-of","title":"YaRN: Efficient Context Window Extension of Large Language Models","date":"2023-08-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qwenlm/qwq","path":"eval/eval/livecodebench_v5_utils/testing_util.py","file_url":"https://github.com/qwenlm/qwq/blob/HEAD/eval/eval/livecodebench_v5_utils/testing_util.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":"f23d0f0bf67cc7cb","mcp_get_code":{"code_sha256":"f23d0f0bf67cc7cb"}}]}