Yue Deng, Zeyu Li, Hongkun Dou, Zike Chen, Hongjue Li, Lijun Yang
1 of 2 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; 1 failure of our instrument; 1 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/2603.01837.json · badge: /api/ran/2603.01837.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 |
|---|---|---|
| deng-ai-lab/CPS | canonical (classifier label) classifier basis: census |
1 ran · 1 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| ode_sampler | Ran ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT) |
deng-ai-lab/CPS/algo/aps_r.py code served (permissive licence) · get_code("5325fa3168c9423a") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned Tensor, ndim 2, dtype family float, shape (2, 4) as a later run recorded it. The image it ran in was not recorded. If your copy returns the same type, ndim and shape 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.
|
| create_model | Not yet run unverified (harvested, no recorded run) |
deng-ai-lab/CPS/models/ddpm.py code served (permissive licence) · get_code("1d13188fb0dd4a25") How it ranno invocation recorded. |
Of 2 samples lifted from this paper's linked repositories, 2 carry a function identity and 0 do not. Of the 2 distinct functions with an identity, 1 are also present in other papers whose code we hold (1 with at least one paper dated earlier, 0 the same month, 0 later) and 1 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 |
|---|---|---|---|
| create_model | 5 other papers 5 dated earlier |
2402.16907 (2024-02) Diffusion Posterior Proximal Sampling for Image Restoration |
2403.06054 (2024-03) Decoupled Data Consistency with Diffusion Purification for Image Restoration 2403.17042 (2024-03) Provably Robust Score-Based Diffusion Posterior Sampling for Plug-and-Play Image Reconstruction and 2 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.
Diffusion models have gained prominence as powerful generative tools for solving inverse problems due to their ability to model complex data distributions. However, existing methods typically rely on complete knowledge of the forward observation process to compute gradients for guided sampling, limiting their applicability in scenarios where such information is unavailable. In this work, we introduce Constrained Particle Seeking (CPS), a novel gradient-free approach that leverages all candidate particle information to actively search for the optimal particle while incorporating constraints aligned with high-density regions of the unconditional prior. Unlike previous methods that passively select promising candidates, CPS reformulates the inverse problem as a constrained optimization task, enabling more flexible and efficient particle seeking. We demonstrate that CPS can effectively solve both image and scientific inverse problems, achieving results comparable to gradient-based methods while significantly outperforming gradient-free alternatives. Code is available at https://github.com/deng-ai-lab/CPS.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2603.01837")
get_code_for_paper("2603.01837")
have("2603.01837")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2603.01837.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2603.01837)
Connect an agent — have() is free.