5 of 5 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; 4 honoured the contract we drafted, 0 violated it and 1 has no contract verdict; 0 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/2205.13571.json · badge: /api/ran/2205.13571.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 |
|---|---|---|
| csmmlab/dlranet | canonical (classifier label) classifier basis not recorded on the link |
2 ran · 0 no recorded run |
| scsteffen/dlrt-net | community (classifier label) classifier basis not recorded on the link |
3 ran · 0 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| create_padding_mask | Ran ran, honoured the contract we drafted |
scsteffen/dlrt-net/src/networks/transformer_dlrt.py code served (permissive licence) · get_code("b96fc548499f7aef") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned EagerTensor, ndim 4, dtype family float, shape (2, 1, 1, 4) as a later run recorded it. The image it ran in was not recorded. If your copy returns the same type, ndim and shape on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.
|
| filter_max_tokens | Ran ran on a synthesized input |
csmmlab/dlranet/src/speech_transformer_DLRT.py code served (permissive licence) · get_code("7a4c362b07867a72") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned EagerTensor, ndim 0, dtype family float; no output shape is stated. The image it ran in was not recorded. If your copy returns the same type and ndim on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.
|
| get_angles | Ran ran, honoured the contract we drafted |
scsteffen/dlrt-net/src/networks/transformer_dlrt.py pointer only (licence: MIT); the stored copy get_code serves, from chihchenghsieh/eventlogdice, is pointer only (licence: NONE) · get_code("7816c6d65ab55d8f") How it ranThe body of this sample is withheld: this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from chihchenghsieh/eventlogdice, and GitHub detected no licence in that repository 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. |
| normalize_img | Ran ran, honoured the contract we drafted |
csmmlab/dlranet/src/mnist_DLRT.py code served (permissive licence) · get_code("0bc1827082ea37b5") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned tuple. The image it ran in was not recorded. If your copy returns the same type on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.
|
| positional_encoding | Ran ran, honoured the contract we drafted |
scsteffen/dlrt-net/src/networks/transformer_dlrt.py code served (permissive licence) · get_code("70fe09020aeba7f4") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1) and returned EagerTensor, ndim 3, dtype family float, shape (1, 8, 16) as a later run recorded it. The image it ran in was not recorded. If your copy returns the same type, ndim and shape on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.
|
Of 5 samples lifted from this paper's linked repositories, 5 carry a function identity and 0 do not. Of the 5 distinct functions with an identity, 4 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 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_angles | 14 other papers 9 dated earlier, 5 later · 2 only as an assembly brick |
1704.04368 (2017-04) Get To The Point: Summarization with Pointer-Generator Networks |
1706.03762 (2017-06) Attention Is All You Need 1810.04805 (2018-10) BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding and 11 more not named here |
| positional_encoding | 5 other papers 4 dated earlier, 1 later · 1 only as an assembly brick |
1704.04368 (2017-04) Get To The Point: Summarization with Pointer-Generator Networks |
1706.03762 (2017-06) Attention Is All You Need 1810.04805 (2018-10) BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding and 2 more not named here |
| create_padding_mask | 1 other paper 1 later |
2608.10288 (2026-08) Power law graph attention: exact generalization of scaled dot-product attention, empirical collapse at inference |
|
| normalize_img | 1 other paper 1 dated earlier |
1509.09308 (2015-09) Fast Algorithms for Convolutional Neural Networks |
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.
Neural networks have achieved tremendous success in a large variety of applications. However, their memory footprint and computational demand can render them impractical in application settings with limited hardware or energy resources. In this work, we propose a novel algorithm to find efficient low-rank subnetworks. Remarkably, these subnetworks are determined and adapted already during the training phase and the overall time and memory resources required by both training and evaluating them are significantly reduced. The main idea is to restrict the weight matrices to a low-rank manifold and to update the low-rank factors rather than the full matrix during training. To derive training updates that are restricted to the prescribed manifold, we employ techniques from dynamic model order reduction for matrix differential equations. This allows us to provide approximation, stability, and descent guarantees. Moreover, our method automatically and dynamically adapts the ranks during training to achieve the desired approximation accuracy. The efficiency of the proposed method is demonstrated through a variety of numerical experiments on fully-connected and convolutional networks.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2205.13571")
get_code_for_paper("2205.13571")
have("2205.13571")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2205.13571.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2205.13571)
Connect an agent — have() is free.