Weihua Luo, Junliang Guo, Zhirui Zhang, Boxing Chen, Shujian Huang, Jiajun Chen, Xin Zheng
1 of 2 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; 1 failure of our instrument; 1 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/2105.13022.json · badge: /api/ran/2105.13022.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 |
|---|---|---|
| zhengxxn/adaptive-knn-mt | canonical (classifier label) classifier basis not recorded on the link |
1 ran · 0 no recorded run |
| dannigt/kit-iwslt2023-multilingual | community (classifier label) classifier basis not recorded on the link |
0 ran · 1 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| get_symbols_to_strip_from_output | Ran ran; our contract draft was wrong, not the code |
zhengxxn/adaptive-knn-mt/knn_generate.py pointer only (licence: MIT); the stored copy get_code serves, from urvashik/knnmt, is pointer only (licence: NONE) · get_code("88ce019380f10478") How it ranThe body of this sample is withheld: MIT, as GitHub detects it on this paper's repository, zhengxxn/adaptive-knn-mt, 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. |
| upgrade_state_dict_for_deltalm | Not yet run unverified (harvested, no recorded run) |
dannigt/kit-iwslt2023-multilingual/deltalm/models/deltalm.py code served (permissive licence) · get_code("86781cfd55af56ed") 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, 1 are also present in other papers whose code we hold (1 with at least one paper dated earlier, 1 the same month, 1 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 |
|---|---|---|---|
| get_symbols_to_strip_from_output | 13 other papers 1 dated earlier, 1 the same month, 11 later |
2010.00710 (2020-10) Nearest Neighbor Machine Translation |
2105.05498 (2021-05) Improving Lexically Constrained Neural Machine Translation with Source-Conditioned Masked Span Prediction 2106.06751 (2021-06) Guiding Teacher Forcing with Seer Forcing for Neural Machine Translation and 10 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.
kNN-MT, recently proposed by Khandelwal et al. (2020a), successfully combines pretrained neural machine translation (NMT) model with token-level k-nearest-neighbor (kNN) retrieval to improve the translation accuracy. However, the traditional kNN algorithm used in kNN-MT simply retrieves a same number of nearest neighbors for each target token, which may cause prediction errors when the retrieved neighbors include noises. In this paper, we propose Adaptive kNN-MT to dynamically determine the number of k for each target token. We achieve this by introducing a light-weight Meta-k Network, which can be efficiently trained with only a few training samples. On four benchmark machine translation datasets, we demonstrate that the proposed method is able to effectively filter out the noises in retrieval results and significantly outperforms the vanilla kNN-MT model. Even more noteworthy is that the Meta-k Network learned on one domain could be directly applied to other domains and obtain consistent improvements, illustrating the generality of our method. Our implementation is open-sourced at https://github. com/zhengxxn/adaptive-knn-mt.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2105.13022")
get_code_for_paper("2105.13022")
have("2105.13022")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2105.13022.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2105.13022)
Connect an agent — have() is free.