{"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/get-dynamic-pipeline-shards","entry":"get_dynamic_pipeline_shards","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":53,"n_papers_ran":53,"n_papers_ran_no_instrument_failure":53,"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":53,"n_places_pointer_only":53,"n_places_pointer_only_link_open":34,"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":"2609.02548","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2609-02548","title":"Learn from Whoever Is Right: Answer-Verified Multi-Teacher Distillation for Multi-Domain LLMs","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"hexixiang/MT-SDPO","path":"training/verl/model_merger/megatron_model_merger.py","file_url":"https://github.com/hexixiang/MT-SDPO/blob/HEAD/training/verl/model_merger/megatron_model_merger.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"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 LeapLabTHU/OPDVR, and GitHub detected no licence in that repository when it was checked","code_sha256":"94209884dcb2308e","code_sha256_prefix":"94209884dcb2308e","mcp_get_code":{"code_sha256":"94209884dcb2308e"}},{"arxiv_id":"2609.01245","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2609-01245","title":"Explore More, Drift Less: Outcome-Only Reinforcement Learning Can Suffice for Long-Horizon Interactive Agents","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"AlibabaResearch/SignalCoverageRL","path":"verl/model_merger/megatron_model_merger.py","file_url":"https://github.com/AlibabaResearch/SignalCoverageRL/blob/HEAD/verl/model_merger/megatron_model_merger.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"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 LeapLabTHU/OPDVR, and GitHub detected no licence in that repository when it was checked","code_sha256":"94209884dcb2308e","code_sha256_prefix":"94209884dcb2308e","mcp_get_code":{"code_sha256":"94209884dcb2308e"}},{"arxiv_id":"2608.24696","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-24696","title":"On-policy Distillation with Verifiable Reward","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"LeapLabTHU/OPDVR","path":"verl/verl/model_merger/megatron_model_merger.py","file_url":"https://github.com/LeapLabTHU/OPDVR/blob/HEAD/verl/verl/model_merger/megatron_model_merger.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, LeapLabTHU/OPDVR when it was checked","code_sha256":"94209884dcb2308e","code_sha256_prefix":"94209884dcb2308e","mcp_get_code":{"code_sha256":"94209884dcb2308e"}},{"arxiv_id":"2608.24350","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-24350","title":"FARCA: Fact-Aligned Reliability-Aware Credit Assignment for Reinforcement Learning with Factual Supervision","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"verl-project/verl","path":"verl/model_merger/megatron_model_merger.py","file_url":"https://github.com/verl-project/verl/blob/HEAD/verl/model_merger/megatron_model_merger.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"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 LeapLabTHU/OPDVR, and GitHub detected no licence in that repository when it was checked","code_sha256":"94209884dcb2308e","code_sha256_prefix":"94209884dcb2308e","mcp_get_code":{"code_sha256":"94209884dcb2308e"}},{"arxiv_id":"2608.23566","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-23566","title":"Best Practice Critic Optimization BEST PRACTICE CRITIC OPTIMIZATION","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"QPHutu/golden_critic","path":"verl/model_merger/megatron_model_merger.py","file_url":"https://github.com/QPHutu/golden_critic/blob/HEAD/verl/model_merger/megatron_model_merger.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"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 LeapLabTHU/OPDVR, and GitHub detected no licence in that repository when it was checked","code_sha256":"94209884dcb2308e","code_sha256_prefix":"94209884dcb2308e","mcp_get_code":{"code_sha256":"94209884dcb2308e"}},{"arxiv_id":"2608.19181","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-19181","title":"Beyond Teacher Likelihood: Group-Calibrated On-Policy Distillation for Long-Context Reasoning","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"SolereZhang/GC-OPD","path":"verl/verl/model_merger/megatron_model_merger.py","file_url":"https://github.com/SolereZhang/GC-OPD/blob/HEAD/verl/verl/model_merger/megatron_model_merger.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"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 LeapLabTHU/OPDVR, and GitHub detected no licence in that repository when it was checked","code_sha256":"94209884dcb2308e","code_sha256_prefix":"94209884dcb2308e","mcp_get_code":{"code_sha256":"94209884dcb2308e"}},{"arxiv_id":"2608.14728","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-14728","title":"TAIL-AWARE TOP-k ON-POLICY DISTILLATION","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"HuipengHuang/TA-OPD","path":"verl/verl/model_merger/megatron_model_merger.py","file_url":"https://github.com/HuipengHuang/TA-OPD/blob/HEAD/verl/verl/model_merger/megatron_model_merger.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, HuipengHuang/TA-OPD when it was checked","code_sha256":"94209884dcb2308e","code_sha256_prefix":"94209884dcb2308e","mcp_get_code":{"code_sha256":"94209884dcb2308e"}},{"arxiv_id":"2608.02139","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-02139","title":"Self-Improving Large Language Models via Progressive Experience Evolution","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"rrrsj/SPEE","path":"verl/model_merger/megatron_model_merger.py","file_url":"https://github.com/rrrsj/SPEE/blob/HEAD/verl/model_merger/megatron_model_merger.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"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 LeapLabTHU/OPDVR, and GitHub detected no licence in that repository when it was checked","code_sha256":"94209884dcb2308e","code_sha256_prefix":"94209884dcb2308e","mcp_get_code":{"code_sha256":"94209884dcb2308e"}},{"arxiv_id":"2607.19395","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-19395","title":"From Trajectories to Prefixes: Reusing Teacher Trajectories via Replayed Prefixes and Online Continuation","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"HappynessI/Prefix_GRPO","path":"verl/verl/model_merger/megatron_model_merger.py","file_url":"https://github.com/HappynessI/Prefix_GRPO/blob/HEAD/verl/verl/model_merger/megatron_model_merger.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"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 LeapLabTHU/OPDVR, and GitHub detected no licence in that repository when it was checked","code_sha256":"94209884dcb2308e","code_sha256_prefix":"94209884dcb2308e","mcp_get_code":{"code_sha256":"94209884dcb2308e"}},{"arxiv_id":"2607.10481","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-10481","title":"ARMOR: Stabilizing On-Policy LLM RL with Off-Policy Anchor Samples","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"Hesse73/ARMOR","path":"verl/verl/model_merger/megatron_model_merger.py","file_url":"https://github.com/Hesse73/ARMOR/blob/HEAD/verl/verl/model_merger/megatron_model_merger.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, Hesse73/ARMOR when it was checked","code_sha256":"94209884dcb2308e","code_sha256_prefix":"94209884dcb2308e","mcp_get_code":{"code_sha256":"94209884dcb2308e"}},{"arxiv_id":"2607.07976","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-07976","title":"When Implausible Tokens Get Reinforced: Tail-Aware Credit Calibration for LLM Reinforcement Learning","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"xiuyilou/TACO","path":"verl/model_merger/megatron_model_merger.py","file_url":"https://github.com/xiuyilou/TACO/blob/HEAD/verl/model_merger/megatron_model_merger.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, xiuyilou/TACO when it was checked","code_sha256":"94209884dcb2308e","code_sha256_prefix":"94209884dcb2308e","mcp_get_code":{"code_sha256":"94209884dcb2308e"}},{"arxiv_id":"2607.01763","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-01763","title":"DENSER ̸ = BETTER: LIMITS OF ON-POLICY SELF-DISTILLATION FOR CONTINUAL POST-TRAINING","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"Moenupa/SDPO-CL","path":"verl/model_merger/megatron_model_merger.py","file_url":"https://github.com/Moenupa/SDPO-CL/blob/HEAD/verl/model_merger/megatron_model_merger.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"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 LeapLabTHU/OPDVR, and GitHub detected no licence in that repository when it was checked","code_sha256":"94209884dcb2308e","code_sha256_prefix":"94209884dcb2308e","mcp_get_code":{"code_sha256":"94209884dcb2308e"}},{"arxiv_id":"2606.20008","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-20008","title":"VIMPO: Value-Implicit Policy Optimization for LLMs","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"backprop07/VIMPO","path":"verl/model_merger/megatron_model_merger.py","file_url":"https://github.com/backprop07/VIMPO/blob/HEAD/verl/model_merger/megatron_model_merger.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"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 LeapLabTHU/OPDVR, and GitHub detected no licence in that repository when it was checked","code_sha256":"94209884dcb2308e","code_sha256_prefix":"94209884dcb2308e","mcp_get_code":{"code_sha256":"94209884dcb2308e"}},{"arxiv_id":"2606.18967","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-18967","title":"EfficientRollout: System-Aware Self-Speculative Decoding for RL Rollouts","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"furiosa-ai/EfficientRollout","path":"verl/model_merger/megatron_model_merger.py","file_url":"https://github.com/furiosa-ai/EfficientRollout/blob/HEAD/verl/model_merger/megatron_model_merger.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"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 LeapLabTHU/OPDVR, and GitHub detected no licence in that repository when it was checked","code_sha256":"94209884dcb2308e","code_sha256_prefix":"94209884dcb2308e","mcp_get_code":{"code_sha256":"94209884dcb2308e"}},{"arxiv_id":"2606.09052","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-09052","title":"INFUSER: Influence-Guided Self-Evolution Improves Reasoning","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"FFishy-git/INFUSER","path":"verl/model_merger/megatron_model_merger.py","file_url":"https://github.com/FFishy-git/INFUSER/blob/HEAD/verl/model_merger/megatron_model_merger.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"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 LeapLabTHU/OPDVR, and GitHub detected no licence in that repository when it was checked","code_sha256":"94209884dcb2308e","code_sha256_prefix":"94209884dcb2308e","mcp_get_code":{"code_sha256":"94209884dcb2308e"}},{"arxiv_id":"2606.04036","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-04036","title":"Self-Distilled Policy Gradient","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"lauyikfung/SDPG","path":"verl/model_merger/megatron_model_merger.py","file_url":"https://github.com/lauyikfung/SDPG/blob/HEAD/verl/model_merger/megatron_model_merger.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"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 LeapLabTHU/OPDVR, and GitHub detected no licence in that repository when it was checked","code_sha256":"94209884dcb2308e","code_sha256_prefix":"94209884dcb2308e","mcp_get_code":{"code_sha256":"94209884dcb2308e"}},{"arxiv_id":"2606.02684","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-02684","title":"Filter, Then Reweight: Rethinking Optimization Granularity in On-Policy Distillation","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"YuYingLi0/FiRe-OPD","path":"verl/verl/model_merger/megatron_model_merger.py","file_url":"https://github.com/YuYingLi0/FiRe-OPD/blob/HEAD/verl/verl/model_merger/megatron_model_merger.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, YuYingLi0/FiRe-OPD when it was checked","code_sha256":"94209884dcb2308e","code_sha256_prefix":"94209884dcb2308e","mcp_get_code":{"code_sha256":"94209884dcb2308e"}},{"arxiv_id":"2606.00593","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-00593","title":"SPADER: Step-wise Peer Advantage with Diversity-Aware Exploration Rewards for Multi-Answer Question Answering","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"KhanCold/spader","path":"verl/model_merger/megatron_model_merger.py","file_url":"https://github.com/KhanCold/spader/blob/HEAD/verl/model_merger/megatron_model_merger.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"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 LeapLabTHU/OPDVR, and GitHub detected no licence in that repository when it was checked","code_sha256":"94209884dcb2308e","code_sha256_prefix":"94209884dcb2308e","mcp_get_code":{"code_sha256":"94209884dcb2308e"}},{"arxiv_id":"2605.28014","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-28014","title":"ROSD: Reflective On-Policy Self-Distillation for Language Model Reasoning across Domains","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"ZiqiZhao1/ROSD","path":"verl/model_merger/megatron_model_merger.py","file_url":"https://github.com/ZiqiZhao1/ROSD/blob/HEAD/verl/model_merger/megatron_model_merger.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"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 LeapLabTHU/OPDVR, and GitHub detected no licence in that repository when it was checked","code_sha256":"94209884dcb2308e","code_sha256_prefix":"94209884dcb2308e","mcp_get_code":{"code_sha256":"94209884dcb2308e"}},{"arxiv_id":"2605.27865","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-27865","title":"MERIT: Matching Expertise via Rubric-Informed Training for Reviewer Assignment","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"Luli3220/MERIT","path":"MERIT-Assessor/verl/model_merger/megatron_model_merger.py","file_url":"https://github.com/Luli3220/MERIT/blob/HEAD/MERIT-Assessor/verl/model_merger/megatron_model_merger.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, Luli3220/MERIT when it was checked","code_sha256":"94209884dcb2308e","code_sha256_prefix":"94209884dcb2308e","mcp_get_code":{"code_sha256":"94209884dcb2308e"}},{"arxiv_id":"2605.25920","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-25920","title":"Can LLMs Time Travel? Enhancing Temporal Consistency in Legal Agentic Search through Reinforcement Learning","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"AlexFanw/LegalSearch-R1","path":"verl/model_merger/megatron_model_merger.py","file_url":"https://github.com/AlexFanw/LegalSearch-R1/blob/HEAD/verl/model_merger/megatron_model_merger.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"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 LeapLabTHU/OPDVR, and GitHub detected no licence in that repository when it was checked","code_sha256":"94209884dcb2308e","code_sha256_prefix":"94209884dcb2308e","mcp_get_code":{"code_sha256":"94209884dcb2308e"}},{"arxiv_id":"2605.25198","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-25198","title":"Hide to Guide: Learning via Semantic Masking","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"mit-han-lab/SMEPO","path":"verl/model_merger/megatron_model_merger.py","file_url":"https://github.com/mit-han-lab/SMEPO/blob/HEAD/verl/model_merger/megatron_model_merger.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, mit-han-lab/SMEPO when it was checked","code_sha256":"94209884dcb2308e","code_sha256_prefix":"94209884dcb2308e","mcp_get_code":{"code_sha256":"94209884dcb2308e"}},{"arxiv_id":"2605.16999","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-16999","title":"Ranking-Aware Calibration for Reliable Multimodal Reinforcement Learning","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"Stellaris167/RAC","path":"verl/model_merger/megatron_model_merger.py","file_url":"https://github.com/Stellaris167/RAC/blob/HEAD/verl/model_merger/megatron_model_merger.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"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 LeapLabTHU/OPDVR, and GitHub detected no licence in that repository when it was checked","code_sha256":"94209884dcb2308e","code_sha256_prefix":"94209884dcb2308e","mcp_get_code":{"code_sha256":"94209884dcb2308e"}},{"arxiv_id":"2605.11739","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-11739","title":"Learning to Foresee: Unveiling the Unlocking Efficiency of On-Policy Distillation","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"caiyuchen-ustc/EffOPD","path":"EffOPD/verl/verl/model_merger/megatron_model_merger.py","file_url":"https://github.com/caiyuchen-ustc/EffOPD/blob/HEAD/EffOPD/verl/verl/model_merger/megatron_model_merger.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, caiyuchen-ustc/EffOPD when it was checked","code_sha256":"94209884dcb2308e","code_sha256_prefix":"94209884dcb2308e","mcp_get_code":{"code_sha256":"94209884dcb2308e"}},{"arxiv_id":"2605.07331","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-07331","title":"Rethinking Importance Sampling in LLM Policy Optimization: A Cumulative Token Perspective","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"horizon-llm/CTPO","path":"verl/model_merger/megatron_model_merger.py","file_url":"https://github.com/horizon-llm/CTPO/blob/HEAD/verl/model_merger/megatron_model_merger.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"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 LeapLabTHU/OPDVR, and GitHub detected no licence in that repository when it was checked","code_sha256":"94209884dcb2308e","code_sha256_prefix":"94209884dcb2308e","mcp_get_code":{"code_sha256":"94209884dcb2308e"}},{"arxiv_id":"2605.01111","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-01111","title":"When Less is Enough: Efficient Inference via Collaborative Reasoning","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"fairytale9/llm_bottleneck","path":"verl/model_merger/megatron_model_merger.py","file_url":"https://github.com/fairytale9/llm_bottleneck/blob/HEAD/verl/model_merger/megatron_model_merger.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"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 LeapLabTHU/OPDVR, and GitHub detected no licence in that repository when it was checked","code_sha256":"94209884dcb2308e","code_sha256_prefix":"94209884dcb2308e","mcp_get_code":{"code_sha256":"94209884dcb2308e"}},{"arxiv_id":"2604.25444","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-25444","title":"One Refiner to Unlock Them All: Inference-Time Reasoning Elicitation via Reinforcement Query Refinement","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"newera-xiao/ReQueR","path":"verl/verl/model_merger/megatron_model_merger.py","file_url":"https://github.com/newera-xiao/ReQueR/blob/HEAD/verl/verl/model_merger/megatron_model_merger.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"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 LeapLabTHU/OPDVR, and GitHub detected no licence in that repository when it was checked","code_sha256":"94209884dcb2308e","code_sha256_prefix":"94209884dcb2308e","mcp_get_code":{"code_sha256":"94209884dcb2308e"}},{"arxiv_id":"2604.00698","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-00698","title":"Learning to Hint for Reinforcement Learning","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"Andree-9/HiLL","path":"verl/model_merger/megatron_model_merger.py","file_url":"https://github.com/Andree-9/HiLL/blob/HEAD/verl/model_merger/megatron_model_merger.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, Andree-9/HiLL when it was checked","code_sha256":"94209884dcb2308e","code_sha256_prefix":"94209884dcb2308e","mcp_get_code":{"code_sha256":"94209884dcb2308e"}},{"arxiv_id":"2603.24472","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-24472","title":"Why Does Self-Distillation (Sometimes) Degrade the Reasoning Capability of LLMs?","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"lasgroup/SDPO","path":"verl/model_merger/megatron_model_merger.py","file_url":"https://github.com/lasgroup/SDPO/blob/HEAD/verl/model_merger/megatron_model_merger.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"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 LeapLabTHU/OPDVR, and GitHub detected no licence in that repository when it was checked","code_sha256":"94209884dcb2308e","code_sha256_prefix":"94209884dcb2308e","mcp_get_code":{"code_sha256":"94209884dcb2308e"}},{"arxiv_id":"2603.22293","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-22293","title":"TIPS: Turn-Level Information-Potential Reward Shaping for Search-Augmented LLMs","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"ucsd-wang-lab-lm/tips","path":"verl/model_merger/megatron_model_merger.py","file_url":"https://github.com/ucsd-wang-lab-lm/tips/blob/HEAD/verl/model_merger/megatron_model_merger.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, ucsd-wang-lab-lm/tips when it was checked","code_sha256":"94209884dcb2308e","code_sha256_prefix":"94209884dcb2308e","mcp_get_code":{"code_sha256":"94209884dcb2308e"}},{"arxiv_id":"2603.20046","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-20046","title":"Experience is the Best Teacher: Motivating Effective Exploration in Reinforcement Learning for LLMs","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"sikelifei/HeRL","path":"verl/model_merger/megatron_model_merger.py","file_url":"https://github.com/sikelifei/HeRL/blob/HEAD/verl/model_merger/megatron_model_merger.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, sikelifei/HeRL when it was checked","code_sha256":"94209884dcb2308e","code_sha256_prefix":"94209884dcb2308e","mcp_get_code":{"code_sha256":"94209884dcb2308e"}},{"arxiv_id":"2603.16654","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-16654","title":"Omanic: Towards Step-wise Evaluation of Multi-hop Reasoning in Large Language Models","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"XiaojieGu/Omanic","path":"verl/verl/model_merger/megatron_model_merger.py","file_url":"https://github.com/XiaojieGu/Omanic/blob/HEAD/verl/verl/model_merger/megatron_model_merger.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, XiaojieGu/Omanic when it was checked","code_sha256":"94209884dcb2308e","code_sha256_prefix":"94209884dcb2308e","mcp_get_code":{"code_sha256":"94209884dcb2308e"}},{"arxiv_id":"2603.12109","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-12109","title":"On Information Self-Locking in Reinforcement Learning for Active Reasoning of LLM agents","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"unimpor/T3","path":"verl/verl/model_merger/megatron_model_merger.py","file_url":"https://github.com/unimpor/T3/blob/HEAD/verl/verl/model_merger/megatron_model_merger.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, unimpor/T3 when it was checked","code_sha256":"94209884dcb2308e","code_sha256_prefix":"94209884dcb2308e","mcp_get_code":{"code_sha256":"94209884dcb2308e"}},{"arxiv_id":"2603.10101","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-10101","title":"CLIPO: Contrastive Learning in Policy Optimization Generalizes RLVR","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"Qwen-Applications/CLIPO","path":"verl/model_merger/megatron_model_merger.py","file_url":"https://github.com/Qwen-Applications/CLIPO/blob/HEAD/verl/model_merger/megatron_model_merger.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, Qwen-Applications/CLIPO when it was checked","code_sha256":"94209884dcb2308e","code_sha256_prefix":"94209884dcb2308e","mcp_get_code":{"code_sha256":"94209884dcb2308e"}},{"arxiv_id":"2603.07079","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-07079","title":"Entropy-Aware On-Policy Distillation of Language Models","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"WLS04/EOPD","path":"verl/model_merger/megatron_model_merger.py","file_url":"https://github.com/WLS04/EOPD/blob/HEAD/verl/model_merger/megatron_model_merger.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"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 LeapLabTHU/OPDVR, and GitHub detected no licence in that repository when it was checked","code_sha256":"94209884dcb2308e","code_sha256_prefix":"94209884dcb2308e","mcp_get_code":{"code_sha256":"94209884dcb2308e"}},{"arxiv_id":"2602.17550","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-17550","title":"MASPO: Unifying Gradient Utilization, Probability Mass, and Signal Reliability for Robust and Sample-Efficient LLM Reasoning","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"FlyTune/MASPO-RL","path":"verl/model_merger/megatron_model_merger.py","file_url":"https://github.com/FlyTune/MASPO-RL/blob/HEAD/verl/model_merger/megatron_model_merger.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"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 LeapLabTHU/OPDVR, and GitHub detected no licence in that repository when it was checked","code_sha256":"94209884dcb2308e","code_sha256_prefix":"94209884dcb2308e","mcp_get_code":{"code_sha256":"94209884dcb2308e"}},{"arxiv_id":"2602.10609","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-10609","title":"Online Causal Kalman Filtering for Stable and Effective Policy Optimization","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"shuohe1995/verl-kpo","path":"verl/model_merger/megatron_model_merger.py","file_url":"https://github.com/shuohe1995/verl-kpo/blob/HEAD/verl/model_merger/megatron_model_merger.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"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 LeapLabTHU/OPDVR, and GitHub detected no licence in that repository when it was checked","code_sha256":"94209884dcb2308e","code_sha256_prefix":"94209884dcb2308e","mcp_get_code":{"code_sha256":"94209884dcb2308e"}},{"arxiv_id":"2602.06869","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-06869","title":"Uncovering Cross-Objective Interference in Multi-Objective Alignment","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"yining610/ctwa","path":"verl/model_merger/megatron_model_merger.py","file_url":"https://github.com/yining610/ctwa/blob/HEAD/verl/model_merger/megatron_model_merger.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"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 LeapLabTHU/OPDVR, and GitHub detected no licence in that repository when it was checked","code_sha256":"94209884dcb2308e","code_sha256_prefix":"94209884dcb2308e","mcp_get_code":{"code_sha256":"94209884dcb2308e"}},{"arxiv_id":"2602.05897","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-05897","title":"Stop Rewarding Hallucinated Steps: Faithfulness-Aware Step-Level Reinforcement Learning for Small Reasoning Models","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"Easy195/FaithRL","path":"verl/model_merger/megatron_model_merger.py","file_url":"https://github.com/Easy195/FaithRL/blob/HEAD/verl/model_merger/megatron_model_merger.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, Easy195/FaithRL when it was checked","code_sha256":"94209884dcb2308e","code_sha256_prefix":"94209884dcb2308e","mcp_get_code":{"code_sha256":"94209884dcb2308e"}},{"arxiv_id":"2602.04879","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-04879","title":"Rethinking the Trust Region in LLM Reinforcement Learning","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"sail-sg/Stable-RL","path":"verl/model_merger/megatron_model_merger.py","file_url":"https://github.com/sail-sg/Stable-RL/blob/HEAD/verl/model_merger/megatron_model_merger.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"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 LeapLabTHU/OPDVR, and GitHub detected no licence in that repository when it was checked","code_sha256":"94209884dcb2308e","code_sha256_prefix":"94209884dcb2308e","mcp_get_code":{"code_sha256":"94209884dcb2308e"}},{"arxiv_id":"2602.03190","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-03190","title":"PrAg-PO: Prompt Augmented Policy Optimization for Robust and Diverse Mathematical Reasoning","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"wenquanlu/PrAg-PO","path":"verl/model_merger/megatron_model_merger.py","file_url":"https://github.com/wenquanlu/PrAg-PO/blob/HEAD/verl/model_merger/megatron_model_merger.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, wenquanlu/PrAg-PO when it was checked","code_sha256":"94209884dcb2308e","code_sha256_prefix":"94209884dcb2308e","mcp_get_code":{"code_sha256":"94209884dcb2308e"}},{"arxiv_id":"2602.03143","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-03143","title":"Self-Hinting Language Models Enhance Reinforcement Learning","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"BaohaoLiao/SAGE","path":"verl/model_merger/megatron_model_merger.py","file_url":"https://github.com/BaohaoLiao/SAGE/blob/HEAD/verl/model_merger/megatron_model_merger.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"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 LeapLabTHU/OPDVR, and GitHub detected no licence in that repository when it was checked","code_sha256":"94209884dcb2308e","code_sha256_prefix":"94209884dcb2308e","mcp_get_code":{"code_sha256":"94209884dcb2308e"}},{"arxiv_id":"2602.03048","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-03048","title":"CoBA-RL: Capability-Oriented Budget Allocation for Reinforcement Learning in LLMs","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"Within-yao/CoBA-RL","path":"verl/model_merger/megatron_model_merger.py","file_url":"https://github.com/Within-yao/CoBA-RL/blob/HEAD/verl/model_merger/megatron_model_merger.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, Within-yao/CoBA-RL when it was checked","code_sha256":"94209884dcb2308e","code_sha256_prefix":"94209884dcb2308e","mcp_get_code":{"code_sha256":"94209884dcb2308e"}},{"arxiv_id":"2602.02518","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-02518","title":"GRAPHDANCER: Training LLMs to Explore and Reason over Graphs via Two-Stage Curriculum Post-Training","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"leopoldwhite/GraphDancer","path":"verl/model_merger/megatron_model_merger.py","file_url":"https://github.com/leopoldwhite/GraphDancer/blob/HEAD/verl/model_merger/megatron_model_merger.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, leopoldwhite/GraphDancer when it was checked","code_sha256":"94209884dcb2308e","code_sha256_prefix":"94209884dcb2308e","mcp_get_code":{"code_sha256":"94209884dcb2308e"}},{"arxiv_id":"2601.17687","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-17687","title":"Agentic reinforcement learning empowers next-generation chemical language models for molecular design and synthesis","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"HowardLi1984/ChemCraft","path":"chemcraft_rl/verl/model_merger/megatron_model_merger.py","file_url":"https://github.com/HowardLi1984/ChemCraft/blob/HEAD/chemcraft_rl/verl/model_merger/megatron_model_merger.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, HowardLi1984/ChemCraft when it was checked","code_sha256":"94209884dcb2308e","code_sha256_prefix":"94209884dcb2308e","mcp_get_code":{"code_sha256":"94209884dcb2308e"}},{"arxiv_id":"2601.05508","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-05508","title":"Enabling Stroke-Level Structural Analysis of Hieroglyphic Scripts without Language-Specific Priors","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"THUNLP-MT/HieroSA","path":"verl/model_merger/megatron_model_merger.py","file_url":"https://github.com/THUNLP-MT/HieroSA/blob/HEAD/verl/model_merger/megatron_model_merger.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"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 LeapLabTHU/OPDVR, and GitHub detected no licence in that repository when it was checked","code_sha256":"94209884dcb2308e","code_sha256_prefix":"94209884dcb2308e","mcp_get_code":{"code_sha256":"94209884dcb2308e"}},{"arxiv_id":"2601.04537","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-04537","title":"Linear Dynamics in the RLVR Training of Large Language Models","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"Miaow-Lab/RLVR-Linearity","path":"verl/verl/model_merger/megatron_model_merger.py","file_url":"https://github.com/Miaow-Lab/RLVR-Linearity/blob/HEAD/verl/verl/model_merger/megatron_model_merger.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"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 LeapLabTHU/OPDVR, and GitHub detected no licence in that repository when it was checked","code_sha256":"94209884dcb2308e","code_sha256_prefix":"94209884dcb2308e","mcp_get_code":{"code_sha256":"94209884dcb2308e"}},{"arxiv_id":"2601.02648","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-02648","title":"Prioritized Replay for RL Post-training","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"fatemi/verl","path":"verl/model_merger/megatron_model_merger.py","file_url":"https://github.com/fatemi/verl/blob/HEAD/verl/model_merger/megatron_model_merger.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"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 LeapLabTHU/OPDVR, and GitHub detected no licence in that repository when it was checked","code_sha256":"94209884dcb2308e","code_sha256_prefix":"94209884dcb2308e","mcp_get_code":{"code_sha256":"94209884dcb2308e"}},{"arxiv_id":"2510.08630","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-08630","title":"ExPO-HM: Learning to Explain-then-Detect for Hateful Meme Detection","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"JingbiaoMei/ExPO-HM","path":"verl/verl/model_merger/megatron_model_merger.py","file_url":"https://github.com/JingbiaoMei/ExPO-HM/blob/HEAD/verl/verl/model_merger/megatron_model_merger.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"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 LeapLabTHU/OPDVR, and GitHub detected no licence in that repository when it was checked","code_sha256":"94209884dcb2308e","code_sha256_prefix":"94209884dcb2308e","mcp_get_code":{"code_sha256":"94209884dcb2308e"}},{"arxiv_id":"2509.25787","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2509-25787","title":"Self-Evolving Vision-Language Models for Image Quality Assessment via Voting and Ranking","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"bytedance/EvoQuality","path":"verl/verl/model_merger/megatron_model_merger.py","file_url":"https://github.com/bytedance/EvoQuality/blob/HEAD/verl/verl/model_merger/megatron_model_merger.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"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 LeapLabTHU/OPDVR, and GitHub detected no licence in that repository when it was checked","code_sha256":"94209884dcb2308e","code_sha256_prefix":"94209884dcb2308e","mcp_get_code":{"code_sha256":"94209884dcb2308e"}},{"arxiv_id":"2410.02992","arxiv_id_is_arxiv":true,"paper":"/paper/guided-stream-of-search-learning-to-better","title":"Guided Stream of Search: Learning to Better Search with Language Models via Optimal Path Guidance","date":"2024-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"snu-mllab/guided-rest","path":"verl/model_merger/megatron_model_merger.py","file_url":"https://github.com/snu-mllab/guided-rest/blob/HEAD/verl/model_merger/megatron_model_merger.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"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 LeapLabTHU/OPDVR, and GitHub detected no licence in that repository when it was checked","code_sha256":"94209884dcb2308e","code_sha256_prefix":"94209884dcb2308e","mcp_get_code":{"code_sha256":"94209884dcb2308e"}},{"arxiv_id":"openreview_v70fTOqer2","arxiv_id_is_arxiv":false,"paper":null,"title":"OpenReview id openreview_v70fTOqer2","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"liziniu/KnapsackRL","path":"verl/model_merger/megatron_model_merger.py","file_url":"https://github.com/liziniu/KnapsackRL/blob/HEAD/verl/model_merger/megatron_model_merger.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"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 LeapLabTHU/OPDVR, and GitHub detected no licence in that repository when it was checked","code_sha256":"94209884dcb2308e","code_sha256_prefix":"94209884dcb2308e","mcp_get_code":{"code_sha256":"94209884dcb2308e"}},{"arxiv_id":"openreview_VZDlkXuIQc","arxiv_id_is_arxiv":false,"paper":null,"title":"OpenReview id openreview_VZDlkXuIQc","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"ShadeCloak/IP-GRM","path":"verl/verl/model_merger/megatron_model_merger.py","file_url":"https://github.com/ShadeCloak/IP-GRM/blob/HEAD/verl/verl/model_merger/megatron_model_merger.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"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 LeapLabTHU/OPDVR, and GitHub detected no licence in that repository when it was checked","code_sha256":"94209884dcb2308e","code_sha256_prefix":"94209884dcb2308e","mcp_get_code":{"code_sha256":"94209884dcb2308e"}}],"record_sha256":"b7430596d5c15c1e9f72d6feee3a02a56d49a023c36d7ff364dfdcc5fbc7212c","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}