1 of 4 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; 0 honoured the contract we drafted, 0 violated it and 0 have no contract verdict; 1 failure of our instrument; 3 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/2111.00162.json · badge: /api/ran/2111.00162.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/no-stealing-lth | canonical (classifier label) classifier basis: classifier_2025 |
1 ran · 0 no recorded run |
| copy not recorded | community not in the paper's declared repositories |
0 ran · 3 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| extract_mask | Ran ran; our contract draft was wrong, not the code |
vita-group/no-stealing-lth/embed_res20s_cifar10.py code served (permissive licence) · get_code("0be9ebde5fff585f") 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 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.
|
| 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) |
this paper's copy was not recorded; identical code first harvested from vita-group/structure-lth pointer only · get_code("1e3f9a051b5a9b47") 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. |
| validate | Not yet run unverified (harvested, no recorded run) |
this paper's copy was not recorded; identical code first harvested from vita-group/structure-lth pointer only · get_code("1b33d96e5ca7e277") 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. |
Of 4 samples lifted from this paper's linked repositories, 4 carry a function identity and 0 do not. Of the 4 distinct functions with an identity, 3 are also present in other papers whose code we hold (3 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 | 71 other papers 52 dated earlier, 1 the same month, 16 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 1 dated earlier, 1 later |
2106.03225 (2021-06) Efficient Lottery Ticket Finding: Less Data is More |
2202.04736 (2022-02) Coarsening the Granularity: Towards Structurally Sparse Lottery Tickets |
| validate | 2 other papers 1 dated earlier, 1 later |
2106.03225 (2021-06) Efficient Lottery Ticket Finding: Less Data is More |
2202.04736 (2022-02) Coarsening the Granularity: Towards Structurally Sparse Lottery Tickets |
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.
Despite tremendous success in many application scenarios, the training and inference costs of using deep learning are also rapidly increasing over time. The lottery ticket hypothesis (LTH) emerges as a promising framework to leverage a special sparse subnetwork (i.e., winning ticket) instead of a full model for both training and inference, that can lower both costs without sacrificing the performance. The main resource bottleneck of LTH is however the extraordinary cost to find the sparse mask of the winning ticket. That makes the found winning ticket become a valuable asset to the owners, highlighting the necessity of protecting its copyright. Our setting adds a new dimension to the recently soaring interest in protecting against the intellectual property (IP) infringement of deep models and verifying their ownerships, since they take owners' massive/unique resources to develop or train. While existing methods explored encrypted weights or predictions, we investigate a unique way to leverage sparse topological information to perform lottery verification, by developing several graph-based signatures that can be embedded as credentials. By further combining trigger set-based methods, our proposal can work in both white-box and black-box verification scenarios. Through extensive experiments, we demonstrate the effectiveness of lottery verification in diverse models (ResNet-20, ResNet-18, ResNet-50) on CIFAR-10 and CIFAR-100. Specifically, our verification is shown to be robust to removal attacks such as model fine-tuning and pruning, as well as several ambiguity attacks. Our codes are available at https://github.com/VITA-Group/NO-stealing-LTH.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2111.00162")
get_code_for_paper("2111.00162")
have("2111.00162")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2111.00162.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2111.00162)
Connect an agent — have() is free.