Tianlong Chen, Zhangyang Wang, Yu Cheng, Zhe Gan, Lei Zhang, Lu Yuan
2 of 7 samples (functions and classes) lifted from this paper's linked repositories executed on a synthesized input in Syntology's jail (1 of them constructed an object rather than computing a result; 0 honoured the contract we drafted, 0 violated it and 1 has no contract verdict; 1 failure of our instrument; 5 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/2106.04533.json · badge: /api/ran/2106.04533.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 |
|---|---|---|
| VITA-Group/SViTE | marked official in Papers with Code Papers with Code archive |
2 ran · 5 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| Attention | Ran ran on a synthesized input · constructed an object; no result was computed |
VITA-Group/SViTE/SViTE/dst_utils/core.py code served (permissive licence) · get_code("07b68690a098d7e6") 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 an instance of its own class, Attention: the run constructed the object and did not call it, so no result was computed. 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.
|
| compute_indicator | Ran ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT) |
VITA-Group/SViTE/SViTE/dst_utils/core.py code served (permissive licence) · get_code("f0c8388383fb4119") 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 list, ndim 1, 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.
|
| Masking | Not yet run unverified (harvested, no recorded run) |
VITA-Group/SViTE/SViTE/dst_utils/core.py code served (permissive licence) · get_code("2aa4315db6649c6d") How it ranno invocation recorded. |
| parameters_distribution | Not yet run unverified (harvested, no recorded run) |
VITA-Group/SViTE/SViTE/dst_utils/core.py code served (permissive licence) · get_code("e6e3f363f4ae3def") How it ranno invocation recorded. |
| prGreen | Not yet run unverified (harvested, no recorded run) |
VITA-Group/SViTE/SViTE/dst_utils/core.py code served (permissive licence) · get_code("0477c212cde13759") How it ranno invocation recorded. |
| prRed | Not yet run unverified (harvested, no recorded run) |
VITA-Group/SViTE/SViTE/dst_utils/core.py code served (permissive licence) · get_code("498dfd972b3c3d69") How it ranno invocation recorded. |
| prYellow | Not yet run unverified (harvested, no recorded run) |
VITA-Group/SViTE/SViTE/dst_utils/core.py code served (permissive licence) · get_code("ed701a8e13eb8f1d") How it ranno 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, 0 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 0 later) and 7 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.
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.
Vision transformers (ViTs) have recently received explosive popularity, but their enormous model sizes and training costs remain daunting. Conventional posttraining pruning often incurs higher training budgets. In contrast, this paper aims to trim down both the training memory overhead and the inference complexity, without sacrificing the achievable accuracy. We carry out the first-of-its-kind comprehensive exploration, on taking a unified approach of integrating sparsity in ViTs "from end to end". Specifically, instead of training full ViTs, we dynamically extract and train sparse subnetworks, while sticking to a fixed small parameter budget. Our approach jointly optimizes model parameters and explores connectivity throughout training, ending up with one sparse network as the final output. The approach is seamlessly extended from unstructured to structured sparsity, the latter by considering to guide the prune-and-grow of self-attention heads inside ViTs. We further co-explore data and architecture sparsity for additional efficiency gains by plugging in a novel learnable token selector to adaptively determine the currently most vital patches. Extensive results on ImageNet with diverse ViT backbones validate the effectiveness of our proposals which obtain significantly reduced computational cost and almost unimpaired generalization. Perhaps most surprisingly, we find that the proposed sparse (co-)training can sometimes improve the ViT accuracy rather than compromising it, making sparsity a tantalizing "free lunch". For example, our sparsified DeiT-Small at (5%, 50%) sparsity for (data, architecture), improves 0.28% top-1 accuracy, and meanwhile enjoys 49.32% FLOPs and 4.40% running time savings. Our codes are available at https: //github.com/VITA-Group/SViTE. 35th Conference on Neural Information Processing Systems (NeurIPS 2021).
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2106.04533")
get_code_for_paper("2106.04533")
have("2106.04533")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2106.04533.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2106.04533)
Connect an agent — have() is free.