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, 2 violated it and 0 have 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/2003.05997.json · badge: /api/ran/2003.05997.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 |
|---|---|---|
| lucidrains/routing-transformer | canonical (classifier label) classifier basis: classifier_2025 |
1 ran · 0 no recorded run |
| copy not recorded | community not in the paper's declared repositories |
2 ran · 0 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| default | Ran ran, violated the contract we drafted |
lucidrains/routing-transformer/routing_transformer/routing_transformer.py code served (permissive licence) · get_code("27ab3e63c68fe18a") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Sonnet 4.5, prompt python_fixture_v1) and returned int, ndim 0, dtype family int, 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.
|
| exists | Ran ran, violated the contract we drafted |
this paper's copy was not recorded; identical code first harvested from ThomasMrY/VCT pointer only; the stored copy get_code serves, from ThomasMrY/VCT, is pointer only (licence: NONE) · get_code("aa5486a3650902d8") 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. |
| identity | Ran ran, honoured the contract we drafted |
this paper's copy was not recorded; identical code first harvested from lucidrains/marge-pytorch pointer only · get_code("caeb28d34b34bc2a") 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, 3 are also present in other papers whose code we hold (2 with at least one paper dated earlier, 1 the same month, 3 later) and 0 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 |
|---|---|---|---|
| exists | 486 other papers 15 dated earlier, 1 the same month, 468 later, 2 undated · 78 only as an assembly brick |
1603.08155 (2016-03) Perceptual Losses for Real-Time Style Transfer and Super-Resolution |
1611.07004 (2016-11) Image-to-Image Translation with Conditional Adversarial Networks 1804.04637 (2018-04) EMBER: An Open Dataset for Training Static PE Malware Machine Learning Models and 483 more not named here |
| identity | 5 other papers 2 dated earlier, 3 later |
1912.11554 (2019-12) Composable Effects for Flexible and Accelerated Probabilistic Programming in NumPyro |
2002.05202 (2020-02) GLU Variants Improve Transformer 2006.04768 (2020-06) Linformer: Self-Attention with Linear Complexity and 2 more not named here |
| default | 1 other paper 1 later |
2105.14850 (2021-05) Cascaded Head-colliding Attention |
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.
Self-attention has recently been adopted for a wide range of sequence modeling problems. Despite its effectiveness, self-attention suffers from quadratic compute and memory requirements with respect to sequence length. Successful approaches to reduce this complexity focused on attending to local sliding windows or a small set of locations independent of content. Our work proposes to learn dynamic sparse attention patterns that avoid allocating computation and memory to attend to content unrelated to the query of interest. This work builds upon two lines of research: it combines the modeling flexibility of prior work on content-based sparse attention with the efficiency gains from approaches based on local, temporal sparse attention. Our model, the Routing Transformer, endows self-attention with a sparse routing module based on online k-means while reducing the overall complexity of attention to $O\left(n^{1.5}d\right)$ from $O\left(n^2d\right)$ for sequence length $n$ and hidden dimension $d$. We show that our model outperforms comparable sparse attention models on language modeling on Wikitext-103 (15.8 vs 18.3 perplexity) as well as on image generation on ImageNet-64 (3.43 vs 3.44 bits/dim) while using fewer self-attention layers. Additionally, we set a new state-of-the-art on the newly released PG-19 data-set, obtaining a test perplexity of 33.2 with a 22 layer Routing Transformer model trained on sequences of length 8192.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2003.05997")
get_code_for_paper("2003.05997")
have("2003.05997")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2003.05997.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2003.05997)
Connect an agent — have() is free.