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 1 has no contract verdict; 0 failures of our instrument; 3 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/1802.04434.json · badge: /api/ran/1802.04434.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 |
|---|---|---|
| jasonakoun/signsgd-fault-tolerance | extension (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 |
|---|---|---|
| eval_dist | Ran ran on a synthesized input |
jasonakoun/signsgd-fault-tolerance/src/dist_training.py pointer only (licence: NONE) · get_code("906e7d9fe3cf6fbc") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, jasonakoun/signsgd-fault-tolerance 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. |
| one_bit | Not yet run unverified (harvested, no recorded run) |
this paper's copy was not recorded; identical code first harvested from scottjiao/Gradient-Compression-Methods pointer only; the stored copy get_code serves, from scottjiao/Gradient-Compression-Methods, is pointer only (licence: NONE) · get_code("73b74bb9bce598c9") 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. |
| quantize | Not yet run unverified (harvested, no recorded run) |
this paper's copy was not recorded; identical code first harvested from scottjiao/Gradient-Compression-Methods pointer only; the stored copy get_code serves, from scottjiao/Gradient-Compression-Methods, is pointer only (licence: NONE) · get_code("8c0c528956fb38b9") 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. |
| sparse_randomized | Not yet run unverified (harvested, no recorded run) |
this paper's copy was not recorded; identical code first harvested from scottjiao/Gradient-Compression-Methods pointer only; the stored copy get_code serves, from scottjiao/Gradient-Compression-Methods, is pointer only (licence: NONE) · get_code("1a1db7022bea18af") 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, 4 are also present in other papers whose code we hold (3 with at least one paper dated earlier, 0 the same month, 1 later) and 0 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 |
|---|---|---|---|
| eval_dist | 1 other paper 1 later |
1810.05291 (2018-10) signSGD with Majority Vote is Communication Efficient And Fault Tolerant |
|
| one_bit | 1 other paper 1 dated earlier |
1610.02132 (2016-10) QSGD: Communication-Efficient SGD via Gradient Quantization and Encoding |
|
| quantize | 1 other paper 1 dated earlier |
1610.02132 (2016-10) QSGD: Communication-Efficient SGD via Gradient Quantization and Encoding |
|
| sparse_randomized | 1 other paper 1 dated earlier |
1610.02132 (2016-10) QSGD: Communication-Efficient SGD via Gradient Quantization and Encoding |
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.
Training large neural networks requires distributing learning across multiple workers, where the cost of communicating gradients can be a significant bottleneck. signSGD alleviates this problem by transmitting just the sign of each minibatch stochastic gradient. We prove that it can get the best of both worlds: compressed gradients and SGD-level convergence rate. The relative $\ell_1/\ell_2$ geometry of gradients, noise and curvature informs whether signSGD or SGD is theoretically better suited to a particular problem. On the practical side we find that the momentum counterpart of signSGD is able to match the accuracy and convergence speed of Adam on deep Imagenet models. We extend our theory to the distributed setting, where the parameter server uses majority vote to aggregate gradient signs from each worker enabling 1-bit compression of worker-server communication in both directions. Using a theorem by Gauss we prove that majority vote can achieve the same reduction in variance as full precision distributed SGD. Thus, there is great promise for sign-based optimisation schemes to achieve fast communication and fast convergence. Code to reproduce experiments is to be found at https://github.com/jxbz/signSGD .
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1802.04434")
get_code_for_paper("1802.04434")
have("1802.04434")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1802.04434.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1802.04434)
Connect an agent — have() is free.