Paul Hager, Fabian Harang, Luca Pelizzari, Samy Tindel
None of the 2 samples (functions and classes) lifted from this paper's linked repositories has a recorded run on a synthesized input (2 no recorded run), measured 2026-11-22; 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/2603.04525.json · badge: /api/ran/2603.04525.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 |
|---|---|---|
| hagerpa/tensordev | canonical (classifier label) classifier basis: census |
0 ran · 2 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| register_default_core_callback | Not yet run unverified (harvested, no recorded run) |
hagerpa/tensordev/src/tensordev/_backend.py code served (permissive licence) · get_code("e6ac27bf53ccfdbd") How it ranno invocation recorded. |
| set_default_core | Not yet run unverified (harvested, no recorded run) |
hagerpa/tensordev/src/tensordev/_backend.py code served (permissive licence) · get_code("793a122ec6622f8b") How it ranno invocation 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-22.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Modern approaches for learning from non-Markovian time series, such as recurrent neural networks, neural controlled differential equations or transformers, typically rely on implicit memory mechanisms that can be difficult to interpret or to train over long horizons. We propose the Volterra signature VSig(x; K) as a principled, explicit feature representation for history-dependent systems. By developing the input path x weighted by a temporal kernel K into the tensor algebra, we leverage the associated Volterra-Chen identity to derive rigorous learning-theoretic guarantees. Specifically, we prove an injectivity statement (identifiability under augmentation) that leads to a universal approximation theorem on the infinite dimensional path space, which in certain cases is achieved by linear functionals of VSig(x; K). Moreover, we demonstrate applicability of the kernel trick by showing that the inner product associated with Volterra signatures admits a closed characterization via a two-parameter integral equation, enabling numerical methods from PDEs for computation. For a large class of exponential-type kernels, VSig(x; K) solves a linear state-space ODE in the tensor algebra. Combined with inherent invariance to time reparameterization, these results position the Volterra signature as a robust, computationally tractable feature map for data science. We demonstrate its efficacy in dynamic learning tasks on real and synthetic data, where it consistently improves classical path signature baselines.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2603.04525")
get_code_for_paper("2603.04525")
have("2603.04525")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2603.04525.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2603.04525)
Connect an agent — have() is free.