Yang Song, Stefano Ermon
2 of 3 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; 1 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/2006.09011.json · badge: /api/ran/2006.09011.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 |
|---|---|---|
| copy not recorded | community not in the paper's declared repositories |
2 ran · 1 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| register_corrector | Ran ran; our contract draft was wrong, not the code |
this paper's copy was not recorded; identical code first harvested from yang-song/score_sde_pytorch pointer only · get_code("a05b1d0cf3f508b4") 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. |
| register_predictor | Ran ran; our contract draft was wrong, not the code |
this paper's copy was not recorded; identical code first harvested from yang-song/score_sde_pytorch pointer only · get_code("473066ddf62a075a") 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. |
| get_predictor | Not yet run unverified (harvested, no recorded run) |
this paper's copy was not recorded; identical code first harvested from yang-song/score_sde_pytorch pointer only · get_code("a58facb8fe71823a") 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 3 samples lifted from this paper's linked repositories, 3 carry a function identity and 0 do not. Of the 3 distinct functions with an identity, 3 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 3 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 |
|---|---|---|---|
| get_predictor | 16 other papers 16 later · 1 only as an assembly brick |
2105.14080 (2021-05) Gotta Go Fast When Generating Data with Score-Based Models |
2112.07068 (2021-12) Score-Based Generative Modeling with Critically-Damped Langevin Diffusion 2211.16116 (2022-11) Machine learning emulation of a local-scale UK climate model and 13 more not named here |
| register_corrector | 15 other papers 15 later · 2 only as an assembly brick |
2011.13456 (2020-11) Score-Based Generative Modeling through Stochastic Differential Equations |
2105.14080 (2021-05) Gotta Go Fast When Generating Data with Score-Based Models 2112.07068 (2021-12) Score-Based Generative Modeling with Critically-Damped Langevin Diffusion and 12 more not named here |
| register_predictor | 15 other papers 15 later · 2 only as an assembly brick |
2011.13456 (2020-11) Score-Based Generative Modeling through Stochastic Differential Equations |
2105.14080 (2021-05) Gotta Go Fast When Generating Data with Score-Based Models 2112.07068 (2021-12) Score-Based Generative Modeling with Critically-Damped Langevin Diffusion and 12 more not named here |
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.
Score-based generative models can produce high quality image samples comparable to GANs, without requiring adversarial optimization. However, existing training procedures are limited to images of low resolution (typically below 32 × 32), and can be unstable under some settings. We provide a new theoretical analysis of learning and sampling from score-based models in high dimensional spaces, explaining existing failure modes and motivating new solutions that generalize across datasets. To enhance stability, we also propose to maintain an exponential moving average of model weights. With these improvements, we can scale scorebased generative models to various image datasets, with diverse resolutions ranging from 64 × 64 to 256 × 256. Our score-based models can generate high-fidelity samples that rival best-in-class GANs on various image datasets, including CelebA, FFHQ, and several LSUN categories. 34th Conference on Neural Information Processing Systems (NeurIPS 2020),
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2006.09011")
get_code_for_paper("2006.09011")
have("2006.09011")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2006.09011.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2006.09011)
Connect an agent — have() is free.