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; 0 honoured the contract we drafted, 0 violated it and 0 have no contract verdict; 3 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/2210.15097.json · badge: /api/ran/2210.15097.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 |
3 ran · 0 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| prepare_ctrl_input | Ran ran; our contract draft was wrong, not the code |
this paper's copy was not recorded; identical code first harvested from huggingface/transformers pointer only · get_code("a766a95b9fd5ee9c") 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. |
| prepare_xlm_input | Ran ran; our contract draft was wrong, not the code |
this paper's copy was not recorded; identical code first harvested from huggingface/transformers pointer only · get_code("b7bf53f6b6b11a4b") 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. |
| prepare_xlnet_input | Ran ran; our contract draft was wrong, not the code |
this paper's copy was not recorded; identical code first harvested from huggingface/transformers pointer only · get_code("80844fa7cfa6e8d8") 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 (3 with at least one paper dated earlier, 0 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 |
|---|---|---|---|
| prepare_ctrl_input | 11 other papers 4 dated earlier, 7 later |
1910.03771 (2019-10) HuggingFace's Transformers: State-of-the-art Natural Language Processing |
2009.14259 (2020-09) Visually-Grounded Planning without Vision: Language Models Infer Detailed Plans from High-level Instructions 2106.06168 (2021-06) Generate, Annotate, and Learn: NLP with Synthetic Text and 8 more not named here |
| prepare_xlm_input | 11 other papers 4 dated earlier, 7 later |
1910.03771 (2019-10) HuggingFace's Transformers: State-of-the-art Natural Language Processing |
2009.14259 (2020-09) Visually-Grounded Planning without Vision: Language Models Infer Detailed Plans from High-level Instructions 2106.06168 (2021-06) Generate, Annotate, and Learn: NLP with Synthetic Text and 8 more not named here |
| prepare_xlnet_input | 8 other papers 1 dated earlier, 7 later |
1910.03771 (2019-10) HuggingFace's Transformers: State-of-the-art Natural Language Processing |
2305.01625 (2023-05) Unlimiformer: Long-Range Transformers with Unlimited Length Input 2402.05827 (2024-02) On the Robustness of Editing Large Language Models and 5 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-22.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Given a language model (LM), maximum probability is a poor decoding objective for open-ended generation, because it produces short and repetitive text. On the other hand, sampling can often produce incoherent text that drifts from the original topics. We propose contrastive decoding (CD), a reliable decoding approach that optimizes a contrastive objective subject to a plausibility constraint. The contrastive objective returns the difference between the likelihood under a large LM (called the expert, e.g. OPT-13B) and a small LM (called the amateur, e.g. OPT-125M), and the constraint ensures that the outputs are plausible. CD is inspired by the fact that the failures of larger LMs (e.g., repetition, incoherence) are even more prevalent in smaller LMs, and that this difference signals which texts should be preferred. CD requires zero additional training, and produces higher quality text than decoding from the larger LM alone. It also works across model scales (OPT-13B and GPT2-1.5B) and significantly outperforms four strong decoding algorithms (e.g., nucleus, top-k) in automatic and human evaluations across wikipedia, news and story domains.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2210.15097")
get_code_for_paper("2210.15097")
have("2210.15097")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2210.15097.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2210.15097)
Connect an agent — have() is free.