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; 1 honoured the contract we drafted, 1 violated it and 0 have no contract verdict; 1 failure of our instrument; 0 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/1802.04240.json · badge: /api/ran/1802.04240.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 |
|---|---|---|
| DeepLearningCUCS/RLVRP | reimplementation (classifier label) classifier basis: classifier_2025 |
1 ran · 0 no recorded run |
| ajayn1997/RL-VRP-PtrNtwrk | reimplementation (classifier label) classifier basis: classifier_2025 |
1 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 |
|---|---|---|
| create_VRP_dataset | Ran ran, honoured the contract we drafted |
DeepLearningCUCS/RLVRP/DeepLearning_Fall2019_RL_VRP_yg2631_zh2366.py pointer only (licence: NONE) · get_code("eb5f330b628df2a1") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, DeepLearningCUCS/RLVRP 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. |
| reward | Ran ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT) |
ajayn1997/RL-VRP-PtrNtwrk/Tasks/vrp.py pointer only (licence: NONE) · get_code("8c63c20097bd4bce") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, ajayn1997/RL-VRP-PtrNtwrk 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. |
| str2bool | Ran ran, violated the contract we drafted |
this paper's copy was not recorded; identical code first harvested from haoran0301/amenunet pointer only; the stored copy get_code serves, from haoran0301/amenunet, is pointer only (licence: NONE) · get_code("248284f69adfeaad") 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. |
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, 1 are also present in other papers whose code we hold (1 with at least one paper dated earlier, 0 the same month, 1 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.
| Function | Also present in | Earliest-dated | Others named |
|---|---|---|---|
| str2bool | 33 other papers 7 dated earlier, 26 later |
1406.6247 (2014-06) Recurrent Models of Visual Attention |
1506.03134 (2015-06) Pointer Networks 1611.09940 (2016-11) Neural Combinatorial Optimization with Reinforcement Learning and 30 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.
We present an end-to-end framework for solving the Vehicle Routing Problem (VRP) using reinforcement learning. In this approach, we train a single model that finds near-optimal solutions for problem instances sampled from a given distribution, only by observing the reward signals and following feasibility rules. Our model represents a parameterized stochastic policy, and by applying a policy gradient algorithm to optimize its parameters, the trained model produces the solution as a sequence of consecutive actions in real time, without the need to re-train for every new problem instance. On capacitated VRP, our approach outperforms classical heuristics and Google's OR-Tools on medium-sized instances in solution quality with comparable computation time (after training). We demonstrate how our approach can handle problems with split delivery and explore the effect of such deliveries on the solution quality. Our proposed framework can be applied to other variants of the VRP such as the stochastic VRP, and has the potential to be applied more generally to combinatorial optimization problems.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1802.04240")
get_code_for_paper("1802.04240")
have("1802.04240")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1802.04240.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1802.04240)
Connect an agent — have() is free.