5 of 8 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, 1 violated it and 4 have no contract verdict; 0 failures of our instrument; 3 no recorded run), measured 2026-11-21; 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/1908.05451.json · badge: /api/ran/1908.05451.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 |
|---|---|---|
| FangchenLiu/map_planner | community (classifier label) classifier basis: plan_row |
5 ran · 3 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| farthest_point_sample | Ran ran on a synthesized input |
FangchenLiu/map_planner/planner/sample.py code served (permissive licence) · get_code("f02d5e46b602a9f8") 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 Tensor, ndim 1, dtype family int, shape (1,) as a later run recorded it. The image it ran in was not recorded. If your copy returns the same type, ndim and shape 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.
|
| plot_numpy | Ran ran on a synthesized input |
FangchenLiu/map_planner/planner/sample.py code served (permissive licence) · get_code("8961b8e20a158830") 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 Axes. 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.
|
| plot_single_curve | Ran ran on a synthesized input |
FangchenLiu/map_planner/planner/sample.py code served (permissive licence) · get_code("4fd63e273aca3beb") 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 Figure. 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.
|
| transform | Ran ran, violated the contract we drafted |
FangchenLiu/map_planner/planner/goal_plan.py code served (permissive licence) · get_code("b92d018d6cbdd419") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1) and returned Tensor, ndim 1, dtype family float, shape (4,) as a later run recorded it. The image it ran in was not recorded. If your copy returns the same type, ndim and shape 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.
|
| transform | Ran ran on a synthesized input |
FangchenLiu/map_planner/planner/vis_pointmaze.py code served (permissive licence) · get_code("9a047e4f770d9c79") 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 Tensor, ndim 0, dtype family float, shape () as a later run recorded it. The image it ran in was not recorded. If your copy returns the same type, ndim and shape 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_env_params | Not yet run unverified (harvested, no recorded run) |
FangchenLiu/map_planner/train_ddpg.py code served (permissive licence) · get_code("f84995c51788ed77") How it ranno invocation recorded. |
| initialize_metrics | Not yet run unverified (harvested, no recorded run) |
FangchenLiu/map_planner/models/networks.py pointer only (licence: MIT); the stored copy get_code serves, from papercode2022/hill, is pointer only (licence: NONE) · get_code("94b8758288c337d6") How it ranThe body of this sample is withheld: this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from papercode2022/hill, and GitHub detected no licence in that repository 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. No invocation recorded. |
| vis_pointmaze | Not yet run unverified (harvested, no recorded run) |
FangchenLiu/map_planner/planner/vis_pointmaze.py code served (permissive licence) · get_code("c0bf0c055d3aa91f") How it ranno invocation recorded. |
Of 8 samples lifted from this paper's linked repositories, 8 carry a function identity and 0 do not. Of the 8 distinct functions with an identity, 3 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 3 later) and 5 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_env_params | 2 other papers 2 later |
2207.01115 (2022-07) USHER: Unbiased Sampling for Hindsight Experience Replay |
2303.11166 (2023-03) Imitating Graph-Based Planning with Goal-Conditioned Policies |
| initialize_metrics | 1 other paper 1 later |
2307.12063 (2023-07) Balancing Exploration and Exploitation in Hierarchical Reinforcement Learning via Latent Landmark Graphs |
|
| transform | 1 other paper 1 later |
2303.11166 (2023-03) Imitating Graph-Based Planning with Goal-Conditioned Policies |
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-21.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
An agent that has well understood the environment should be able to apply its skills for any given goals, leading to the fundamental problem of learning the Universal Value Function Approximator (UVFA). A UVFA learns to predict the cumulative rewards between all state-goal pairs. However, empirically, the value function for long-range goals is always hard to estimate and may consequently result in failed policy. This has presented challenges to the learning process and the capability of neural networks. We propose a method to address this issue in large MDPs with sparse rewards, in which exploration and routing across remote states are both extremely challenging. Our method explicitly models the environment in a hierarchical manner, with a high-level dynamic landmark-based map abstracting the visited state space, and a low-level value network to derive precise local decisions. We use farthest point sampling to select landmark states from past experience, which has improved exploration compared with simple uniform sampling. Experimentally we showed that our method enables the agent to reach long-range goals at the early training stage, and achieve better performance than standard RL algorithms for a number of challenging tasks.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1908.05451")
get_code_for_paper("1908.05451")
have("1908.05451")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1908.05451.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1908.05451)
Connect an agent — have() is free.