3 of 3 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; 3 failures of our instrument; 0 no recorded run); 1 of them was also run on the host, not in the jail, by the peer-agreement lane that set its level, measured 2026-11-22; repository links from the Papers with Code archive attributed under CC BY-SA, no affiliation; 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/2405.20692.json · badge: /api/ran/2405.20692.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 |
|---|---|---|
| silihuang-ai/idt | canonical (classifier label) classifier basis: classifier_2025 |
2 ran · 0 no recorded run |
| copy not recorded | community not in the paper's declared repositories |
1 ran · 0 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| discount_cumsum | Ran ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT) |
this paper's copy was not recorded; identical code first harvested from bkkgbkjb/oppo pointer only; the stored copy get_code serves, from bkkgbkjb/oppo, is pointer only (licence: NONE) · get_code("0161b27cbe3cc58d") How it ranThe body of this sample is withheld: this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it. 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. |
| load | Ran ran; our contract draft was wrong, not the code |
silihuang-ai/idt/experiment.py pointer only (licence: NONE) · get_code("7c0f909f4498385f") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, silihuang-ai/idt 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. |
| make_dir | Ran ran; our contract draft was wrong, not the code |
silihuang-ai/idt/experiment.py pointer only (licence: NONE) · get_code("42958997018c3581") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, silihuang-ai/idt 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 3 samples lifted from this paper's linked repositories, 3 carry a function identity and 0 do not. Of the 3 distinct functions with an identity, 2 are also present in other papers whose code we hold (2 with at least one paper dated earlier, 1 the same month, 1 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 |
|---|---|---|---|
| discount_cumsum | 17 other papers 13 dated earlier, 2 the same month, 2 later |
2106.01345 (2021-06) Decision Transformer: Reinforcement Learning via Sequence Modeling |
2110.06206 (2021-10) StARformer: Transformer with State-Action-Reward Representations for Visual Reinforcement Learning 2111.10364 (2021-11) Generalized Decision Transformer for Offline Hindsight Information Matching and 14 more not named here |
| make_dir | 8 other papers 8 dated earlier |
1910.01741 (2019-10) Improving Sample Efficiency in Model-Free Reinforcement Learning from Images |
2004.04136 (2020-04) CURL: Contrastive Unsupervised Representations for Reinforcement Learning 2010.09163 (2020-10) D2RL: Deep Dense Architectures in Reinforcement Learning and 5 more not named here |
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.
In-context learning is a promising approach for offline reinforcement learning (RL) to handle online tasks, which can be achieved by providing task prompts. Recent works demonstrated that in-context RL could emerge with self-improvement in a trial-and-error manner when treating RL tasks as an across-episodic sequential prediction problem. Despite the self-improvement not requiring gradient updates, current works still suffer from high computational costs when the across-episodic sequence increases with task horizons. To this end, we propose an In-context Decision Transformer (IDT) to achieve self-improvement in a high-level trial-and-error manner. Specifically, IDT is inspired by the efficient hierarchical structure of human decision-making and thus reconstructs the sequence to consist of high-level decisions instead of low-level actions that interact with environments. As one high-level decision can guide multi-step low-level actions, IDT naturally avoids excessively long sequences and solves online tasks more efficiently. Experimental results show that IDT achieves state-of-the-art in long-horizon tasks over current in-context RL methods. In particular, the online evaluation time of our IDT is \textbf{36$\times$} times faster than baselines in the D4RL benchmark and \textbf{27$\times$} times faster in the Grid World benchmark.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2405.20692")
get_code_for_paper("2405.20692")
have("2405.20692")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2405.20692.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2405.20692)
Connect an agent — have() is free.