Yang Feng, Shaolei Zhang
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/2109.05238.json · badge: /api/ran/2109.05238.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 |
|---|---|---|
| ictnlp/moe-waitk | canonical (classifier label) classifier basis not recorded on the link |
1 ran · 1 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| safe_readline | Ran ran; our contract draft was wrong, not the code |
ictnlp/moe-waitk/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, ictnlp/moe-waitk, 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. |
| all_reduce | Not yet run unverified (harvested, no recorded run) |
ictnlp/moe-waitk/fairseq/distributed_utils.py pointer only (licence: MIT); the stored copy get_code serves, from agi-content-generation/EKD, is pointer only (licence: NOASSERTION) · get_code("199e96db5edd0edd") How it ranThe body of this sample is withheld: MIT, as GitHub detects it on this paper's repository, ictnlp/moe-waitk, 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 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, 2 are also present in other papers whose code we hold (2 with at least one paper dated earlier, 2 the same month, 2 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 |
|---|---|---|---|
| safe_readline | 66 other papers 29 dated earlier, 4 the same month, 31 later, 2 same year, order not determinable |
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 |
| all_reduce | 16 other papers 6 dated earlier, 1 the same month, 8 later, 1 same year, order not determinable |
1610.02424 (2016-10) Diverse Beam Search: Decoding Diverse Solutions from Neural Sequence Models |
2021.findings-emnlp.366 (2021 (year only)) Rethinking Zero-shot Neural Machine Translation: From a Perspective of Latent Variables 2104.08771 (2021-04) Cross-Attention is All You Need: Adapting Pretrained Transformers for Machine Translation and 13 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.
Simultaneous machine translation (SiMT) generates translation before reading the entire source sentence and hence it has to trade off between translation quality and latency. To fulfill the requirements of different translation quality and latency in practical applications, the previous methods usually need to train multiple SiMT models for different latency levels, resulting in large computational costs. In this paper, we propose a universal SiMT model with Mixture-of-Experts Wait-k Policy to achieve the best translation quality under arbitrary latency with only one trained model. Specifically, our method employs multi-head attention to accomplish the mixture of experts where each head is treated as a wait-k expert with its own waiting words number, and given a test latency and source inputs, the weights of the experts are accordingly adjusted to produce the best translation. Experiments on three datasets show that our method outperforms all the strong baselines under different latency, including the state-of-the-art adaptive policy.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2109.05238")
get_code_for_paper("2109.05238")
have("2109.05238")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2109.05238.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2109.05238)
Connect an agent — have() is free.