{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/get-schedule-jump","entry":"get_schedule_jump","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":5,"n_papers_ran":4,"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":3,"n_samples_ran":2,"n_samples_fingerprinted":1,"n_places":5,"n_places_pointer_only":2,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":2,"unverified":1},"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":"2405.10748","paper":"/paper/deep-data-consistency-a-fast-and-robust","title":"Deep Data Consistency: a Fast and Robust Diffusion Model-based Solver for Inverse Problems","date":"2024-05-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hanyu-chen373/deepdataconsistency","path":"guided_diffusion/diffusion.py","file_url":"https://github.com/hanyu-chen373/deepdataconsistency/blob/HEAD/guided_diffusion/diffusion.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b5af43562104feee","mcp_get_code":{"code_sha256":"b5af43562104feee"}},{"arxiv_id":"2312.16519","paper":"/paper/image-restoration-by-denoising-diffusion","title":"Image Restoration by Denoising Diffusion Models with Iteratively Preconditioned Guidance","date":"2023-12-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tirer-lab/ddpg","path":"functions/ddpg_scheme.py","file_url":"https://github.com/tirer-lab/ddpg/blob/HEAD/functions/ddpg_scheme.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b5af43562104feee","mcp_get_code":{"code_sha256":"b5af43562104feee"}},{"arxiv_id":"2312.11121","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/scheduler.py","file_url":"https://github.com/smartturb/repaint-turb/blob/HEAD/guided_diffusion/scheduler.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a8ebfffb7fe9ed69","mcp_get_code":{"code_sha256":"a8ebfffb7fe9ed69"}},{"arxiv_id":"2211.01324","paper":"/paper/ediffi-text-to-image-diffusion-models-with-an","title":"eDiff-I: Text-to-Image Diffusion Models with an Ensemble of Expert Denoisers","date":"2022-11-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cross-domain-compositing/cross-domain-compositing","path":"cdc/scheduler.py","file_url":"https://github.com/cross-domain-compositing/cross-domain-compositing/blob/HEAD/cdc/scheduler.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"aefaff0f568e5037","mcp_get_code":{"code_sha256":"aefaff0f568e5037"}},{"arxiv_id":"2201.09865","paper":"/paper/repaint-inpainting-using-denoising-diffusion","title":"RePaint: Inpainting using Denoising Diffusion Probabilistic Models","date":"2022-01-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"andreas128/RePaint","path":"guided_diffusion/gaussian_diffusion.py","file_url":"https://github.com/andreas128/RePaint/blob/HEAD/guided_diffusion/gaussian_diffusion.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"a8ebfffb7fe9ed69","mcp_get_code":{"code_sha256":"a8ebfffb7fe9ed69"}}]}