{"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/rescale-zero-terminal-snr","entry":"rescale_zero_terminal_snr","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":14,"n_papers_ran":14,"n_papers_ran_no_instrument_failure":1,"n_papers_ran_instrument_only":13,"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":6,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":5,"n_samples_unverified":0,"n_samples_fingerprinted":6,"n_places":14,"n_places_pointer_only":9,"n_places_pointer_only_link_open":3,"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":5,"ran_fixture":0,"ran":1,"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.18209","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-18209","title":"Rethinking Dataset Distillation for Classification: Do Distilled Sets Outperform Coresets?","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"jachansantiago/mode_guidance","path":"diffusers/src/diffusers/schedulers/scheduling_ddim_mode_guidance.py","file_url":"https://github.com/jachansantiago/mode_guidance/blob/HEAD/diffusers/src/diffusers/schedulers/scheduling_ddim_mode_guidance.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, jachansantiago/mode_guidance when it was checked","code_sha256":"bb350b00da2aea93","code_sha256_prefix":"bb350b00da2aea93","mcp_get_code":{"code_sha256":"bb350b00da2aea93"}},{"arxiv_id":"2504.15513","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2504.15513","date":null,"month_inferred_from_arxiv_id":"2025-04","title_source":null,"repo":"EternalEvan/InstaRevive","path":"diffusion/lcm_scheduler.py","file_url":"https://github.com/EternalEvan/InstaRevive/blob/HEAD/diffusion/lcm_scheduler.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"825af7863abcbfe2","code_sha256_prefix":"825af7863abcbfe2","mcp_get_code":{"code_sha256":"825af7863abcbfe2"}},{"arxiv_id":"2501.05803","arxiv_id_is_arxiv":true,"paper":"/paper/alignment-without-over-optimization-training","title":"Test-time Alignment of Diffusion Models without Reward Over-optimization","date":"2025-01-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"krafton-ai/DAS","path":"das/diffusers_patch/lcm_with_logprob.py","file_url":"https://github.com/krafton-ai/DAS/blob/HEAD/das/diffusers_patch/lcm_with_logprob.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6cef65ea9b3a0d85","code_sha256_prefix":"6cef65ea9b3a0d85","mcp_get_code":{"code_sha256":"6cef65ea9b3a0d85"}},{"arxiv_id":"2410.07659","arxiv_id_is_arxiv":true,"paper":"/paper/motionaura-generating-high-quality-and-motion","title":"MotionAura: Generating High-Quality and Motion Consistent Videos using Discrete Diffusion","date":"2024-10-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CandleLabAI/MotionAura-ICLR-2025","path":"src/diffusers/schedulers/scheduling_ddim_motionaura.py","file_url":"https://github.com/CandleLabAI/MotionAura-ICLR-2025/blob/HEAD/src/diffusers/schedulers/scheduling_ddim_motionaura.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4856ff8ee75aece7","code_sha256_prefix":"4856ff8ee75aece7","mcp_get_code":{"code_sha256":"4856ff8ee75aece7"}},{"arxiv_id":"2410.05677","arxiv_id_is_arxiv":true,"paper":"/paper/t2v-turbo-v2-enhancing-video-generation-model","title":"T2V-Turbo-v2: Enhancing Video Generation Model Post-Training through Data, Reward, and Conditional Guidance Design","date":"2024-10-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Ji4chenLi/t2v-turbo","path":"scheduler/t2v_turbo_scheduler.py","file_url":"https://github.com/Ji4chenLi/t2v-turbo/blob/HEAD/scheduler/t2v_turbo_scheduler.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Ji4chenLi/t2v-turbo when it was checked","code_sha256":"825af7863abcbfe2","code_sha256_prefix":"825af7863abcbfe2","mcp_get_code":{"code_sha256":"825af7863abcbfe2"}},{"arxiv_id":"2409.08258","arxiv_id_is_arxiv":true,"paper":"/paper/improving-virtual-try-on-with-garment-focused","title":"Improving Virtual Try-On with Garment-focused Diffusion Models","date":"2024-09-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"siqi0905/gardiff","path":"src/utils/DDIMSchdeduler.py","file_url":"https://github.com/siqi0905/gardiff/blob/HEAD/src/utils/DDIMSchdeduler.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, siqi0905/gardiff when it was checked","code_sha256":"6b47c0cd573d42ff","code_sha256_prefix":"6b47c0cd573d42ff","mcp_get_code":{"code_sha256":"6b47c0cd573d42ff"}},{"arxiv_id":"2409.01347","arxiv_id_is_arxiv":true,"paper":"/paper/target-driven-distillation-consistency","title":"Target-Driven Distillation: Consistency Distillation with Target Timestep Selection and Decoupled Guidance","date":"2024-09-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RedAIGC/Target-Driven-Distillation","path":"train/SD15/pcm_scheduling_ddpm_modified.py","file_url":"https://github.com/RedAIGC/Target-Driven-Distillation/blob/HEAD/train/SD15/pcm_scheduling_ddpm_modified.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, RedAIGC/Target-Driven-Distillation when it was checked","code_sha256":"6b47c0cd573d42ff","code_sha256_prefix":"6b47c0cd573d42ff","mcp_get_code":{"code_sha256":"6b47c0cd573d42ff"}},{"arxiv_id":"2406.07487","arxiv_id_is_arxiv":true,"paper":"/paper/glad-towards-better-reconstruction-with","title":"GLAD: Towards Better Reconstruction with Global and Local Adaptive Diffusion Models for Unsupervised Anomaly Detection","date":"2024-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hyao1/glad","path":"ddim_scheduling.py","file_url":"https://github.com/hyao1/glad/blob/HEAD/ddim_scheduling.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from siqi0905/gardiff, and GitHub detected no licence in that repository when it was checked","code_sha256":"6b47c0cd573d42ff","code_sha256_prefix":"6b47c0cd573d42ff","mcp_get_code":{"code_sha256":"6b47c0cd573d42ff"}},{"arxiv_id":"2405.17149","arxiv_id_is_arxiv":true,"paper":"/paper/lcm-locally-constrained-compact-point-cloud","title":"LCM: Locally Constrained Compact Point Cloud Model for Masked Point Modeling","date":"2024-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"0xbitches/sd-webui-lcm","path":"lcm/lcm_i2i_pipeline.py","file_url":"https://github.com/0xbitches/sd-webui-lcm/blob/HEAD/lcm/lcm_i2i_pipeline.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"825af7863abcbfe2","code_sha256_prefix":"825af7863abcbfe2","mcp_get_code":{"code_sha256":"825af7863abcbfe2"}},{"arxiv_id":"2404.16767","arxiv_id_is_arxiv":true,"paper":"/paper/rebel-reinforcement-learning-via-regressing","title":"REBEL: Reinforcement Learning via Regressing Relative Rewards","date":"2024-04-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Owen-Oertell/rlcm","path":"lcm_rl_pytorch/diffusers_patch/lcm_scheduler.py","file_url":"https://github.com/Owen-Oertell/rlcm/blob/HEAD/lcm_rl_pytorch/diffusers_patch/lcm_scheduler.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, Owen-Oertell/rlcm when it was checked","code_sha256":"64b2196de5dcf1e5","code_sha256_prefix":"64b2196de5dcf1e5","mcp_get_code":{"code_sha256":"64b2196de5dcf1e5"}},{"arxiv_id":"2404.06025","arxiv_id_is_arxiv":true,"paper":"/paper/greedy-dim-greedy-algorithms-for-unreasonably","title":"Greedy-DiM: Greedy Algorithms for Unreasonably Effective Face Morphs","date":"2024-04-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zblasingame/Greedy-DiM","path":"scheduler.py","file_url":"https://github.com/zblasingame/Greedy-DiM/blob/HEAD/scheduler.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"825af7863abcbfe2","code_sha256_prefix":"825af7863abcbfe2","mcp_get_code":{"code_sha256":"825af7863abcbfe2"}},{"arxiv_id":"2403.14468","arxiv_id_is_arxiv":true,"paper":"/paper/anyv2v-a-plug-and-play-framework-for-any","title":"AnyV2V: A Tuning-Free Framework For Any Video-to-Video Editing Tasks","date":"2024-03-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tiger-ai-lab/anyv2v","path":"consisti2v/ddim_inverse_scheduler.py","file_url":"https://github.com/tiger-ai-lab/anyv2v/blob/HEAD/consisti2v/ddim_inverse_scheduler.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from siqi0905/gardiff, and GitHub detected no licence in that repository when it was checked","code_sha256":"6b47c0cd573d42ff","code_sha256_prefix":"6b47c0cd573d42ff","mcp_get_code":{"code_sha256":"6b47c0cd573d42ff"}},{"arxiv_id":"2311.18832","arxiv_id_is_arxiv":true,"paper":"/paper/exploiting-diffusion-prior-for-generalizable","title":"Exploiting Diffusion Prior for Generalizable Dense Prediction","date":"2023-11-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shinying/dmp","path":"ddim.py","file_url":"https://github.com/shinying/dmp/blob/HEAD/ddim.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from siqi0905/gardiff, and GitHub detected no licence in that repository when it was checked","code_sha256":"6b47c0cd573d42ff","code_sha256_prefix":"6b47c0cd573d42ff","mcp_get_code":{"code_sha256":"6b47c0cd573d42ff"}},{"arxiv_id":"2303.01469","arxiv_id_is_arxiv":true,"paper":"/paper/consistency-models","title":"Consistency Models","date":"2023-03-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jabir-zheng/TCD","path":"scheduling_tcd.py","file_url":"https://github.com/jabir-zheng/TCD/blob/HEAD/scheduling_tcd.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, jabir-zheng/TCD when it was checked","code_sha256":"64b2196de5dcf1e5","code_sha256_prefix":"64b2196de5dcf1e5","mcp_get_code":{"code_sha256":"64b2196de5dcf1e5"}}],"record_sha256":"7aa507fc9aeddd3dbb6a926c8490457b395454798a2082d937f8618c1f24414c","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}