{"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/reward-fn","entry":"reward_fn","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":1,"n_papers_ran_instrument_only":5,"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":1,"n_samples_instrument":2,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":6,"n_places_pointer_only_link_open":3,"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":0,"ran_draft_wrong":1,"ran_fixture":1,"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":"2506.11902","arxiv_id_is_arxiv":true,"paper":"/paper/treerl-llm-reinforcement-learning-with-on","title":"TreeRL: LLM Reinforcement Learning with On-Policy Tree Search","date":"2025-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"THUDM/TreeRL","path":"train_reinforce_ray.py","file_url":"https://github.com/THUDM/TreeRL/blob/HEAD/train_reinforce_ray.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from miaoyuchun/inform, and GitHub detected no licence in that repository when it was checked","code_sha256":"18ed61dcfadbbdf0","code_sha256_prefix":"18ed61dcfadbbdf0","mcp_get_code":{"code_sha256":"18ed61dcfadbbdf0"}},{"arxiv_id":"2506.11902","arxiv_id_is_arxiv":true,"paper":"/paper/treerl-llm-reinforcement-learning-with-on","title":"TreeRL: LLM Reinforcement Learning with On-Policy Tree Search","date":"2025-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"THUDM/TreeRL","path":"train_ppo_ray.py","file_url":"https://github.com/THUDM/TreeRL/blob/HEAD/train_ppo_ray.py","status":"ran","verification_level":1,"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":"582b5f2a2d95b05b","code_sha256_prefix":"582b5f2a2d95b05b","mcp_get_code":{"code_sha256":"582b5f2a2d95b05b"}},{"arxiv_id":"2504.08837","arxiv_id_is_arxiv":true,"paper":"/paper/vl-rethinker-incentivizing-self-reflection-of","title":"VL-Rethinker: Incentivizing Self-Reflection of Vision-Language Models with Reinforcement Learning","date":"2025-04-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tiger-ai-lab/vl-rethinker","path":"openrlhf/cli/eval_ray.py","file_url":"https://github.com/tiger-ai-lab/vl-rethinker/blob/HEAD/openrlhf/cli/eval_ray.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from miaoyuchun/inform, and GitHub detected no licence in that repository when it was checked","code_sha256":"18ed61dcfadbbdf0","code_sha256_prefix":"18ed61dcfadbbdf0","mcp_get_code":{"code_sha256":"18ed61dcfadbbdf0"}},{"arxiv_id":"2504.05185","arxiv_id_is_arxiv":true,"paper":"/paper/concise-reasoning-via-reinforcement-learning","title":"Concise Reasoning via Reinforcement Learning","date":"2025-04-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"18ed61dcfadbbdf0","code_sha256_prefix":"18ed61dcfadbbdf0","mcp_get_code":{"code_sha256":"18ed61dcfadbbdf0"}},{"arxiv_id":"2503.22828","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-reason-for-long-form-story","title":"Learning to Reason for Long-Form Story Generation","date":"2025-03-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Alex-Gurung/ReasoningNCP","path":"rl_training/train_ncp.py","file_url":"https://github.com/Alex-Gurung/ReasoningNCP/blob/HEAD/rl_training/train_ncp.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from miaoyuchun/inform, and GitHub detected no licence in that repository when it was checked","code_sha256":"18ed61dcfadbbdf0","code_sha256_prefix":"18ed61dcfadbbdf0","mcp_get_code":{"code_sha256":"18ed61dcfadbbdf0"}},{"arxiv_id":"2210.08708","arxiv_id_is_arxiv":true,"paper":"/paper/teacher-forcing-recovers-reward-functions-for","title":"Teacher Forcing Recovers Reward Functions for Text Generation","date":"2022-10-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"manga-uofa/lmreward","path":"reinforce.py","file_url":"https://github.com/manga-uofa/lmreward/blob/HEAD/reinforce.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, manga-uofa/lmreward when it was checked","code_sha256":"b7caa86b3587a838","code_sha256_prefix":"b7caa86b3587a838","mcp_get_code":{"code_sha256":"b7caa86b3587a838"}},{"arxiv_id":"2204.05862","arxiv_id_is_arxiv":true,"paper":"/paper/training-a-helpful-and-harmless-assistant","title":"Training a Helpful and Harmless Assistant with Reinforcement Learning from Human Feedback","date":"2022-04-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"miaoyuchun/inform","path":"openrlhf/cli/train_ppo_ray.py","file_url":"https://github.com/miaoyuchun/inform/blob/HEAD/openrlhf/cli/train_ppo_ray.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, miaoyuchun/inform when it was checked","code_sha256":"18ed61dcfadbbdf0","code_sha256_prefix":"18ed61dcfadbbdf0","mcp_get_code":{"code_sha256":"18ed61dcfadbbdf0"}},{"arxiv_id":"1807.00412","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-drive-in-a-day","title":"Learning to Drive in a Day","date":"2018-07-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bitsauce/Carla-ppo","path":"CarlaEnv/carla_lap_env.py","file_url":"https://github.com/bitsauce/Carla-ppo/blob/HEAD/CarlaEnv/carla_lap_env.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"810da5dae21567b6","code_sha256_prefix":"810da5dae21567b6","mcp_get_code":{"code_sha256":"810da5dae21567b6"}}],"record_sha256":"564ec63de69507c6124f801ed06e31c4080e923b58e3ef1b9111620ba74f1520","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}