Haotian Zhang, Yinan Xia, Huiming Wang
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/2603.18533.json · badge: /api/ran/2603.18533.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 |
|---|---|---|
| Yinan-Xia/DDPO | community Papers with Code archive |
2 ran · 0 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| get_seqlen_balanced_partitions | Ran ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT) |
Yinan-Xia/DDPO/verl/utils/seqlen_balancing.py pointer only (licence: NONE) · get_code("e8d6a8ca9ca1b9a6") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, Yinan-Xia/DDPO 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. |
| karmarkar_karp | Ran ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT) |
Yinan-Xia/DDPO/verl/utils/seqlen_balancing.py pointer only (licence: NONE) · get_code("3b8596bcfd8b40bb") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, Yinan-Xia/DDPO 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, 1 are also present in other papers whose code we hold (1 with at least one paper dated earlier, 0 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 |
|---|---|---|---|
| get_seqlen_balanced_partitions brick of this paper's assembly: entry |
1 other paper 1 dated earlier |
2602.22556 (2026-02) Stable Adaptive Thinking via Advantage Shaping and Length-Aware Gradient Regulation |
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.
Large Reasoning Models (LRMs) have shown exceptional reasoning capabilities, but they also suffer from the issue of overthinking, often generating excessively long and redundant answers. For problems that exceed the model's capabilities, LRMs tend to exhibit the overconfidence phenomenon, generating overly short but incorrect answers, which may contribute to suboptimal performance. To address these issues, we propose Difficulty-Differentiated Policy Optimization (DDPO), an efficient reinforcement learning algorithm that optimizes simple and complex tasks separately based on the overconfidence phenomenon. Specifically, it reduces the output length for simple tasks without compromising accuracy, while for complex tasks, it expands the exploration space to improve performance. We further derive the theoretical conditions for maximizing expected accuracy, which require the length distribution to closely approximate the optimal length and be as concentrated as possible. Based on these conditions, we propose using the difficulty-level average as a well-founded reference for length optimization. Extensive experiments on both in-domain and out-of-domain benchmarks validate the superiority and effectiveness of DDPO. Compared to GRPO, DDPO reduces the average answer length by 12% while improving accuracy by 1.85% across multiple benchmarks, achieving a better trade-off between accuracy and length. The code is available at https: //github.com/Yinan-Xia/DDPO.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2603.18533")
get_code_for_paper("2603.18533")
have("2603.18533")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2603.18533.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2603.18533)
Connect an agent — have() is free.