Chenyou Fan, Yang Zhang, Chenjia Bai, Zhen Wang, Haoran He, Zhao Shan
None of the 3 samples (functions and classes) lifted from this paper's linked repositories has a recorded run on a synthesized input (3 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/2409.19949.json · badge: /api/ran/2409.19949.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 |
|---|---|---|
| CleanDiffuserTeam/CleanDiffuser | community Papers with Code archive |
0 ran · 3 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| BaseNNDiffusion | Not yet run unverified (harvested, no recorded run) |
CleanDiffuserTeam/CleanDiffuser/cleandiffuser/nn_diffusion/chiunet.py code served (permissive licence) · get_code("a7c0e2518175d2a6") How it ranno invocation recorded. |
| ChiResidualBlock | Not yet run unverified (harvested, no recorded run) |
CleanDiffuserTeam/CleanDiffuser/cleandiffuser/nn_diffusion/chiunet.py code served (permissive licence) · get_code("c2f07491c8b8ffbc") How it ranno invocation recorded. |
| ChiUNet1d | Not yet run unverified (harvested, no recorded run) |
CleanDiffuserTeam/CleanDiffuser/cleandiffuser/nn_diffusion/chiunet.py code served (permissive licence) · get_code("372acafff70f4048") How it ranno 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, 1 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 1 later) and 2 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 |
|---|---|---|---|
| BaseNNDiffusion brick of this paper's assembly: helper |
1 other paper 1 later |
2603.04910 (2026-03) VPWEM: Non-Markovian Visuomotor Policy with Working and Episodic Memory |
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 demonstrated their capabilities in modeling trajectories of multi-tasks. However, existing multi-task planners or policies typically rely on task-specific demonstrations via multi-task imitation, or require task-specific reward labels to facilitate policy optimization via Reinforcement Learning (RL). They are costly due to the substantial human efforts required to collect expert data or design reward functions. To address these challenges, we aim to develop a versatile diffusion planner capable of leveraging large-scale inferior data that contains taskagnostic sub-optimal trajectories, with the ability to fast adapt to specific tasks. In this paper, we propose SODP, a two-stage framework that leverages Sub-Optimal data to learn a Diffusion Planner, which is generalizable for various downstream tasks. Specifically, in the pre-training stage, we train a foundation diffusion planner that extracts general planning capabilities by modeling the versatile distribution of multi-task trajectories, which can be sub-optimal and has wide data coverage. Then for downstream tasks, we adopt RLbased fine-tuning with task-specific rewards to quickly refine the diffusion planner, which aims to generate action sequences with higher taskspecific returns. Experimental results from multitask domains including Meta-World and Adroit demonstrate that SODP outperforms state-of-theart methods with only a small amount of data for reward-guided fine-tuning.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2409.19949")
get_code_for_paper("2409.19949")
have("2409.19949")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2409.19949.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2409.19949)
Connect an agent — have() is free.