{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/code/ddpm-schedules","entry":"ddpm_schedules","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":7,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":5,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":5,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":3,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":7,"n_places_pointer_only":3,"n_places_pointer_only_link_open":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":3,"ran_fixture":0,"ran":2,"unverified":0},"key_notes":{"n_samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2606.07640","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-07640","title":"No Free Lunch for Synthetic Images under Data Scarcity Conditions","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"BorjaArroyo/synthetic-images-tradeoff","path":"src/models/diffusion.py","file_url":"https://github.com/BorjaArroyo/synthetic-images-tradeoff/blob/HEAD/src/models/diffusion.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"33b2216aa8cbe047","code_sha256_prefix":"33b2216aa8cbe047","mcp_get_code":{"code_sha256":"33b2216aa8cbe047"}},{"arxiv_id":"2402.19009","arxiv_id_is_arxiv":true,"paper":"/paper/generating-reconstructing-and-representing","title":"Unified Generation, Reconstruction, and Representation: Generalized Diffusion with Adaptive Latent Encoding-Decoding","date":"2024-02-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"guangyliu/eddpm","path":"Protein/codes/nn/models.py","file_url":"https://github.com/guangyliu/eddpm/blob/HEAD/Protein/codes/nn/models.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, guangyliu/eddpm when it was checked","code_sha256":"30750d439887db4d","code_sha256_prefix":"30750d439887db4d","mcp_get_code":{"code_sha256":"30750d439887db4d"}},{"arxiv_id":"2309.06599","arxiv_id_is_arxiv":true,"paper":"/paper/reasoning-with-latent-diffusion-in-offline","title":"Reasoning with Latent Diffusion in Offline Reinforcement Learning","date":"2023-09-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ldcq/ldcq","path":"models/diffusion_models.py","file_url":"https://github.com/ldcq/ldcq/blob/HEAD/models/diffusion_models.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, ldcq/ldcq when it was checked","code_sha256":"72d8b48972f1b220","code_sha256_prefix":"72d8b48972f1b220","mcp_get_code":{"code_sha256":"72d8b48972f1b220"}},{"arxiv_id":"2307.11122","arxiv_id_is_arxiv":true,"paper":"/paper/diffusion-models-for-probabilistic","title":"Diffusion Models for Probabilistic Deconvolution of Galaxy Images","date":"2023-07-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"teapearce/conditional_diffusion_mnist","path":"script.py","file_url":"https://github.com/teapearce/conditional_diffusion_mnist/blob/HEAD/script.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1c539f5aa6ca79d2","code_sha256_prefix":"1c539f5aa6ca79d2","mcp_get_code":{"code_sha256":"1c539f5aa6ca79d2"}},{"arxiv_id":"2301.10677","arxiv_id_is_arxiv":true,"paper":"/paper/imitating-human-behaviour-with-diffusion","title":"Imitating Human Behaviour with Diffusion Models","date":"2023-01-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/imitating-human-behaviour-w-diffusion","path":"code/models.py","file_url":"https://github.com/microsoft/imitating-human-behaviour-w-diffusion/blob/HEAD/code/models.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9a16e3abe84897af","code_sha256_prefix":"9a16e3abe84897af","mcp_get_code":{"code_sha256":"9a16e3abe84897af"}},{"arxiv_id":"2212.08228","arxiv_id_is_arxiv":true,"paper":"/paper/sadm-sequence-aware-diffusion-model-for","title":"SADM: Sequence-Aware Diffusion Model for Longitudinal Medical Image Generation","date":"2022-12-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ubc-tea/sadm-longitudinal-medical-image-generation","path":"DDPM/ddpm.py","file_url":"https://github.com/ubc-tea/sadm-longitudinal-medical-image-generation/blob/HEAD/DDPM/ddpm.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1c539f5aa6ca79d2","code_sha256_prefix":"1c539f5aa6ca79d2","mcp_get_code":{"code_sha256":"1c539f5aa6ca79d2"}},{"arxiv_id":"2207.12598","arxiv_id_is_arxiv":true,"paper":"/paper/classifier-free-diffusion-guidance","title":"Classifier-Free Diffusion Guidance","date":"2022-07-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"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","code_sha256":"1c539f5aa6ca79d2","code_sha256_prefix":"1c539f5aa6ca79d2","mcp_get_code":{"code_sha256":"1c539f5aa6ca79d2"}}],"record_sha256":"113f8e96a0346a0a4a5a598f983b26e4f1c28ac378328bdb291b2cc78f033fd7","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}