Heinrich Küttler, Tim Rocktäschel, Roberta Raileanu, Danielle Rothermel, Eric Hambro, Vegard Mella, Naila Murray
1 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; 1 failure of our instrument; 2 no recorded run), 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/2211.00539.json · badge: /api/ran/2211.00539.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 |
|---|---|---|
| copy not recorded | community not in the paper's declared repositories |
1 ran · 2 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| nested_map | Ran ran; our contract draft was wrong, not the code |
this paper's copy was not recorded; identical code first harvested from facebookresearch/nle pointer only; the stored copy get_code serves, from facebookresearch/nle, is pointer only (licence: NOASSERTION) · get_code("2fa2a5c4cf69b215") 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. |
| compute_baseline_loss | Not yet run unverified (harvested, no recorded run) |
this paper's copy was not recorded; identical code first harvested from facebookresearch/nle pointer only; the stored copy get_code serves, from facebookresearch/nle, is pointer only (licence: NOASSERTION) · get_code("e624e7bc82f85ecd") 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. No invocation recorded. |
| compute_entropy_loss | Not yet run unverified (harvested, no recorded run) |
this paper's copy was not recorded; identical code first harvested from facebookresearch/nle pointer only; the stored copy get_code serves, from facebookresearch/nle, is pointer only (licence: NOASSERTION) · get_code("3fba94f2f8bc0565") 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. No invocation 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, 3 are also present in other papers whose code we hold (3 with at least one paper dated earlier, 0 the same month, 0 later) and 0 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 |
|---|---|---|---|
| compute_baseline_loss | 6 other papers 6 dated earlier |
1708.04782 (2017-08) StarCraft II: A New Challenge for Reinforcement Learning |
1809.04474 (2018-09) Multi-task Deep Reinforcement Learning with PopArt 1910.03552 (2019-10) TorchBeast: A PyTorch Platform for Distributed RL and 3 more not named here |
| compute_entropy_loss | 5 other papers 5 dated earlier |
1809.04474 (2018-09) Multi-task Deep Reinforcement Learning with PopArt |
1910.03552 (2019-10) TorchBeast: A PyTorch Platform for Distributed RL 2006.13760 (2020-06) The NetHack Learning Environment and 2 more not named here |
| nested_map | 1 other paper 1 dated earlier |
2006.13760 (2020-06) The NetHack Learning Environment |
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.
Recent breakthroughs in the development of agents to solve challenging sequential decision making problems such as Go [50], StarCraft [58], or DOTA [3], have relied on both simulated environments and large-scale datasets. However, progress on this research has been hindered by the scarcity of open-sourced datasets and the prohibitive computational cost to work with them. Here we present the NetHack Learning Dataset (NLD), a large and highly-scalable dataset of trajectories from the popular game of NetHack, which is both extremely challenging for current methods and very fast to run [23]. NLD consists of three parts: 10 billion state transitions from 1.5 million human trajectories collected on the NAO public NetHack server from 2009 to 2020; 3 billion state-action-score transitions from 100,000 trajectories collected from the symbolic bot winner of the NetHack Challenge 2021; and, accompanying code for users to record, load and stream any collection of such trajectories in a highly compressed form. We evaluate a wide range of existing algorithms including online and offline RL, as well as learning from demonstrations, showing that significant research advances are needed to fully leverage large-scale datasets for challenging sequential decision making tasks.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2211.00539")
get_code_for_paper("2211.00539")
have("2211.00539")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2211.00539.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2211.00539)
Connect an agent — have() is free.