{"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/nanmin","entry":"nanmin","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":7,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":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":4,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":1,"n_samples_unverified":1,"n_samples_fingerprinted":3,"n_places":7,"n_places_pointer_only":5,"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":1,"ran_draft_wrong":1,"ran_fixture":0,"ran":1,"unverified":1},"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":"2605.18864","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-18864","title":"SAGE: Shaping Anchors for Guided Exploration in RLVR of LLMs","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"tally0818/SAGE","path":"src/train/sage_trainer.py","file_url":"https://github.com/tally0818/SAGE/blob/HEAD/src/train/sage_trainer.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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, tally0818/SAGE when it was checked","code_sha256":"95a9accdc840e38e","code_sha256_prefix":"95a9accdc840e38e","mcp_get_code":{"code_sha256":"95a9accdc840e38e"}},{"arxiv_id":"2605.15726","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-15726","title":"Nudging Beyond the Comfort Zone: Efficient Strategy-Guided Exploration for RLVR","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"tally0818/NudgeRL","path":"src/train/utils.py","file_url":"https://github.com/tally0818/NudgeRL/blob/HEAD/src/train/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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, tally0818/NudgeRL when it was checked","code_sha256":"95a9accdc840e38e","code_sha256_prefix":"95a9accdc840e38e","mcp_get_code":{"code_sha256":"95a9accdc840e38e"}},{"arxiv_id":"2601.04700","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-04700","title":"PRISM: A Unified Framework for Post-Training LLMs Without Verifiable Rewards","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"ghimiremukesh/PRISM","path":"open-r1-intuitor/src/open_r1/critque_intuitor_trainer.py","file_url":"https://github.com/ghimiremukesh/PRISM/blob/HEAD/open-r1-intuitor/src/open_r1/critque_intuitor_trainer.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, ghimiremukesh/PRISM when it was checked","code_sha256":"1fa45c1d5b9a7e0a","code_sha256_prefix":"1fa45c1d5b9a7e0a","mcp_get_code":{"code_sha256":"1fa45c1d5b9a7e0a"}},{"arxiv_id":"2511.04902","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2511-04902","title":"You Need Reasoning to Learn Reasoning: The Limitations of Label-Free RL in Weak Base Models","date":null,"month_inferred_from_arxiv_id":"2025-11","title_source":"syntology","repo":"BorealisAI/CuMa","path":"src/open_r1/intuitor_trainer.py","file_url":"https://github.com/BorealisAI/CuMa/blob/HEAD/src/open_r1/intuitor_trainer.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, BorealisAI/CuMa when it was checked","code_sha256":"1fa45c1d5b9a7e0a","code_sha256_prefix":"1fa45c1d5b9a7e0a","mcp_get_code":{"code_sha256":"1fa45c1d5b9a7e0a"}},{"arxiv_id":"2506.14755","arxiv_id_is_arxiv":true,"paper":"/paper/optimizing-length-compression-in-large","title":"Optimizing Length Compression in Large Reasoning Models","date":"2025-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zxiangx/lc-r1","path":"trl/trainer/grpo_trainer.py","file_url":"https://github.com/zxiangx/lc-r1/blob/HEAD/trl/trainer/grpo_trainer.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, zxiangx/lc-r1 when it was checked","code_sha256":"1fa45c1d5b9a7e0a","code_sha256_prefix":"1fa45c1d5b9a7e0a","mcp_get_code":{"code_sha256":"1fa45c1d5b9a7e0a"}},{"arxiv_id":"2504.14717","arxiv_id_is_arxiv":true,"paper":"/paper/tapip3d-tracking-any-point-in-persistent-3d","title":"TAPIP3D: Tracking Any Point in Persistent 3D Geometry","date":"2025-04-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zbw001/tapip3d","path":"models/point_tracker_3d.py","file_url":"https://github.com/zbw001/tapip3d/blob/HEAD/models/point_tracker_3d.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ebac3f54aa56f887","code_sha256_prefix":"ebac3f54aa56f887","mcp_get_code":{"code_sha256":"ebac3f54aa56f887"}},{"arxiv_id":"openreview_e2xQL4BWrY","arxiv_id_is_arxiv":false,"paper":null,"title":"OpenReview id openreview_e2xQL4BWrY","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"AragornHorse/MRPO","path":"mr_trainer_token.py","file_url":"https://github.com/AragornHorse/MRPO/blob/HEAD/mr_trainer_token.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":"d796e8fa40457fce","code_sha256_prefix":"d796e8fa40457fce","mcp_get_code":{"code_sha256":"d796e8fa40457fce"}}],"record_sha256":"cb093fe93e2dec96fa5f30053ec174f5aefeeef7df2167cfe337e8f230aeadeb","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}