Hyunwoo Kim, Juyeon Ko, Inho Kong, Dogyun Park
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-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/2402.16506.json · badge: /api/ran/2402.16506.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 |
|---|---|---|
| mlvlab/SCDM | canonical (classifier label) classifier basis: classifier_2025 |
0 ran · 1 no recorded run |
| mlvlab/scdm | community Papers with Code archive |
1 ran · 2 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| SPADEGroupNorm | Ran ran on a synthesized input |
mlvlab/scdm/guided_diffusion/unet.py code served (permissive licence) · get_code("2093f8abdf7b5c3e") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, class construct-then-call prompt, model not recorded) and returned Tensor, ndim 4, dtype family float; no output shape is stated. The image it ran in was not recorded. If your copy returns the same type and ndim 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.
|
| CondTimestepBlock | Not yet run unverified (harvested, no recorded run) |
mlvlab/scdm/guided_diffusion/unet.py code served (permissive licence) · get_code("f857d1d316bcb04b") How it ranno invocation recorded. |
| SCDResBlock | Not yet run unverified (harvested, no recorded run) |
mlvlab/scdm/guided_diffusion/unet.py code served (permissive licence) · get_code("5823d8bc8de0e785") How it ranno invocation recorded. |
| calculate_frechet_distance | Not yet run unverified (harvested, no recorded run) |
mlvlab/SCDM/evaluations/fid/tests_with_FID.py code served (permissive licence) · get_code("0def50a351111624") How it ranno invocation recorded. this sample carries JSON test cases instead of a setup block; get_reference_implementation serves them with the level they back. |
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, 1 are also present in other papers whose code we hold (1 with at least one paper dated earlier, 1 the same month, 1 later) and 3 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 |
|---|---|---|---|
| calculate_frechet_distance | 74 other papers 53 dated earlier, 1 the same month, 19 later, 1 same year, order not determinable |
1610.09585 (2016-10) Conditional Image Synthesis With Auxiliary Classifier GANs |
1706.08500 (2017-06) GANs Trained by a Two Time-Scale Update Rule Converge to a Local Nash Equilibrium 1807.11458 (2018-07) To learn image super-resolution, use a GAN to learn how to do image degradation first and 71 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.
Semantic image synthesis (SIS) is a task to generate realistic images corresponding to semantic maps (labels). However, in real-world applications, SIS often encounters noisy user inputs. To address this, we propose Stochastic Conditional Diffusion Model (SCDM), which is a robust conditional diffusion model that features novel forward and generation processes tailored for SIS with noisy labels. It enhances robustness by stochastically perturbing the semantic label maps through Label Diffusion, which diffuses the labels with discrete diffusion. Through the diffusion of labels, the noisy and clean semantic maps become similar as the timestep increases, eventually becoming identical at t = T . This facilitates the generation of an image close to a clean image, enabling robust generation. Furthermore, we propose a class-wise noise schedule to differentially diffuse the labels depending on the class. We demonstrate that the proposed method generates high-quality samples through extensive experiments and analyses on benchmark datasets, including a novel experimental setup simulating human errors during real-world applications. Code is available at https://github.com/mlvlab/SCDM.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2402.16506")
get_code_for_paper("2402.16506")
have("2402.16506")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2402.16506.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2402.16506)
Connect an agent — have() is free.