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; 4 honoured the contract we drafted, 0 violated it and 0 have no contract verdict; 1 failure 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/2110.08616.json · badge: /api/ran/2110.08616.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 |
|---|---|---|
| cmu-catalyst/gradsign | canonical (classifier label) classifier basis: classifier_2025 |
5 ran · 0 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| get_flattened_metric | Ran ran, honoured the contract we drafted |
cmu-catalyst/gradsign/naswot-code/gradsign.py pointer only (licence: NONE) · get_code("020af7f72a6bb192") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, cmu-catalyst/gradsign 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. |
| get_grad_conflict | Ran ran; our contract draft was wrong, not the code |
cmu-catalyst/gradsign/naswot-code/gradsign.py pointer only (licence: NONE) · get_code("537831f0e0f67205") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, cmu-catalyst/gradsign 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. |
| get_layer_metric_array | Ran ran, honoured the contract we drafted |
cmu-catalyst/gradsign/naswot-code/gradsign.py pointer only (licence: NONE) · get_code("94369cfdcbec594e") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, cmu-catalyst/gradsign 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. |
| get_num_classes | Ran ran, honoured the contract we drafted |
cmu-catalyst/gradsign/zero-cost-nas-code/build.py pointer only (licence: NONE) · get_code("dbc9b4d67b87c439") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, cmu-catalyst/gradsign 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. |
| sum_arr | Ran ran, honoured the contract we drafted |
cmu-catalyst/gradsign/naswot-code/gradsign.py pointer only (licence: NONE) · get_code("39e4146c98293a4d") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, cmu-catalyst/gradsign 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. |
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, 1 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 1 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.
| Function | Also present in | Earliest-dated | Others named |
|---|---|---|---|
| sum_arr | 1 other paper 1 later |
2403.07591 (2024-03) Robustifying and Boosting Training-Free Neural Architecture Search |
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.
A key challenge in neural architecture search (NAS) is quickly inferring the predictive performance of a broad spectrum of networks to discover statistically accurate and computationally efficient ones. We refer to this task as model performance inference (MPI). The current practice for efficient MPI is gradient-based methods that leverage the gradients of a network at initialization to infer its performance. However, existing gradient-based methods rely only on heuristic metrics and lack the necessary theoretical foundations to consolidate their designs. We propose GradSign, an accurate, simple, and flexible metric for model performance inference with theoretical insights. The key idea behind GradSign is a quantity Ψ to analyze the optimization landscape of different networks at the granularity of individual training samples. Theoretically, we show that both the network's training and true population losses are proportionally upper-bounded by Ψ under reasonable assumptions. In addition, we design GradSign, an accurate and simple approximation of Ψ using the gradients of a network evaluated at a random initialization state. Evaluation on seven NAS benchmarks across three training datasets shows that GradSign generalizes well to real-world networks and consistently outperforms state-of-the-art gradient-based methods for MPI evaluated by Spearman's ρ and Kendall's Tau. Additionally, we integrate GradSign into four existing NAS algorithms and show that the GradSign-assisted NAS algorithms outperform their vanilla counterparts by improving the accuracies of best-discovered networks by up to 0.3%, 1.1%, and 1.0% on three real-world tasks.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2110.08616")
get_code_for_paper("2110.08616")
have("2110.08616")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2110.08616.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2110.08616)
Connect an agent — have() is free.