Kai Han, Yunhe Wang, Yehui Tang, Chao Xu, Ning Ding, Lin Li, Haochen Qin, Zhenli Zhou, Heng Liao
5 of 7 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; 5 failures of our instrument; 2 no recorded run), measured 2026-11-22; 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/2411.12992.json · badge: /api/ran/2411.12992.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 |
|---|---|---|
| ningding-o/MemoryFormer | canonical (classifier label) classifier basis: census |
5 ran · 2 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| get_act_fn | Ran ran; our contract draft was wrong, not the code |
ningding-o/MemoryFormer/memory_module/memory.py pointer only (licence: NONE) · get_code("fa3faefccdb297ee") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, ningding-o/MemoryFormer when it was checked. 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. |
| get_checkpoint_tag | Ran ran; our contract draft was wrong, not the code |
ningding-o/MemoryFormer/megatron/checkpointing.py pointer only (licence: NONE) · get_code("69002400aad5a8a6") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, ningding-o/MemoryFormer when it was checked. 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. |
| my_torch_gather | Ran ran; our contract draft was wrong, not the code |
ningding-o/MemoryFormer/memory_module/memory.py pointer only (licence: NONE) · get_code("86609b7a60859981") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, ningding-o/MemoryFormer when it was checked. 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. |
| pairwise | Ran ran; our contract draft was wrong, not the code |
ningding-o/MemoryFormer/configs/gen_docs.py pointer only (licence: NONE) · get_code("50c9c165cf801f59") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, ningding-o/MemoryFormer when it was checked. 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. |
| to_md | Ran ran; our contract draft was wrong, not the code |
ningding-o/MemoryFormer/configs/gen_docs.py pointer only (licence: NONE) · get_code("64dd872a8ac47294") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, ningding-o/MemoryFormer when it was checked. 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. |
| get_docs | Not yet run unverified (harvested, no recorded run) |
ningding-o/MemoryFormer/configs/gen_docs.py pointer only (licence: NONE) · get_code("d5081f28e2befd2c") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, ningding-o/MemoryFormer when it was checked. 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. |
| monitor_method_cuda_wall_times | Not yet run unverified (harvested, no recorded run) |
ningding-o/MemoryFormer/megatron/devutil.py pointer only (licence: NONE) · get_code("3a5fc202b5d9ec24") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, ningding-o/MemoryFormer when it was checked. 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 7 samples lifted from this paper's linked repositories, 7 carry a function identity and 0 do not. Of the 7 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 2 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 |
|---|---|---|---|
| pairwise | 5 other papers 4 dated earlier, 1 later |
2205.09921 (2022-05) KERPLE: Kernelized Relative Positional Embedding for Length Extrapolation |
2312.02406 (2023-12) Efficient Online Data Mixing For Language Model Pre-Training 2406.12428 (2024-06) PSLM: Parallel Generation of Text and Speech with LLMs for Low-Latency Spoken Dialogue Systems and 2 more not named here |
| to_md | 5 other papers 4 dated earlier, 1 later |
2205.09921 (2022-05) KERPLE: Kernelized Relative Positional Embedding for Length Extrapolation |
2312.02406 (2023-12) Efficient Online Data Mixing For Language Model Pre-Training 2406.12428 (2024-06) PSLM: Parallel Generation of Text and Speech with LLMs for Low-Latency Spoken Dialogue Systems and 2 more not named here |
| get_checkpoint_tag | 3 other papers 2 dated earlier, 1 later |
2406.12428 (2024-06) PSLM: Parallel Generation of Text and Speech with LLMs for Low-Latency Spoken Dialogue Systems |
2410.04798 (2024-10) DAPE V2: Process Attention Score as Feature Map for Length Extrapolation 2504.12463 (2025-04) Dense Backpropagation Improves Training for Sparse Mixture-of-Experts |
| get_docs | 3 other papers 2 dated earlier, 1 later |
2406.12428 (2024-06) PSLM: Parallel Generation of Text and Speech with LLMs for Low-Latency Spoken Dialogue Systems |
2410.04798 (2024-10) DAPE V2: Process Attention Score as Feature Map for Length Extrapolation 2504.12463 (2025-04) Dense Backpropagation Improves Training for Sparse Mixture-of-Experts |
| monitor_method_cuda_wall_times | 3 other papers 2 dated earlier, 1 later |
2406.12428 (2024-06) PSLM: Parallel Generation of Text and Speech with LLMs for Low-Latency Spoken Dialogue Systems |
2410.04798 (2024-10) DAPE V2: Process Attention Score as Feature Map for Length Extrapolation 2504.12463 (2025-04) Dense Backpropagation Improves Training for Sparse Mixture-of-Experts |
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.
In order to reduce the computational complexity of large language models, great efforts have been made to to improve the efficiency of transformer models such as linear attention and flash-attention. However, the model size and corresponding computational complexity are constantly scaled up in pursuit of higher performance. In this work, we present MemoryFormer, a novel transformer architecture which significantly reduces the computational complexity (FLOPs) from a new perspective. We eliminate nearly all the computations of the transformer model except for the necessary computation required by the multi-head attention operation. This is made possible by utilizing an alternative method for feature transformation to replace the linear projection of fully-connected layers. Specifically, we first construct a group of in-memory lookup tables that store a large amount of discrete vectors to replace the weight matrix used in linear projection. We then use a hash algorithm to retrieve a correlated subset of vectors dynamically based on the input embedding. The retrieved vectors combined together will form the output embedding, which provides an estimation of the result of matrix multiplication operation in a fully-connected layer. Compared to conducting matrix multiplication, retrieving data blocks from memory is a much cheaper operation which requires little computations. We train MemoryFormer from scratch and conduct extensive experiments on various benchmarks to demonstrate the effectiveness of the proposed model. Code is available at https://github.com/ningding-o/MemoryFormer.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2411.12992")
get_code_for_paper("2411.12992")
have("2411.12992")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2411.12992.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2411.12992)
Connect an agent — have() is free.