Tianlong Chen, Zhangyang Wang, Sijia Liu, Shiyu Chang, Yang Zhang, Zhenyu Zhang
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; 3 honoured the contract we drafted, 0 violated it and 0 have no contract verdict; 2 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/2206.04762.json · badge: /api/ran/2206.04762.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/double-win-lth | canonical (classifier label) classifier basis: classifier_2025 |
3 ran · 0 no recorded run |
| copy not recorded | community not in the paper's declared repositories |
2 ran · 0 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| accuracy | Ran ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT) |
this paper's copy was not recorded; identical code first harvested from songweige/contrastive-learning-with-non-semantic-negatives pointer only · get_code("131a82fd65128218") 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. A run is recorded. |
| check_sparsity | Ran ran, honoured the contract we drafted |
vita-group/double-win-lth/utils_pruning.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.
|
| check_sparsity_mask | Ran ran, honoured the contract we drafted |
vita-group/double-win-lth/utils_pruning.py code served (permissive licence) · get_code("a13a55fea2e1977f") 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.
|
| extract_mask | Ran ran; our contract draft was wrong, not the code |
vita-group/double-win-lth/utils_pruning.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.
|
| validate | Ran ran, honoured the contract we drafted |
this paper's copy was not recorded; identical code first harvested from visinf/fast-axiomatic-attribution pointer only · get_code("5c22680084c0ea6f") 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. A run is recorded. |
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 (4 with at least one paper dated earlier, 1 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 |
|---|---|---|---|
| accuracy | 116 other papers 44 dated earlier, 7 the same month, 61 later, 4 same year, order not determinable · 8 only as an assembly brick |
1502.03044 (2015-02) Show, Attend and Tell: Neural Image Caption Generation with Visual Attention |
1610.05820 (2016-10) Membership Inference Attacks Against Machine Learning Models 1905.03696 (2019-05) HAWQ: Hessian AWare Quantization of Neural Networks with Mixed-Precision and 113 more not named here |
| validate | 6 other papers 2 dated earlier, 4 later |
2105.11527 (2021-05) Unsupervised Visual Representation Learning by Online Constrained K-Means |
2111.07668 (2021-11) Fast Axiomatic Attribution for Neural Networks 2208.06270 (2022-08) RenyiCL: Contrastive Representation Learning with Skew Renyi Divergence and 3 more not named here |
| extract_mask | 2 other papers 1 dated earlier, 1 later |
2106.03225 (2021-06) Efficient Lottery Ticket Finding: Less Data is More |
2407.02068 (2024-07) LPViT: Low-Power Semi-structured Pruning for Vision Transformers |
| check_sparsity | 1 other paper 1 dated earlier |
2106.03225 (2021-06) Efficient Lottery Ticket Finding: Less Data is More |
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.
Pre-training serves as a broadly adopted starting point for transfer learning on various downstream tasks. Recent investigations of lottery tickets hypothesis (LTH) demonstrate such enormous pre-trained models can be replaced by extremely sparse subnetworks (a.k.a. matching subnetworks) without sacrificing transferability. However, practical security-crucial applications usually pose more challenging requirements beyond standard transfer, which also demand these subnetworks to overcome adversarial vulnerability. In this paper, we formulate a more rigorous concept, Double-Win Lottery Tickets, in which a located subnetwork from a pre-trained model can be independently transferred on diverse downstream tasks, to reach BOTH the same standard and robust generalization, under BOTH standard and adversarial training regimes, as the full pre-trained model can do. We comprehensively examine various pre-training mechanisms and find that robust pretraining tends to craft sparser double-win lottery tickets with superior performance over the standard counterparts. For example, on downstream CIFAR-10/100 datasets, we identify double-win matching subnetworks with the standard, fast adversarial, and adversarial pre-training from Ima-geNet, at 89.26%/73.79%, 89.26%/79.03%, and 91.41%/83.22% sparsity, respectively. Furthermore, we observe the obtained double-win lottery tickets can be more data-efficient to transfer, under practical data-limited (e.g., 1% and 10%) downstream schemes. Our results show that the benefits from robust pre-training are amplified by the lottery ticket scheme, as well as the data-limited transfer setting. Codes are available at https://github.com/VITA-Group/ Double-Win-LTH.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2206.04762")
get_code_for_paper("2206.04762")
have("2206.04762")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2206.04762.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2206.04762)
Connect an agent — have() is free.