{"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/sde","entry":"SDE","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":8,"n_papers_ran":1,"n_papers_ran_no_instrument_failure":1,"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":8,"n_samples_ran":1,"n_samples_constructed":1,"n_samples_ran_checked":1,"n_samples_instrument":0,"n_samples_unverified":7,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":1,"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":1,"unverified":7},"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":"2602.10933","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-10933","title":"CMAD: Cooperative Multi-Agent Diffusion via Stochastic Optimal Control","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"rb876/multiagent-diffusion-soc","path":"src/trainer/soc_am_ft.py","file_url":"https://github.com/rb876/multiagent-diffusion-soc/blob/HEAD/src/trainer/soc_am_ft.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, rb876/multiagent-diffusion-soc when it was checked","code_sha256":"5666b720ec085d22","code_sha256_prefix":"5666b720ec085d22","mcp_get_code":{"code_sha256":"5666b720ec085d22"}},{"arxiv_id":"2312.10299","arxiv_id_is_arxiv":true,"paper":"/paper/image-restoration-through-generalized","title":"Image Restoration Through Generalized Ornstein-Uhlenbeck Bridge","date":"2023-12-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Hammour-steak/GOUB","path":"codes/utils/sde_utils.py","file_url":"https://github.com/Hammour-steak/GOUB/blob/HEAD/codes/utils/sde_utils.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":"47a0a9da39e6647e","code_sha256_prefix":"47a0a9da39e6647e","mcp_get_code":{"code_sha256":"47a0a9da39e6647e"}},{"arxiv_id":"2304.04740","arxiv_id_is_arxiv":true,"paper":"/paper/reflected-diffusion-models","title":"Reflected Diffusion Models","date":"2023-04-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"louaaron/Reflected-Diffusion","path":"sde_lib.py","file_url":"https://github.com/louaaron/Reflected-Diffusion/blob/HEAD/sde_lib.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":"780556bcf8cee495","code_sha256_prefix":"780556bcf8cee495","mcp_get_code":{"code_sha256":"780556bcf8cee495"}},{"arxiv_id":"2303.01748","arxiv_id_is_arxiv":true,"paper":"/paper/generative-diffusions-in-augmented-spaces-a","title":"A Complete Recipe for Diffusion Generative Models","date":"2023-03-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mandt-lab/PSLD","path":"main/models/sde/psld.py","file_url":"https://github.com/mandt-lab/PSLD/blob/HEAD/main/models/sde/psld.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":"b73524af8fa13564","code_sha256_prefix":"b73524af8fa13564","mcp_get_code":{"code_sha256":"b73524af8fa13564"}},{"arxiv_id":"2301.11699","arxiv_id_is_arxiv":true,"paper":"/paper/image-restoration-with-mean-reverting","title":"Image Restoration with Mean-Reverting Stochastic Differential Equations","date":"2023-01-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"algolzw/image-restoration-sde","path":"codes/utils/sde_utils.py","file_url":"https://github.com/algolzw/image-restoration-sde/blob/HEAD/codes/utils/sde_utils.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":"1ef2aeb0a0c5c0ec","code_sha256_prefix":"1ef2aeb0a0c5c0ec","mcp_get_code":{"code_sha256":"1ef2aeb0a0c5c0ec"}},{"arxiv_id":"2210.04872","arxiv_id_is_arxiv":true,"paper":"/paper/sequential-neural-score-estimation-likelihood","title":"Sequential Neural Score Estimation: Likelihood-Free Inference with Conditional Score Based Diffusion Models","date":"2022-10-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jacksimons15327/snpse_icml","path":"sde.py","file_url":"https://github.com/jacksimons15327/snpse_icml/blob/HEAD/sde.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":"892a7af6c12ca545","code_sha256_prefix":"892a7af6c12ca545","mcp_get_code":{"code_sha256":"892a7af6c12ca545"}},{"arxiv_id":"2206.00941","arxiv_id_is_arxiv":true,"paper":"/paper/improving-diffusion-models-for-inverse","title":"Improving Diffusion Models for Inverse Problems using Manifold Constraints","date":"2022-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hj-harry/mcg_diffusion","path":"sampling.py","file_url":"https://github.com/hj-harry/mcg_diffusion/blob/HEAD/sampling.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":"a339add524522cf7","code_sha256_prefix":"a339add524522cf7","mcp_get_code":{"code_sha256":"a339add524522cf7"}},{"arxiv_id":"1907.05600","arxiv_id_is_arxiv":true,"paper":"/paper/generative-modeling-by-estimating-gradients","title":"Generative Modeling by Estimating Gradients of the Data Distribution","date":"2019-07-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yang-song/score_sde_pytorch","path":"sde_lib.py","file_url":"https://github.com/yang-song/score_sde_pytorch/blob/HEAD/sde_lib.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":"2149b8836f88ca16","code_sha256_prefix":"2149b8836f88ca16","mcp_get_code":{"code_sha256":"2149b8836f88ca16"}}],"record_sha256":"405de61dadc44eca9cee77eefc1254e01fc08c61bd0b9a97cd956f8eb4a1b5ed","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}