7 of 14 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; 1 honoured the contract we drafted, 0 violated it and 2 have no contract verdict; 4 failures of our instrument; 7 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/2106.03225.json · badge: /api/ran/2106.03225.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/PrAC-LTH | canonical (classifier label) classifier basis: census |
7 ran · 7 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| check_sparsity | Ran ran, honoured the contract we drafted |
VITA-Group/PrAC-LTH/utils/pruner.py code served (permissive licence) · get_code("092c59fab4392ba6") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Sonnet 4.5, prompt python_fixture_v1) and returned float, ndim 0, dtype family float, shape () 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.
|
| conv1x1 | Ran ran; our contract draft was wrong, not the code |
VITA-Group/PrAC-LTH/models/resnet.py code served (permissive licence) · get_code("d9def42110729a85") 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 Conv2d. 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.
|
| conv3x3 | Ran ran; our contract draft was wrong, not the code |
VITA-Group/PrAC-LTH/models/resnet.py code served (permissive licence) · get_code("160bb14bd76201b4") 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 Conv2d. 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.
|
| extract_mask | Ran ran; our contract draft was wrong, not the code |
VITA-Group/PrAC-LTH/utils/pruner.py code served (permissive licence) · get_code("cccbdd267d4f7850") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Sonnet 4.5, prompt python_fixture_v1) and returned dict. 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.
|
| make_layers | Ran ran; our contract draft was wrong, not the code |
VITA-Group/PrAC-LTH/models/vgg.py pointer only (licence: MIT); the stored copy get_code serves, from s-huu/TurningWeaknessIntoStrength, is pointer only (licence: NONE) · get_code("eba3f5bcc6a06d36") 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 s-huu/TurningWeaknessIntoStrength, 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. |
| reverse_mask | Ran ran on a synthesized input |
VITA-Group/PrAC-LTH/utils/pruner.py code served (permissive licence) · get_code("f79e6eaadbfc874c") 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 dict. 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.
|
| tiny_imagenet_dataloaders | Ran ran on a synthesized input |
VITA-Group/PrAC-LTH/dataset.py code served (permissive licence) · get_code("08b70ee63cdd4e70") 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, 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.
|
| accuracy | Not yet run unverified (harvested, no recorded run) |
VITA-Group/PrAC-LTH/main_imp.py code served (permissive licence) · get_code("f0c9a29156911331") How it ranno invocation recorded. |
| cifar100_dataloaders | Not yet run unverified (harvested, no recorded run) |
VITA-Group/PrAC-LTH/dataset.py code served (permissive licence) · get_code("0a0dbd36d312037d") How it ranno invocation recorded. |
| cifar10_dataloaders | Not yet run unverified (harvested, no recorded run) |
VITA-Group/PrAC-LTH/dataset.py code served (permissive licence) · get_code("92f75b060170e96e") How it ranno invocation recorded. |
| train | Not yet run unverified (harvested, no recorded run) |
VITA-Group/PrAC-LTH/main_imp.py code served (permissive licence) · get_code("1e3f9a051b5a9b47") How it ranno invocation recorded. |
| train | Not yet run unverified (harvested, no recorded run) |
VITA-Group/PrAC-LTH/main_PrAC_imp.py code served (permissive licence) · get_code("9e433381278f45b4") How it ranno invocation recorded. |
| validate | Not yet run unverified (harvested, no recorded run) |
VITA-Group/PrAC-LTH/main_PrAC_imp.py code served (permissive licence) · get_code("1b33d96e5ca7e277") How it ranno invocation recorded. |
| validate_PIE | Not yet run unverified (harvested, no recorded run) |
VITA-Group/PrAC-LTH/main_PrAC_imp.py code served (permissive licence) · get_code("a4adec80d8be98c2") How it ranno invocation recorded. |
Of 14 samples lifted from this paper's linked repositories, 14 carry a function identity and 0 do not. Of the 14 distinct functions with an identity, 8 are also present in other papers whose code we hold (4 with at least one paper dated earlier, 3 the same month, 8 later) and 6 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 |
|---|---|---|---|
| conv1x1 | 431 other papers 132 dated earlier, 5 the same month, 288 later, 5 same year, order not determinable, 1 undated · 38 only as an assembly brick |
1409.1556 (2014-09) Very Deep Convolutional Networks for Large-Scale Image Recognition |
1506.01186 (2015-06) Cyclical Learning Rates for Training Neural Networks 1507.05717 (2015-07) An End-to-End Trainable Neural Network for Image-based Sequence Recognition and Its Application to Scene Text Recognition and 428 more not named here |
| conv3x3 | 312 other papers 80 dated earlier, 2 the same month, 226 later, 3 same year, order not determinable, 1 undated · 31 only as an assembly brick |
1409.1556 (2014-09) Very Deep Convolutional Networks for Large-Scale Image Recognition |
1507.05717 (2015-07) An End-to-End Trainable Neural Network for Image-based Sequence Recognition and Its Application to Scene Text Recognition 1512.03385 (2015-12) Deep Residual Learning for Image Recognition and 309 more not named here |
| accuracy | 71 other papers 49 dated earlier, 1 the same month, 19 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 |
| make_layers | 59 other papers 27 dated earlier, 32 later |
1411.4038 (2014-11) Fully Convolutional Networks for Semantic Segmentation |
1511.00561 (2015-11) SegNet: A Deep Convolutional Encoder-Decoder Architecture for Image Segmentation 1511.05950 (2015-11) Staleness-aware Async-SGD for Distributed Deep Learning and 56 more not named here |
| extract_mask | 2 other papers 2 later |
2206.04762 (2022-06) Data-Efficient Double-Win Lottery Tickets from Robust Pre-training |
2407.02068 (2024-07) LPViT: Low-Power Semi-structured Pruning for Vision Transformers |
| train | 2 other papers 2 later |
2111.00162 (2021-11) You are caught stealing my winning lottery ticket! Making a lottery ticket claim its ownership |
2202.04736 (2022-02) Coarsening the Granularity: Towards Structurally Sparse Lottery Tickets |
| validate | 2 other papers 2 later |
2111.00162 (2021-11) You are caught stealing my winning lottery ticket! Making a lottery ticket claim its ownership |
2202.04736 (2022-02) Coarsening the Granularity: Towards Structurally Sparse Lottery Tickets |
| check_sparsity | 1 other paper 1 later |
2206.04762 (2022-06) Data-Efficient Double-Win Lottery Tickets from Robust Pre-training |
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) reveals the existence of winning tickets (sparse but critical subnetworks) for dense networks, that can be trained in isolation from random initialization to match the latter's accuracies. However, finding winning tickets requires burdensome computations in the train-prune-retrain process, especially on large-scale datasets (e.g., ImageNet), restricting their practical benefits. This paper explores a new perspective on finding lottery tickets more efficiently, by doing so only with a specially selected subset of data, called Pruning-Aware Critical set (PrAC set), rather than using the full training set. The concept of PrAC set was inspired by the recent observation, that deep networks have samples that are either hard to memorize during training, or easy to forget during pruning. A PrAC set is thus hypothesized to capture those most challenging and informative examples for the dense model. We observe that a high-quality winning ticket can be found with training and pruning the dense network on the very compact PrAC set, which can substantially save training iterations for the ticket finding process. Extensive experiments validate our proposal across diverse datasets and network architectures. Specifically, on CIFAR-10, CIFAR-100, and Tiny ImageNet, we locate effective PrAC sets at 35.32%~78.19% of their training set sizes. On top of them, we can obtain the same competitive winning tickets for the corresponding dense networks, yet saving up to 82.85%~92.77%, 63.54%~74.92%, and 76.14%~86.56% training iterations, respectively. Crucially, we show that a PrAC set found is reusable across different network architectures, which can amortize the extra cost of finding PrAC sets, yielding a practical regime for efficient lottery ticket finding.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2106.03225")
get_code_for_paper("2106.03225")
have("2106.03225")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2106.03225.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2106.03225)
Connect an agent — have() is free.