Molei Tao, Guan-Horng Liu, Tianrong Chen, Evangelos Theodorou
1 of 6 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; 1 honoured the contract we drafted, 0 violated it and 0 have no contract verdict; 0 failures of our instrument; 5 no recorded run), measured 2026-11-22; 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/2310.01236.json · badge: /api/ran/2310.01236.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 |
|---|---|---|
| ghliu/mdm | canonical (classifier label) classifier basis: classifier_2025 |
0 ran · 5 no recorded run |
| copy not recorded | community not in the paper's declared repositories |
1 ran · 0 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| parse_int_list | Ran ran, honoured the contract we drafted |
this paper's copy was not recorded; identical code first harvested from newbeeer/stf pointer only; the stored copy get_code serves, from newbeeer/stf, is pointer only (licence: NONE) · get_code("cacd4f6ec202d9b4") 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. |
| ConstraintSet | Not yet run unverified (harvested, no recorded run) |
ghliu/mdm/mdm/constraintset.py code served (permissive licence) · get_code("2283638ea23d5477") How it ranno invocation recorded. |
| ablation_sampler | Not yet run unverified (harvested, no recorded run) |
ghliu/mdm/generate_watermark.py code served (permissive licence) · get_code("9fbf646e18eed1db") How it ranno invocation recorded. |
| build_ckpt_option | Not yet run unverified (harvested, no recorded run) |
ghliu/mdm/eval_constr_gen.py code served (permissive licence) · get_code("a888a5e028b6239e") How it ranno invocation recorded. |
| edm_sampler | Not yet run unverified (harvested, no recorded run) |
ghliu/mdm/generate_watermark.py code served (permissive licence) · get_code("8b16b0674af254db") How it ranno invocation recorded. |
| get_ref_x0 | Not yet run unverified (harvested, no recorded run) |
ghliu/mdm/eval_constr_gen.py code served (permissive licence) · get_code("d4f7521fb1839dd1") How it ranno invocation recorded. |
Of 6 samples lifted from this paper's linked repositories, 6 carry a function identity and 0 do not. Of the 6 distinct functions with an identity, 3 are also present in other papers whose code we hold (3 with at least one paper dated earlier, 3 the same month, 3 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 |
|---|---|---|---|
| parse_int_list | 37 other papers 10 dated earlier, 2 the same month, 25 later |
2206.00364 (2022-06) Elucidating the Design Space of Diffusion-Based Generative Models |
2302.00670 (2023-02) Stable Target Field for Reduced Variance Score Estimation in Diffusion Models 2302.04265 (2023-02) PFGM++: Unlocking the Potential of Physics-Inspired Generative Models and 34 more not named here |
| ablation_sampler | 12 other papers 3 dated earlier, 2 the same month, 7 later |
2206.00364 (2022-06) Elucidating the Design Space of Diffusion-Based Generative Models |
2207.12598 (2022-07) Classifier-Free Diffusion Guidance 2303.10137 (2023-03) A Recipe for Watermarking Diffusion Models and 9 more not named here |
| edm_sampler | 11 other papers 4 dated earlier, 1 the same month, 6 later |
2206.00364 (2022-06) Elucidating the Design Space of Diffusion-Based Generative Models |
2301.11445 (2023-01) 3DShape2VecSet: A 3D Shape Representation for Neural Fields and Generative Diffusion Models 2303.10137 (2023-03) A Recipe for Watermarking Diffusion Models and 8 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.
Modern successes of diffusion models in learning complex, high-dimensional data distributions are attributed, in part, to their capability to construct diffusion processes with analytic transition kernels and score functions. The tractability results in a simulation-free framework with stable regression losses, from which reversed, generative processes can be learned at scale. However, when data is confined to a constrained set as opposed to a standard Euclidean space, these desirable characteristics appear to be lost based on prior attempts. In this work, we propose Mirror Diffusion Models (MDM), a new class of diffusion models that generate data on convex constrained sets without losing any tractability. This is achieved by learning diffusion processes in a dual space constructed from a mirror map, which, crucially, is a standard Euclidean space. We derive efficient computation of mirror maps for popular constrained sets, such as simplices and ℓ 2 -balls, showing significantly improved performance of MDM over existing methods. For safety and privacy purposes, we also explore constrained sets as a new mechanism to embed invisible but quantitative information (i.e., watermarks) in generated data, for which MDM serves as a compelling approach. Our work brings new algorithmic opportunities for learning tractable diffusion on complex domains. Our code is available at https://github.com/ghliu/mdm.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2310.01236")
get_code_for_paper("2310.01236")
have("2310.01236")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2310.01236.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2310.01236)
Connect an agent — have() is free.