{"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/compute-grpo-outcome-advantage","entry":"compute_grpo_outcome_advantage","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":14,"n_papers_ran":3,"n_papers_ran_no_instrument_failure":1,"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":11,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":2,"n_samples_unverified":8,"n_samples_fingerprinted":2,"n_places":14,"n_places_pointer_only":2,"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":0,"ran_draft_wrong":2,"ran_fixture":0,"ran":1,"unverified":8},"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":"2606.10646","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-10646","title":"How Does Reasoning Flow? Tracing Attention-Induced Information Flow for Targeted RL in LLMs","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"Jiayi-Pan/TinyZero","path":"verl/trainer/ppo/core_algos.py","file_url":"https://github.com/Jiayi-Pan/TinyZero/blob/HEAD/verl/trainer/ppo/core_algos.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":"e25af267f6e0b9e8","code_sha256_prefix":"e25af267f6e0b9e8","mcp_get_code":{"code_sha256":"e25af267f6e0b9e8"}},{"arxiv_id":"2606.07705","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-07705","title":"SAW: Stage-Aware Dynamic Weighting for Multi-Objective Reinforcement Learning in Large Language Models","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"Zhaolutuan/SAW","path":"verl/trainer/ppo/core_algos.py","file_url":"https://github.com/Zhaolutuan/SAW/blob/HEAD/verl/trainer/ppo/core_algos.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":"e25af267f6e0b9e8","code_sha256_prefix":"e25af267f6e0b9e8","mcp_get_code":{"code_sha256":"e25af267f6e0b9e8"}},{"arxiv_id":"2605.07465","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-07465","title":"SEIF: Self-Evolving Reinforcement Learning for Instruction Following","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"Rainier-rq1/SEIF","path":"verl/trainer/core_algos.py","file_url":"https://github.com/Rainier-rq1/SEIF/blob/HEAD/verl/trainer/core_algos.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":"b7dacadfa17e35d2","code_sha256_prefix":"b7dacadfa17e35d2","mcp_get_code":{"code_sha256":"b7dacadfa17e35d2"}},{"arxiv_id":"2602.15564","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-15564","title":"Beyond Static Pipelines: Learning Dynamic Workflows for Text-to-SQL","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"Satissss/SquRL","path":"verl/trainer/ppo/core_algos.py","file_url":"https://github.com/Satissss/SquRL/blob/HEAD/verl/trainer/ppo/core_algos.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":"5e44de7d8d0e5d67","code_sha256_prefix":"5e44de7d8d0e5d67","mcp_get_code":{"code_sha256":"5e44de7d8d0e5d67"}},{"arxiv_id":"2602.04284","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-04284","title":"Agent-Omit: Adaptive Context Omission for Efficient LLM Agents","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"usail-hkust/Agent-Omit","path":"AgentOmit-RL/verl/agent_trainer/ppo/core_algos.py","file_url":"https://github.com/usail-hkust/Agent-Omit/blob/HEAD/AgentOmit-RL/verl/agent_trainer/ppo/core_algos.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, usail-hkust/Agent-Omit when it was checked","code_sha256":"9869c756ff538fd1","code_sha256_prefix":"9869c756ff538fd1","mcp_get_code":{"code_sha256":"9869c756ff538fd1"}},{"arxiv_id":"2509.26272","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2509-26272","title":"PRPO: Paragraph-level Policy Optimization for Vision-Language Deepfake Detection","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"tuanrpt/PRPO","path":"prpo/verl/trainer/ppo/core_algos.py","file_url":"https://github.com/tuanrpt/PRPO/blob/HEAD/prpo/verl/trainer/ppo/core_algos.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a064f095b2208875","code_sha256_prefix":"a064f095b2208875","mcp_get_code":{"code_sha256":"a064f095b2208875"}},{"arxiv_id":"2509.02522","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2509-02522","title":"Implicit Actor Critic Coupling via a Supervised Learning Framework for RLVR","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"ritzz-ai/PACS","path":"src/pacs/pacs_core_algos.py","file_url":"https://github.com/ritzz-ai/PACS/blob/HEAD/src/pacs/pacs_core_algos.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9f098d16adc06043","code_sha256_prefix":"9f098d16adc06043","mcp_get_code":{"code_sha256":"9f098d16adc06043"}},{"arxiv_id":"2507.07966","arxiv_id_is_arxiv":true,"paper":"/paper/scaling-rl-to-long-videos","title":"Scaling RL to Long Videos","date":"2025-07-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NVlabs/Long-RL","path":"verl/trainer/core_algos.py","file_url":"https://github.com/NVlabs/Long-RL/blob/HEAD/verl/trainer/core_algos.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":"758c7f607efffb52","code_sha256_prefix":"758c7f607efffb52","mcp_get_code":{"code_sha256":"758c7f607efffb52"}},{"arxiv_id":"2507.05386","arxiv_id_is_arxiv":true,"paper":"/paper/reinforcement-fine-tuning-naturally-mitigates","title":"Reinforcement Fine-Tuning Naturally Mitigates Forgetting in Continual Post-Training","date":"2025-07-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhhvvv/rft_vs_sft","path":"EasyR1/verl/trainer/core_algos.py","file_url":"https://github.com/zhhvvv/rft_vs_sft/blob/HEAD/EasyR1/verl/trainer/core_algos.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, zhhvvv/rft_vs_sft when it was checked","code_sha256":"b7dacadfa17e35d2","code_sha256_prefix":"b7dacadfa17e35d2","mcp_get_code":{"code_sha256":"b7dacadfa17e35d2"}},{"arxiv_id":"2506.01908","arxiv_id_is_arxiv":true,"paper":"/paper/reinforcement-learning-tuning-for-videollms","title":"Reinforcement Learning Tuning for VideoLLMs: Reward Design and Data Efficiency","date":"2025-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"appletea233/temporal-r1","path":"verl/trainer/core_algos.py","file_url":"https://github.com/appletea233/temporal-r1/blob/HEAD/verl/trainer/core_algos.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":"17a3ed8bc3471fb5","code_sha256_prefix":"17a3ed8bc3471fb5","mcp_get_code":{"code_sha256":"17a3ed8bc3471fb5"}},{"arxiv_id":"2505.16282","arxiv_id_is_arxiv":true,"paper":"/paper/arpo-end-to-end-policy-optimization-for-gui","title":"ARPO:End-to-End Policy Optimization for GUI Agents with Experience Replay","date":"2025-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dvlab-research/arpo","path":"verl/trainer/core_algos.py","file_url":"https://github.com/dvlab-research/arpo/blob/HEAD/verl/trainer/core_algos.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":"b7dacadfa17e35d2","code_sha256_prefix":"b7dacadfa17e35d2","mcp_get_code":{"code_sha256":"b7dacadfa17e35d2"}},{"arxiv_id":"2505.11049","arxiv_id_is_arxiv":true,"paper":"/paper/2505-11049","title":"GuardReasoner-VL: Safeguarding VLMs via Reinforced Reasoning","date":"2025-05-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yueliu1999/guardreasoner-vl","path":"train/EasyR1/verl/trainer/core_algos.py","file_url":"https://github.com/yueliu1999/guardreasoner-vl/blob/HEAD/train/EasyR1/verl/trainer/core_algos.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":"dc62e3047c2f6e56","code_sha256_prefix":"dc62e3047c2f6e56","mcp_get_code":{"code_sha256":"dc62e3047c2f6e56"}},{"arxiv_id":"2504.20073","arxiv_id_is_arxiv":true,"paper":"/paper/ragen-understanding-self-evolution-in-llm","title":"RAGEN: Understanding Self-Evolution in LLM Agents via Multi-Turn Reinforcement Learning","date":"2025-04-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ragen-ai/ragen","path":"ragen/trainer/core_algos.py","file_url":"https://github.com/ragen-ai/ragen/blob/HEAD/ragen/trainer/core_algos.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":"dd9a34fc6888e4a5","code_sha256_prefix":"dd9a34fc6888e4a5","mcp_get_code":{"code_sha256":"dd9a34fc6888e4a5"}},{"arxiv_id":"2504.09696","arxiv_id_is_arxiv":true,"paper":"/paper/grpo-lead-a-difficulty-aware-reinforcement-1","title":"GRPO-LEAD: A Difficulty-Aware Reinforcement Learning Approach for Concise Mathematical Reasoning in Language Models","date":"2025-04-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aeroplanepaper/GRPO-LEAD","path":"verl/verl/trainer/ppo/core_algos.py","file_url":"https://github.com/aeroplanepaper/GRPO-LEAD/blob/HEAD/verl/verl/trainer/ppo/core_algos.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":"b5f62fd7c302812c","code_sha256_prefix":"b5f62fd7c302812c","mcp_get_code":{"code_sha256":"b5f62fd7c302812c"}}],"record_sha256":"5dfaab954017b072d9b6fe71574a63ac23dcbae9bb39170508b771b3730d5155","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}