Tianlong Chen, Zhangyang Wang, Xuxi Chen, Yanzhi Wang, Xiaolong Ma, Kernel Hight
None of the 3 samples (functions and classes) lifted from this paper's linked repositories has a recorded run on a synthesized input (3 no recorded run), measured 2026-11-21; 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/2202.04736.json · badge: /api/ran/2202.04736.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/structure-lth | canonical (classifier label) classifier basis: classifier_2025 |
0 ran · 2 no recorded run |
| copy not recorded | community not in the paper's declared repositories |
0 ran · 1 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| accuracy | Not yet run unverified (harvested, no recorded run) |
this paper's copy was not recorded; identical code first harvested from snu-mllab/PuzzleMix pointer only · get_code("f0c9a29156911331") How it ranThe body of this sample is withheld: this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for 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. |
| train | Not yet run unverified (harvested, no recorded run) |
vita-group/structure-lth/main_imp.py code served (permissive licence) · get_code("1e3f9a051b5a9b47") How it ranno invocation recorded. |
| validate | Not yet run unverified (harvested, no recorded run) |
vita-group/structure-lth/main_imp.py code served (permissive licence) · get_code("1b33d96e5ca7e277") How it ranno invocation recorded. |
Of 3 samples lifted from this paper's linked repositories, 3 carry a function identity and 0 do not. Of the 3 distinct functions with an identity, 3 are also present in other papers whose code we hold (3 with at least one paper dated earlier, 0 the same month, 1 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 |
|---|---|---|---|
| accuracy | 71 other papers 57 dated earlier, 12 later, 2 same year, order not determinable · 2 only as an assembly brick |
1505.05424 (2015-05) Weight Uncertainty in Neural Networks |
1705.07204 (2017-05) Ensemble Adversarial Training: Attacks and Defenses 1802.10399 (2018-02) Compressing Neural Networks using the Variational Information Bottleneck and 68 more not named here |
| train | 2 other papers 2 dated earlier |
2106.03225 (2021-06) Efficient Lottery Ticket Finding: Less Data is More |
2111.00162 (2021-11) You are caught stealing my winning lottery ticket! Making a lottery ticket claim its ownership |
| validate | 2 other papers 2 dated earlier |
2106.03225 (2021-06) Efficient Lottery Ticket Finding: Less Data is More |
2111.00162 (2021-11) You are caught stealing my winning lottery ticket! Making a lottery ticket claim its ownership |
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-21.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
The lottery ticket hypothesis (LTH) has shown that dense models contain highly sparse subnetworks (i.e., winning tickets) that can be trained in isolation to match full accuracy. Despite many exciting efforts being made, there is one "commonsense" rarely challenged: a winning ticket is found by iterative magnitude pruning (IMP) and hence the resultant pruned subnetworks have only unstructured sparsity. That gap limits the appeal of winning tickets in practice, since the highly irregular sparse patterns are challenging to accelerate on hardware. Meanwhile, directly substituting structured pruning for unstructured pruning in IMP damages performance more severely and is usually unable to locate winning tickets. In this paper, we demonstrate the first positive result that a structurally sparse winning ticket can be effectively found in general. The core idea is to append "post-processing techniques" after each round of (unstructured) IMP, to enforce the formation of structural sparsity. Specifically, we first "re-fill" pruned elements back in some channels deemed to be important, and then "re-group" non-zero elements to create flexible group-wise structural patterns. Both our identified channeland group-wise structural subnetworks win the lottery, with substantial inference speedups readily supported by existing hardware. Extensive experiments, conducted on diverse datasets across multiple network backbones, consistently validate our proposal, showing that the hardware acceleration roadblock of LTH is now removed. Specifically, the structural winning tickets obtain up to {64.93%, 64.84%, 60.23%} running time savings at {36% ∼ 80%, 74%, 58%} sparsity on {CIFAR, Tiny-ImageNet, ImageNet}, while maintaining comparable accuracy. Code
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2202.04736")
get_code_for_paper("2202.04736")
have("2202.04736")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2202.04736.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2202.04736)
Connect an agent — have() is free.