Ben Stevens, Tim Colonius
2 of 2 samples (functions and classes) lifted from this paper's linked repositories executed on a synthesized input in Syntology's jail (1 of them constructed an object rather than computing a result; 1 honoured the contract we drafted, 0 violated it and 1 has no contract verdict; 0 failures of our instrument; 0 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/2002.03014.json · badge: /api/ran/2002.03014.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 |
|---|---|---|
| FiniteNetICML2020Code/FiniteNet | marked official in Papers with Code Papers with Code archive |
2 ran · 0 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| Model | Ran ran on a synthesized input · constructed an object; no result was computed |
FiniteNetICML2020Code/FiniteNet/train_KSNet.py pointer only (licence: NONE) · get_code("c5fe5d2d07f2f0c6") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, FiniteNetICML2020Code/FiniteNet 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. |
| reshKS | Ran ran, honoured the contract we drafted |
FiniteNetICML2020Code/FiniteNet/train_KSNet.py pointer only (licence: NONE) · get_code("f9080e1a05f18edb") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, FiniteNetICML2020Code/FiniteNet 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, 0 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 0 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.
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.
In this work, we present a machine learning approach for reducing the error when numerically solving time-dependent partial differential equations (PDE). We use a fully convolutional LSTM network to exploit the spatiotemporal dynamics of PDEs. The neural network serves to enhance finite-difference and finite-volume methods (FDM/FVM) that are commonly used to solve PDEs, allowing us to maintain guarantees on the order of convergence of our method. We train the network on simulation data, and show that our network can reduce error by a factor of 2 to 3 compared to the baseline algorithms. We demonstrate our method on three PDEs that each feature qualitatively different dynamics. We look at the linear advection equation, which propagates its initial conditions at a constant speed, the inviscid Burgers' equation, which develops shockwaves, and the Kuramoto-Sivashinsky (KS) equation, which is chaotic.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2002.03014")
get_code_for_paper("2002.03014")
have("2002.03014")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2002.03014.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2002.03014)
Connect an agent — have() is free.