Zhangyang Wang, Xinyu Gong, Wuyang Chen
2 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; 2 failures of our instrument; 2 no recorded run); 1 of them was also run on the host, not in the jail, by the peer-agreement lane that set its level, 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/2102.11535.json · badge: /api/ran/2102.11535.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/TENAS | canonical (classifier label) classifier basis: classifier_2025 |
1 ran · 1 no recorded run |
| pnnl/torchntk | community Papers with Code archive |
1 ran · 0 no recorded run |
| idstcv/ZenNAS | community Papers with Code archive |
0 ran · 1 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| cal_entropy | Ran ran; our contract draft was wrong, not the code |
VITA-Group/TENAS/lib/models/cell_searchs/search_model_darts.py code served (permissive licence) · get_code("5adedaaf29d0048f") How it ranRan in Syntology's jail on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1) and returned Tensor, ndim 1, dtype family float, shape (2,) as a later run recorded it. The image it ran in was not recorded. The comparison behind this sample's level is a different run: the peer-agreement lane ran it again on the host, not in the jail (report dated 2026-09-04T23:56:52Z). 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.
|
| autograd_ntk | Ran ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT) |
pnnl/torchntk/torchntk/autograd/autograd_ntk.py pointer only (licence: NOASSERTION) · get_code("8c9e2a9cf3c22af1") How it ranThe body of this sample is withheld: GitHub could not classify the licence of this paper's repository, pnnl/torchntk (NOASSERTION). 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. |
| get_ntk_n | Not yet run unverified (harvested, no recorded run) |
idstcv/ZenNAS/ZeroShotProxy/compute_te_nas_score.py pointer only (licence: NONE) · get_code("943299cba82721a7") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, idstcv/ZenNAS 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. No invocation recorded. |
| get_ntk_n | Not yet run unverified (harvested, no recorded run) |
VITA-Group/TENAS/lib/procedures/ntk.py code served (permissive licence) · get_code("16d05701e6a4d833") How it ranno 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, 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 4 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.
Neural Architecture Search (NAS) has been explosively studied to automate the discovery of top-performer neural networks. Current works require heavy training of supernet or intensive architecture evaluations, thus suffering from heavy resource consumption and often incurring search bias due to truncated training or approximations. Can we select the best neural architectures without involving any training and eliminate a drastic portion of the search cost? We provide an affirmative answer, by proposing a novel framework called training-free neural architecture search (TE-NAS). TE-NAS ranks architectures by analyzing the spectrum of the neural tangent kernel (NTK) and the number of linear regions in the input space. Both are motivated by recent theory advances in deep networks and can be computed without any training and any label. We show that: (1) these two measurements imply the trainability and expressivity of a neural network; (2) they strongly correlate with the network's test accuracy. Further on, we design a pruning-based NAS mechanism to achieve a more flexible and superior trade-off between the trainability and expressivity during the search. In NAS-Bench-201 and DARTS search spaces, TE-NAS completes high-quality search but only costs 0.5 and 4 GPU hours with one 1080Ti on CIFAR-10 and ImageNet, respectively. We hope our work inspires more attempts in bridging the theoretical findings of deep networks and practical impacts in real NAS applications. Code is available at: https://github.com/VITA-Group/TENAS.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2102.11535")
get_code_for_paper("2102.11535")
have("2102.11535")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2102.11535.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2102.11535)
Connect an agent — have() is free.