Liang Ding, Xuebo Liu, Zhiliang Tian, Keqin Peng, Yuanxin Ouyang, Yancheng Yuan, Ruijian Han
2 of 2 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; 0 honoured the contract we drafted, 0 violated it and 0 have no contract verdict; 2 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.02099.json · badge: /api/ran/2602.02099.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 |
|---|---|---|
| alphadl/DDCA | community Papers with Code archive |
2 ran · 0 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| advantage_dca_grpo | Ran ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT) |
alphadl/DDCA/dca/advantage.py pointer only (licence: NONE) · get_code("90a0d2a885354a94") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, alphadl/DDCA when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded. |
| length_score_z_sigmoid | Ran ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT) |
alphadl/DDCA/dca/advantage.py pointer only (licence: NONE) · get_code("b95287cdab4122d9") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, alphadl/DDCA when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded. |
Of 2 samples lifted from this paper's linked repositories, 2 carry a function identity and 0 do not. Of the 2 distinct functions with an identity, 0 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 0 later) and 2 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.
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.
Reinforcement Learning with Verifiable Rewards (RLVR) can elicit strong multi-step reasoning, yet it often encourages overly verbose traces. Moreover, naive length penalties in group-relative optimization can severely hurt accuracy. We attribute this failure to two structural issues: (i) Dilution of Length Baseline, where incorrect responses (with zero length reward) depress the group baseline and overpenalize correct solutions; and (ii) Difficulty-Penalty Mismatch, where a static penalty cannot adapt to problem difficulty, suppressing necessary reasoning on hard instances while leaving redundancy on easy ones. We propose Dynamic Decoupled Conditional Advantage (DDCA) to decouple efficiency optimization from correctness. DDCA computes length advantages conditionally within the correctresponse cluster to eliminate baseline dilution, and dynamically scales the penalty strength using the group pass rate as a proxy for difficulty. Experiments on GSM8K, MATH500, AMC23, and AIME25 show that DDCA consistently improves the efficiency-accuracy tradeoff relative to adaptive baselines (e.g., Arora and Zanette, 2025), reducing generated tokens by approximately 60% on simpler tasks (e.g., GSM8K) versus over 20% on harder benchmarks (e.g., AIME25), thereby maintaining or improving accuracy. Code is available at https://github.com/alphadl/DDCA.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2602.02099")
get_code_for_paper("2602.02099")
have("2602.02099")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2602.02099.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2602.02099)
Connect an agent — have() is free.