3 of 6 samples (functions and classes) lifted from this paper's linked repositories executed on a synthesized input in Syntology's jail (2 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; 3 failures of our instrument; 3 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.09229.json · badge: /api/ran/2003.09229.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 |
|---|---|---|
| copy not recorded | community not in the paper's declared repositories |
2 ran · 0 no recorded run |
| xuanqing94/FLOATER | community (classifier label) classifier basis not recorded on the link |
1 ran · 3 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| Embedding | Ran ran; our contract draft was wrong, not the code · constructed an object; no result was computed |
this paper's copy was not recorded; identical code first harvested from instance-wise-ordered-transformer/iot pointer only; the stored copy get_code serves, from instance-wise-ordered-transformer/iot, is pointer only (licence: NOASSERTION) · get_code("96cbb5e9ca5b6be0") 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. |
| Linear | Ran ran; our contract draft was wrong, not the code · constructed an object; no result was computed |
this paper's copy was not recorded; identical code first harvested from instance-wise-ordered-transformer/iot pointer only; the stored copy get_code serves, from instance-wise-ordered-transformer/iot, is pointer only (licence: NOASSERTION) · get_code("8cd8cb0d1e9e63e4") 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. |
| safe_readline | Ran ran; our contract draft was wrong, not the code |
xuanqing94/FLOATER/fairseq/binarizer.py pointer only (licence: MIT); the stored copy get_code serves, from agi-content-generation/EKD, is pointer only (licence: NOASSERTION) · get_code("82bdf940665aeeb4") How it ranThe body of this sample is withheld: MIT, as GitHub detects it on this paper's repository, xuanqing94/FLOATER, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with 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. |
| load_checkpoint | Not yet run unverified (harvested, no recorded run) |
xuanqing94/FLOATER/fairseq/checkpoint_utils.py pointer only (licence: MIT) · get_code("ecf5bbfd1a093f93") How it ranThe body of this sample is withheld: MIT, as GitHub detects it on this paper's repository, xuanqing94/FLOATER, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with 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. No invocation recorded. |
| load_checkpoint_to_cpu | Not yet run unverified (harvested, no recorded run) |
xuanqing94/FLOATER/fairseq/checkpoint_utils.py pointer only (licence: MIT); the stored copy get_code serves, from MC-BERT/MC-BERT, is pointer only (licence: MIT) · get_code("df40d96cc20e7f57") How it ranThe body of this sample is withheld: MIT, as GitHub detects it on this paper's repository, xuanqing94/FLOATER, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with 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. No invocation recorded. |
| save_checkpoint | Not yet run unverified (harvested, no recorded run) |
xuanqing94/FLOATER/fairseq/checkpoint_utils.py pointer only (licence: MIT); the stored copy get_code serves, from THU-KEG/KEPLER, is pointer only (licence: MIT) · get_code("b3616a62387703cb") How it ranThe body of this sample is withheld: MIT, as GitHub detects it on this paper's repository, xuanqing94/FLOATER, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with 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. No invocation recorded. |
Of 6 samples lifted from this paper's linked repositories, 6 carry a function identity and 0 do not. Of the 6 distinct functions with an identity, 5 are also present in other papers whose code we hold (5 with at least one paper dated earlier, 0 the same month, 5 later) and 1 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 |
|---|---|---|---|
| safe_readline | 66 other papers 5 dated earlier, 61 later |
1610.02424 (2016-10) Diverse Beam Search: Decoding Diverse Solutions from Neural Sequence Models |
1802.06901 (2018-02) Deterministic Non-Autoregressive Neural Sequence Modeling by Iterative Refinement 1904.01038 (2019-04) FAIRSEQ: A Fast, Extensible Toolkit for Sequence Modeling and 63 more not named here |
| Linear | 58 other papers 7 dated earlier, 51 later · 5 only as an assembly brick |
1409.0473 (2014-09) Neural Machine Translation by Jointly Learning to Align and Translate |
1706.03762 (2017-06) Attention Is All You Need 1904.01681 (2019-04) Augmented Neural ODEs and 55 more not named here |
| Embedding | 29 other papers 3 dated earlier, 26 later |
1904.01681 (2019-04) Augmented Neural ODEs |
1906.12183 (2019-06) Neural ODEs as the Deep Limit of ResNets with constant weights 2002.03184 (2020-02) Time-aware Large Kernel Convolutions and 26 more not named here |
| load_checkpoint_to_cpu | 7 other papers 2 dated earlier, 5 later |
1904.01038 (2019-04) FAIRSEQ: A Fast, Extensible Toolkit for Sequence Modeling |
1911.06136 (2019-11) KEPLER: A Unified Model for Knowledge Embedding and Pre-trained Language Representation 2006.05744 (2020-06) MC-BERT: Efficient Language Pre-Training via a Meta Controller and 4 more not named here |
| save_checkpoint | 4 other papers 2 dated earlier, 2 later |
1904.01038 (2019-04) FAIRSEQ: A Fast, Extensible Toolkit for Sequence Modeling |
1911.06136 (2019-11) KEPLER: A Unified Model for Knowledge Embedding and Pre-trained Language Representation 2007.07691 (2020-07) A Multilingual Parallel Corpora Collection Effort for Indian Languages and 1 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-21.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
We introduce a new way of learning to encode position information for non-recurrent models, such as Transformer models. Unlike RNN and LSTM, which contain inductive bias by loading the input tokens sequentially, non-recurrent models are less sensitive to position. The main reason is that position information among input units is not inherently encoded, i.e., the models are permutation equivalent; this problem justifies why all of the existing models are accompanied by a sinusoidal encoding/embedding layer at the input. However, this solution has clear limitations: the sinusoidal encoding is not flexible enough as it is manually designed and does not contain any learnable parameters, whereas the position embedding restricts the maximum length of input sequences. It is thus desirable to design a new position layer that contains learnable parameters to adjust to different datasets and different architectures. At the same time, we would also like the encodings to extrapolate in accordance with the variable length of inputs. In our proposed solution, we borrow from the recent Neural ODE approach, which may be viewed as a versatile continuous version of a ResNet. This model is capable of modeling many kinds of dynamical systems. We model the evolution of encoded results along position index by such a dynamical system, thereby overcoming the above limitations of existing methods. We evaluate our new position layers on a variety of neural machine translation and language understanding tasks, the experimental results show consistent improvements over the baselines.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2003.09229")
get_code_for_paper("2003.09229")
have("2003.09229")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2003.09229.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2003.09229)
Connect an agent — have() is free.