{"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/diffusion","entry":"Diffusion","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":21,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":9,"n_papers_ran_instrument_only":0,"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":24,"n_samples_ran":9,"n_samples_constructed":5,"n_samples_ran_checked":9,"n_samples_instrument":0,"n_samples_unverified":15,"n_samples_fingerprinted":2,"n_places":24,"n_places_pointer_only":11,"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":0,"ran_fixture":0,"ran":9,"unverified":15},"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":"2603.17685","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-17685","title":"Flow Matching Policy Optimization with Mirror Descent and Entropy Constraints","date":"2026-03-18","month_inferred_from_arxiv_id":null,"title_source":"syntology","repo":"wadx2019/qvpo","path":"agent/qvpo.py","file_url":"https://github.com/wadx2019/qvpo/blob/HEAD/agent/qvpo.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":"0c81dda4b2c07710","code_sha256_prefix":"0c81dda4b2c07710","mcp_get_code":{"code_sha256":"0c81dda4b2c07710"}},{"arxiv_id":"2602.03564","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-03564","title":"CoGenCast: A Coupled Autoregressive-Flow Generative Framework for Time Series Forecasting","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"liuyaguo/_CoGenCast","path":"models/CoGenCast.py","file_url":"https://github.com/liuyaguo/_CoGenCast/blob/HEAD/models/CoGenCast.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, liuyaguo/_CoGenCast when it was checked","code_sha256":"d77041fe1fe65e0a","code_sha256_prefix":"d77041fe1fe65e0a","mcp_get_code":{"code_sha256":"d77041fe1fe65e0a"}},{"arxiv_id":"2510.11499","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-11499","title":"Offline Reinforcement Learning with Generative Trajectory Policies","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"wmd3i/gtp","path":"agents/diffusion.py","file_url":"https://github.com/wmd3i/gtp/blob/HEAD/agents/diffusion.py","status":"unverified","verification_level":0,"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, wmd3i/gtp when it was checked","code_sha256":"7c3e00ce2a276ede","code_sha256_prefix":"7c3e00ce2a276ede","mcp_get_code":{"code_sha256":"7c3e00ce2a276ede"}},{"arxiv_id":"2506.08065","arxiv_id_is_arxiv":true,"paper":"/paper/2506-08065","title":"Dynamic Diffusion Schrödinger Bridge in Astrophysical Observational Inversions","date":"2025-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"l-yezhu/astrodsb","path":"astrodsb/diffusion.py","file_url":"https://github.com/l-yezhu/astrodsb/blob/HEAD/astrodsb/diffusion.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, l-yezhu/astrodsb when it was checked","code_sha256":"8665f6b8da99e925","code_sha256_prefix":"8665f6b8da99e925","mcp_get_code":{"code_sha256":"8665f6b8da99e925"}},{"arxiv_id":"2505.17384","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2505.17384","date":null,"month_inferred_from_arxiv_id":"2025-05","title_source":null,"repo":"tyuxie/VADD","path":"diffusion.py","file_url":"https://github.com/tyuxie/VADD/blob/HEAD/diffusion.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d28ee60c0642bfdb","code_sha256_prefix":"d28ee60c0642bfdb","mcp_get_code":{"code_sha256":"d28ee60c0642bfdb"}},{"arxiv_id":"2503.00307","arxiv_id_is_arxiv":true,"paper":"/paper/remasking-discrete-diffusion-models-with","title":"Remasking Discrete Diffusion Models with Inference-Time Scaling","date":"2025-03-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kuleshov-group/remdm","path":"diffusion.py","file_url":"https://github.com/kuleshov-group/remdm/blob/HEAD/diffusion.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2c650372d2d0b176","code_sha256_prefix":"2c650372d2d0b176","mcp_get_code":{"code_sha256":"2c650372d2d0b176"}},{"arxiv_id":"2410.05711","arxiv_id_is_arxiv":true,"paper":"/paper/diffusion-auto-regressive-transformer-for","title":"Diffusion Auto-regressive Transformer for Effective Self-supervised Time Series Forecasting","date":"2024-10-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"melmaphother/timedart","path":"models/TimeDART.py","file_url":"https://github.com/melmaphother/timedart/blob/HEAD/models/TimeDART.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, melmaphother/timedart when it was checked","code_sha256":"d270abcd0d744a53","code_sha256_prefix":"d270abcd0d744a53","mcp_get_code":{"code_sha256":"d270abcd0d744a53"}},{"arxiv_id":"2404.10688","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-conditional-diffusion-model-with","title":"Efficient Conditional Diffusion Model with Probability Flow Sampling for Image Super-resolution","date":"2024-04-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Yuan-Yutao/ECDP","path":"lib/model/ecdp.py","file_url":"https://github.com/Yuan-Yutao/ECDP/blob/HEAD/lib/model/ecdp.py","status":"unverified","verification_level":0,"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, Yuan-Yutao/ECDP when it was checked","code_sha256":"2716ca1085de9966","code_sha256_prefix":"2716ca1085de9966","mcp_get_code":{"code_sha256":"2716ca1085de9966"}},{"arxiv_id":"2403.02867","arxiv_id_is_arxiv":true,"paper":"/paper/scalable-continuous-time-diffusion-framework","title":"Scalable Continuous-time Diffusion Framework for Network Inference and Influence Estimation","date":"2024-03-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kkhuang81/FIM","path":"Diffusion.py","file_url":"https://github.com/kkhuang81/FIM/blob/HEAD/Diffusion.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4db98ba562a83535","code_sha256_prefix":"4db98ba562a83535","mcp_get_code":{"code_sha256":"4db98ba562a83535"}},{"arxiv_id":"2402.04754","arxiv_id_is_arxiv":true,"paper":"/paper/towards-aligned-layout-generation-via","title":"Towards Aligned Layout Generation via Diffusion Model with Aesthetic Constraints","date":"2024-02-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"puar-playground/lace","path":"model_diffusion.py","file_url":"https://github.com/puar-playground/lace/blob/HEAD/model_diffusion.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"efd5ffb686bfb773","code_sha256_prefix":"efd5ffb686bfb773","mcp_get_code":{"code_sha256":"efd5ffb686bfb773"}},{"arxiv_id":"2310.05333","arxiv_id_is_arxiv":true,"paper":"/paper/diffcps-diffusion-model-based-constrained","title":"DiffCPS: Diffusion Model based Constrained Policy Search for Offline Reinforcement Learning","date":"2023-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"felix-thu/DiffCPS","path":"agents/diffcps.py","file_url":"https://github.com/felix-thu/DiffCPS/blob/HEAD/agents/diffcps.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ead7aeb95e87333f","code_sha256_prefix":"ead7aeb95e87333f","mcp_get_code":{"code_sha256":"ead7aeb95e87333f"}},{"arxiv_id":"2305.19518","arxiv_id_is_arxiv":true,"paper":"/paper/label-retrieval-augmented-diffusion-models-1","title":"Label-Retrieval-Augmented Diffusion Models for Learning from Noisy Labels","date":"2023-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"puar-playground/lra-diffusion","path":"model_diffusion.py","file_url":"https://github.com/puar-playground/lra-diffusion/blob/HEAD/model_diffusion.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2d12f1aeca8d130b","code_sha256_prefix":"2d12f1aeca8d130b","mcp_get_code":{"code_sha256":"2d12f1aeca8d130b"}},{"arxiv_id":"2303.09867","arxiv_id_is_arxiv":true,"paper":"/paper/diffusionret-generative-text-video-retrieval","title":"DiffusionRet: Generative Text-Video Retrieval with Diffusion Model","date":"2023-03-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jpthu17/DiffusionRet","path":"DiffusionRet/models/modeling.py","file_url":"https://github.com/jpthu17/DiffusionRet/blob/HEAD/DiffusionRet/models/modeling.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"862a183cbe47818a","code_sha256_prefix":"862a183cbe47818a","mcp_get_code":{"code_sha256":"862a183cbe47818a"}},{"arxiv_id":"2303.05754","arxiv_id_is_arxiv":true,"paper":"/paper/fast-diffusion-sampler-for-inverse-problems","title":"Decomposed Diffusion Sampler for Accelerating Large-Scale Inverse Problems","date":"2023-03-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hj-harry/dds","path":"solver_2d.py","file_url":"https://github.com/hj-harry/dds/blob/HEAD/solver_2d.py","status":"unverified","verification_level":0,"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, hj-harry/dds when it was checked","code_sha256":"14da7a4d709b89ba","code_sha256_prefix":"14da7a4d709b89ba","mcp_get_code":{"code_sha256":"14da7a4d709b89ba"}},{"arxiv_id":"2302.05872","arxiv_id_is_arxiv":true,"paper":"/paper/i-2-sb-image-to-image-schrodinger-bridge","title":"I$^2$SB: Image-to-Image Schrödinger Bridge","date":"2023-02-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nvlabs/i2sb","path":"i2sb/diffusion.py","file_url":"https://github.com/nvlabs/i2sb/blob/HEAD/i2sb/diffusion.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, nvlabs/i2sb (NOASSERTION)","code_sha256":"de2ed651b275f412","code_sha256_prefix":"de2ed651b275f412","mcp_get_code":{"code_sha256":"de2ed651b275f412"}},{"arxiv_id":"2302.05872","arxiv_id_is_arxiv":true,"paper":"/paper/i-2-sb-image-to-image-schrodinger-bridge","title":"I$^2$SB: Image-to-Image Schrödinger Bridge","date":"2023-02-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sobieskibj/rcsb","path":"src/inpainters/src_cddb/i2sb/diffusion.py","file_url":"https://github.com/sobieskibj/rcsb/blob/HEAD/src/inpainters/src_cddb/i2sb/diffusion.py","status":"unverified","verification_level":0,"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, sobieskibj/rcsb when it was checked","code_sha256":"aa50df59644ec392","code_sha256_prefix":"aa50df59644ec392","mcp_get_code":{"code_sha256":"aa50df59644ec392"}},{"arxiv_id":"2209.14687","arxiv_id_is_arxiv":true,"paper":"/paper/diffusion-posterior-sampling-for-general","title":"Diffusion Posterior Sampling for General Noisy Inverse Problems","date":"2022-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alexdenker/SteerableConditionalDiffusion","path":"algos/dps.py","file_url":"https://github.com/alexdenker/SteerableConditionalDiffusion/blob/HEAD/algos/dps.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":"a9220fd383044f44","code_sha256_prefix":"a9220fd383044f44","mcp_get_code":{"code_sha256":"a9220fd383044f44"}},{"arxiv_id":"2208.06193","arxiv_id_is_arxiv":true,"paper":"/paper/diffusion-policies-as-an-expressive-policy","title":"Diffusion Policies as an Expressive Policy Class for Offline Reinforcement Learning","date":"2022-08-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhendong-wang/diffusion-policies-for-offline-rl","path":"agents/ql_diffusion.py","file_url":"https://github.com/zhendong-wang/diffusion-policies-for-offline-rl/blob/HEAD/agents/ql_diffusion.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a8e86dce13aa99a1","code_sha256_prefix":"a8e86dce13aa99a1","mcp_get_code":{"code_sha256":"a8e86dce13aa99a1"}},{"arxiv_id":"2208.06193","arxiv_id_is_arxiv":true,"paper":"/paper/diffusion-policies-as-an-expressive-policy","title":"Diffusion Policies as an Expressive Policy Class for Offline Reinforcement Learning","date":"2022-08-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"quantumiracle/consistency_model_for_reinforcement_learning","path":"agents/ql_diffusion.py","file_url":"https://github.com/quantumiracle/consistency_model_for_reinforcement_learning/blob/HEAD/agents/ql_diffusion.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"49c674376f6d739f","code_sha256_prefix":"49c674376f6d739f","mcp_get_code":{"code_sha256":"49c674376f6d739f"}},{"arxiv_id":"2208.04202","arxiv_id_is_arxiv":true,"paper":"/paper/analog-bits-generating-discrete-data-using","title":"Analog Bits: Generating Discrete Data using Diffusion Models with Self-Conditioning","date":"2022-08-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pinellolab/dna-diffusion","path":"src/dnadiffusion/models/diffusion.py","file_url":"https://github.com/pinellolab/dna-diffusion/blob/HEAD/src/dnadiffusion/models/diffusion.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, pinellolab/dna-diffusion (NOASSERTION)","code_sha256":"973a3cc89e5b7ca1","code_sha256_prefix":"973a3cc89e5b7ca1","mcp_get_code":{"code_sha256":"973a3cc89e5b7ca1"}},{"arxiv_id":"2206.07275","arxiv_id_is_arxiv":true,"paper":"/paper/card-classification-and-regression-diffusion","title":"CARD: Classification and Regression Diffusion Models","date":"2022-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xzwhan/card","path":"classification/card_classification.py","file_url":"https://github.com/xzwhan/card/blob/HEAD/classification/card_classification.py","status":"unverified","verification_level":0,"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, xzwhan/card when it was checked","code_sha256":"49e539a2dd5a5efd","code_sha256_prefix":"49e539a2dd5a5efd","mcp_get_code":{"code_sha256":"49e539a2dd5a5efd"}},{"arxiv_id":"2006.11239","arxiv_id_is_arxiv":true,"paper":"/paper/denoising-diffusion-probabilistic-models","title":"Denoising Diffusion Probabilistic Models","date":"2020-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tcapelle/Diffusion-Models-pytorch","path":"ddpm.py","file_url":"https://github.com/tcapelle/Diffusion-Models-pytorch/blob/HEAD/ddpm.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c7b63e5eb0b6e746","code_sha256_prefix":"c7b63e5eb0b6e746","mcp_get_code":{"code_sha256":"c7b63e5eb0b6e746"}},{"arxiv_id":"2006.11239","arxiv_id_is_arxiv":true,"paper":"/paper/denoising-diffusion-probabilistic-models","title":"Denoising Diffusion Probabilistic Models","date":"2020-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KiUngSong/Generative-Models","path":"DDPM/DDPM_pytorch.py","file_url":"https://github.com/KiUngSong/Generative-Models/blob/HEAD/DDPM/DDPM_pytorch.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"69ee580d5f7fc416","code_sha256_prefix":"69ee580d5f7fc416","mcp_get_code":{"code_sha256":"69ee580d5f7fc416"}},{"arxiv_id":"1612.01474","arxiv_id_is_arxiv":true,"paper":"/paper/simple-and-scalable-predictive-uncertainty","title":"Simple and Scalable Predictive Uncertainty Estimation using Deep Ensembles","date":"2016-12-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Junghwan-brian/SDE-Net","path":"model/SDENet.py","file_url":"https://github.com/Junghwan-brian/SDE-Net/blob/HEAD/model/SDENet.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, Junghwan-brian/SDE-Net when it was checked","code_sha256":"59b274fed1c2f7d5","code_sha256_prefix":"59b274fed1c2f7d5","mcp_get_code":{"code_sha256":"59b274fed1c2f7d5"}}],"record_sha256":"aa4a05dd744abe16b10bdbd936c1c81550f7bee304d1f4e5d91e3ef4566ac1e7","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}