{"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/create-classifier-and-diffusion","entry":"create_classifier_and_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":11,"n_papers_ran":0,"n_papers_ran_no_instrument_failure":0,"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":2,"n_samples_ran":0,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":0,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":11,"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":0,"unverified":2},"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":"2512.03430","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2512-03430","title":"Label-Efficient Hyperspectral Image Classification via Spectral FiLM Modulation of Low-Level Pretrained Diffusion Features","date":null,"month_inferred_from_arxiv_id":"2025-12","title_source":"syntology","repo":"openai/guided-diffusion","path":"guided_diffusion/script_util.py","file_url":"https://github.com/openai/guided-diffusion/blob/HEAD/guided_diffusion/script_util.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":"5e5d99a81705a07f","code_sha256_prefix":"5e5d99a81705a07f","mcp_get_code":{"code_sha256":"5e5d99a81705a07f"}},{"arxiv_id":"2511.05844","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2511-05844","title":"Enhancing Diffusion Model Guidance through Calibration and Regularization","date":null,"month_inferred_from_arxiv_id":"2025-11","title_source":"syntology","repo":"ajavid34/guided-info-diffusion","path":"guided_diffusion/script_util.py","file_url":"https://github.com/ajavid34/guided-info-diffusion/blob/HEAD/guided_diffusion/script_util.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, ajavid34/guided-info-diffusion when it was checked","code_sha256":"5e5d99a81705a07f","code_sha256_prefix":"5e5d99a81705a07f","mcp_get_code":{"code_sha256":"5e5d99a81705a07f"}},{"arxiv_id":"2402.16991","arxiv_id_is_arxiv":true,"paper":"/paper/a-phase-transition-in-diffusion-models","title":"A Phase Transition in Diffusion Models Reveals the Hierarchical Nature of Data","date":"2024-02-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pcsl-epfl/forward-backward-diffusion","path":"guided_diffusion/script_util.py","file_url":"https://github.com/pcsl-epfl/forward-backward-diffusion/blob/HEAD/guided_diffusion/script_util.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":"5e5d99a81705a07f","code_sha256_prefix":"5e5d99a81705a07f","mcp_get_code":{"code_sha256":"5e5d99a81705a07f"}},{"arxiv_id":"2312.11121","arxiv_id_is_arxiv":true,"paper":"/paper/multi-scale-reconstruction-of-turbulent","title":"Multi-scale Reconstruction of Turbulent Rotating Flows with Generative Diffusion Models","date":null,"month_inferred_from_arxiv_id":"2023-12","title_source":"archive","repo":"smartturb/repaint-turb","path":"guided_diffusion/script_util.py","file_url":"https://github.com/smartturb/repaint-turb/blob/HEAD/guided_diffusion/script_util.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":"5e5d99a81705a07f","code_sha256_prefix":"5e5d99a81705a07f","mcp_get_code":{"code_sha256":"5e5d99a81705a07f"}},{"arxiv_id":"2307.08529","arxiv_id_is_arxiv":true,"paper":"/paper/synthetic-lagrangian-turbulence-by-generative","title":"Synthetic Lagrangian Turbulence by Generative Diffusion Models","date":"2023-07-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"smartturb/diffusion-lagr","path":"guided_diffusion/script_util.py","file_url":"https://github.com/smartturb/diffusion-lagr/blob/HEAD/guided_diffusion/script_util.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":"5e5d99a81705a07f","code_sha256_prefix":"5e5d99a81705a07f","mcp_get_code":{"code_sha256":"5e5d99a81705a07f"}},{"arxiv_id":"2306.00501","arxiv_id_is_arxiv":true,"paper":"/paper/image-generation-with-shortest-path-diffusion","title":"Image generation with shortest path diffusion","date":"2023-06-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mtkresearch/shortest-path-diffusion","path":"guided_diffusion/script_util.py","file_url":"https://github.com/mtkresearch/shortest-path-diffusion/blob/HEAD/guided_diffusion/script_util.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":"654fcd52f4d13f0e","code_sha256_prefix":"654fcd52f4d13f0e","mcp_get_code":{"code_sha256":"654fcd52f4d13f0e"}},{"arxiv_id":"2304.12824","arxiv_id_is_arxiv":true,"paper":"/paper/contrastive-energy-prediction-for-exact","title":"Contrastive Energy Prediction for Exact Energy-Guided Diffusion Sampling in Offline Reinforcement Learning","date":"2023-04-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thu-ml/cep-energy-guided-diffusion","path":"images/guided_diffusion/script_util.py","file_url":"https://github.com/thu-ml/cep-energy-guided-diffusion/blob/HEAD/images/guided_diffusion/script_util.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":"5e5d99a81705a07f","code_sha256_prefix":"5e5d99a81705a07f","mcp_get_code":{"code_sha256":"5e5d99a81705a07f"}},{"arxiv_id":"2212.00490","arxiv_id_is_arxiv":true,"paper":"/paper/zero-shot-image-restoration-using-denoising","title":"Zero-Shot Image Restoration Using Denoising Diffusion Null-Space Model","date":"2022-12-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ipc-lab/deepjscc-diffusion","path":"guided_diffusion/script_util.py","file_url":"https://github.com/ipc-lab/deepjscc-diffusion/blob/HEAD/guided_diffusion/script_util.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":"5e5d99a81705a07f","code_sha256_prefix":"5e5d99a81705a07f","mcp_get_code":{"code_sha256":"5e5d99a81705a07f"}},{"arxiv_id":"2206.10550","arxiv_id_is_arxiv":true,"paper":"/paper/certified-adversarial-robustness-for-free","title":"(Certified!!) Adversarial Robustness for Free!","date":"2022-06-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ethz-privsec/diffusion_denoised_smoothing","path":"imagenet/guided_diffusion/script_util.py","file_url":"https://github.com/ethz-privsec/diffusion_denoised_smoothing/blob/HEAD/imagenet/guided_diffusion/script_util.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":"5e5d99a81705a07f","code_sha256_prefix":"5e5d99a81705a07f","mcp_get_code":{"code_sha256":"5e5d99a81705a07f"}},{"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":"gzhu06/MCG-ipynb","path":"guided_diffusion/script_util.py","file_url":"https://github.com/gzhu06/MCG-ipynb/blob/HEAD/guided_diffusion/script_util.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":"5e5d99a81705a07f","code_sha256_prefix":"5e5d99a81705a07f","mcp_get_code":{"code_sha256":"5e5d99a81705a07f"}},{"arxiv_id":"2111.14818","arxiv_id_is_arxiv":true,"paper":"/paper/blended-diffusion-for-text-driven-editing-of","title":"Blended Diffusion for Text-driven Editing of Natural Images","date":"2021-11-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"omriav/blended-diffusion","path":"guided_diffusion/guided_diffusion/script_util.py","file_url":"https://github.com/omriav/blended-diffusion/blob/HEAD/guided_diffusion/guided_diffusion/script_util.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":"5e5d99a81705a07f","code_sha256_prefix":"5e5d99a81705a07f","mcp_get_code":{"code_sha256":"5e5d99a81705a07f"}}],"record_sha256":"49e778e4ed9367237b6d2c89ddb543e21e6f2816460ed5a7c87fe603b3a3bfb8","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}