Franck Djeumou, Ufuk Topcu, Cyrus Neary, Eric Goubault, Sylvie Putot
4 of 4 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; 4 failures 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/2201.05715.json · badge: /api/ran/2201.05715.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 |
|---|---|---|
| wuwushrek/taylanets | marked official in Papers with Code Papers with Code archive |
4 ran · 0 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| midpoint_eval | Ran ran; our contract draft was wrong, not the code |
wuwushrek/taylanets/taylanets/tayla.py pointer only (licence: GPL-3.0) · get_code("8c0bd65c12ac49f2") How it ranThe body of this sample is withheld: GPL-3.0, as GitHub detects it on this paper's repository, wuwushrek/taylanets, is not in the permissive set Syntology serves inline. 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. |
| ode_truncated_taylor | Ran ran; our contract draft was wrong, not the code |
wuwushrek/taylanets/taylanets/tayla.py pointer only (licence: GPL-3.0) · get_code("54afb5c0e481f9b9") How it ranThe body of this sample is withheld: GPL-3.0, as GitHub detects it on this paper's repository, wuwushrek/taylanets, is not in the permissive set Syntology serves inline. 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. |
| tayla | Ran ran; our contract draft was wrong, not the code |
wuwushrek/taylanets/taylanets/tayla.py pointer only (licence: GPL-3.0) · get_code("723f9b58680f8b30") How it ranThe body of this sample is withheld: GPL-3.0, as GitHub detects it on this paper's repository, wuwushrek/taylanets, is not in the permissive set Syntology serves inline. 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. |
| taylor_order_n | Ran ran; our contract draft was wrong, not the code |
wuwushrek/taylanets/taylanets/tayla.py pointer only (licence: GPL-3.0) · get_code("4a4d0ed534d47018") How it ranThe body of this sample is withheld: GPL-3.0, as GitHub detects it on this paper's repository, wuwushrek/taylanets, is not in the permissive set Syntology serves inline. 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 4 samples lifted from this paper's linked repositories, 4 carry a function identity and 0 do not. Of the 4 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 4 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-22.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Neural ordinary differential equations (NODEs) -parametrizations of differential equations using neural networks -have shown tremendous promise in learning models of unknown continuous-time dynamical systems from data. However, every forward evaluation of a NODE requires numerical integration of the neural network used to capture the system dynamics, making their training prohibitively expensive. Existing works rely on off-the-shelf adaptive step-size numerical integration schemes, which often require an excessive number of evaluations of the underlying dynamics network to obtain sufficient accuracy for training. By contrast, we accelerate the evaluation and the training of NODEs by proposing a data-driven approach to their numerical integration. The proposed Taylor-Lagrange NODEs (TL-NODEs) use a fixed-order Taylor expansion for numerical integration, while also learning to estimate the expansion's approximation error. As a result, the proposed approach achieves the same accuracy as adaptive step-size schemes while employing only low-order Taylor expansions, thus greatly reducing the computational cost necessary to integrate the NODE. A suite of numerical experiments, including modeling dynamical systems, image classification, and density estimation, demonstrate that TL-NODEs can be trained more than an order of magnitude faster than state-of-the-art approaches, without any loss in performance.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2201.05715")
get_code_for_paper("2201.05715")
have("2201.05715")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2201.05715.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2201.05715)
Connect an agent — have() is free.