Chen Chen, Yao Shu, Chengwei Qin, Ruochen Zhao, Weiquan Huang, Sudong Wang, Yubao Zhao
5 of 5 samples (functions and classes) lifted from this paper's linked repositories executed on a synthesized input in Syntology's jail (0 of them constructed an object rather than computing a result; 2 honoured the contract we drafted, 0 violated it and 0 have no contract verdict; 3 failures of our instrument; 0 no recorded run), measured 2026-11-22; bodies inline only under a permissive licence as GitHub detects it. Not a reproduction of the paper's results.
"Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results. This record, dated, as JSON: /api/ran/2602.03719.json · badge: /api/ran/2602.03719.svg
Each repository's role is a label: a classifier's output recorded on the link, or, where no role is recorded, what the Papers with Code archive marked. The line under it names its basis. Neither says who wrote the code.
| Repository | Role | Ran |
|---|---|---|
| YubaoZhao/BranPO | canonical (classifier label) classifier basis: census |
5 ran · 0 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| extract_answer | Ran ran; our contract draft was wrong, not the code |
YubaoZhao/BranPO/agent/search/llm_as_a_judge.py code served (permissive licence) · get_code("ec1077be0c2df0e6") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned str. The image it ran in was not recorded. If your copy returns the same type on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.
|
| get_image | Ran ran, honoured the contract we drafted |
YubaoZhao/BranPO/rllm/misc.py code served (permissive licence) · get_code("8e21ff6e15adbc8f") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned Image. The image it ran in was not recorded. If your copy returns the same type on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.
|
| merge_dicts | Ran ran; our contract draft was wrong, not the code |
YubaoZhao/BranPO/rllm/misc.py code served (permissive licence) · get_code("b7aec73d6258eba0") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned dict. The image it ran in was not recorded. If your copy returns the same type on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.
|
| pad_from_left | Ran ran, honoured the contract we drafted |
YubaoZhao/BranPO/rllm/misc.py code served (permissive licence) · get_code("15c74c1c2cf76cf7") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned list, ndim 2, dtype family int; no output shape is stated. The image it ran in was not recorded. If your copy returns the same type and ndim on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.
|
| truncatefn | Ran ran; our contract draft was wrong, not the code |
YubaoZhao/BranPO/rllm/agents/code_agent.py code served (permissive licence) · get_code("f23d0f0bf67cc7cb") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned str. The image it ran in was not recorded. If your copy returns the same type on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.
|
Of 5 samples lifted from this paper's linked repositories, 5 carry a function identity and 0 do not. Of the 5 distinct functions with an identity, 4 are also present in other papers whose code we hold (1 with at least one paper dated earlier, 4 the same month, 0 later) and 1 are only here among the 52,977 papers whose code Syntology holds (as of 2026-09-26).
Only here means: among the 52,977 papers whose code Syntology holds (51,887 with lifted samples, 1,090 through their assemblies only), as of 2026-09-26, no other paper's lifted samples or current assembly bricks contain an identical function body after normalisation.
| Function | Also present in | Earliest-dated | Others named |
|---|---|---|---|
| truncatefn | 2 other papers 1 dated earlier, 1 the same month |
2309.00071 (2023-09) YaRN: Efficient Context Window Extension of Large Language Models |
2602.11639 (2026-02) PACE: Prefix-Protected and Difficulty-Aware Compression for Efficient Reasoning |
| get_image | 1 other paper 1 the same month |
2602.04417 (2026-02) EMA Policy Gradient: Taming Reinforcement Learning for LLMs with EMA Anchor and Top-k KL |
|
| merge_dicts | 1 other paper 1 the same month |
2602.04417 (2026-02) EMA Policy Gradient: Taming Reinforcement Learning for LLMs with EMA Anchor and Top-k KL |
|
| pad_from_left | 1 other paper 1 the same month |
2602.04417 (2026-02) EMA Policy Gradient: Taming Reinforcement Learning for LLMs with EMA Anchor and Top-k KL |
Presence, not direction: an identical function body in two papers' repositories does not say who wrote it, which came from which, or that either paper's method rests on it. Matching is exact after normalisation, so a renamed or edited function is not matched. Dates are when papers appeared, not when code was written. Only .py files the harvester lifted are covered; notebooks are not read. A new-style arXiv id YYMM.NNNN dates a paper to the month 20YY-MM; otherwise Paper.year dates it to the year; otherwise it is undated. Dates are when the paper appeared, not when the code was written. Read 2026-11-22.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Agentic reinforcement learning enables large language models to perform multi-turn planning and tool use, but long-horizon training remains challenging under sparse trajectory-level rewards, where a single outcome is uniformly assigned to all decisions. Prior methods introduce finer-grained supervision via tree-based exploration or process-level evaluation, but often incur high cost or produce noisy credit signals. In agentic trajectories, early mistakes may still be corrected by later actions, while seemingly promising intermediate states can fail due to poor subsequent decisions. We call this property non-monotonic correctness, which makes outcome rewards or state values insufficient for guiding what actions should be taken from each state. To address this, we propose Branching Relative Policy Optimization (BranPO), a value-free method that constructs localized contrastive supervision without dense rewards. BranPO truncates trajectories at intermediate prefixes and resamples continuations to form contrastive branches that share the same prefix but diverge in final outcomes, thereby isolating decisions that drive success or failure. We further introduce difficulty-aware branch sampling and Redundant Step Masking to improve sampling efficiency and suppress redundant updates. Experiments show that BranPO consistently outperforms diverse baseline categories across multiple multi-hop QA benchmarks without additional training cost, and generalizes to broader long-horizon agentic tasks with consistent improvements. Our code is available at https://github.com/YubaoZhao/BranPO.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2602.03719")
get_code_for_paper("2602.03719")
have("2602.03719")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2602.03719.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2602.03719)
Connect an agent — have() is free.