{"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/quadratic-beta-schedule","entry":"quadratic_beta_schedule","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":9,"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":5,"n_samples_ran":2,"n_samples_fingerprinted":2,"n_places":9,"n_places_pointer_only":1,"by_status":{"ran_honours":1,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"unverified":3},"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.07289","paper":"/paper/arxiv-2512-07289","title":"Equivariant Diffusion for Crystal Structure Prediction","date":null,"month_inferred_from_arxiv_id":"2025-12","title_source":"syntology","repo":"EmperorJia/EquiCSP","path":"equicsp/pl_modules/diff_utils.py","file_url":"https://github.com/EmperorJia/EquiCSP/blob/HEAD/equicsp/pl_modules/diff_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f9097d641770f184","mcp_get_code":{"code_sha256":"f9097d641770f184"}},{"arxiv_id":"2503.00522","paper":"/paper/periodic-materials-generation-using-text","title":"Periodic Materials Generation using Text-Guided Joint Diffusion Model","date":"2025-03-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kdmsit/TGDMat","path":"csp_task/model/diff_utils.py","file_url":"https://github.com/kdmsit/TGDMat/blob/HEAD/csp_task/model/diff_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f9097d641770f184","mcp_get_code":{"code_sha256":"f9097d641770f184"}},{"arxiv_id":"2403.17259","paper":"/paper/diffusion-based-negative-sampling-on-graphs","title":"Diffusion-based Negative Sampling on Graphs for Link Prediction","date":"2024-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ntkien1904/dmns","path":"model/model_cond.py","file_url":"https://github.com/ntkien1904/dmns/blob/HEAD/model/model_cond.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"496165266c2eceff","mcp_get_code":{"code_sha256":"496165266c2eceff"}},{"arxiv_id":"2309.01745","paper":"/paper/turbulent-flow-simulation-using","title":"Benchmarking Autoregressive Conditional Diffusion Models for Turbulent Flow Simulation","date":"2023-09-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tum-pbs/autoreg-pde-diffusion","path":"src/turbpred/model_diffusion_blocks.py","file_url":"https://github.com/tum-pbs/autoreg-pde-diffusion/blob/HEAD/src/turbpred/model_diffusion_blocks.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5b86fb8a011537d6","mcp_get_code":{"code_sha256":"5b86fb8a011537d6"}},{"arxiv_id":"2306.06874","paper":"/paper/villandiffusion-a-unified-backdoor-attack-1","title":"VillanDiffusion: A Unified Backdoor Attack Framework for Diffusion Models","date":"2023-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IBM/villandiffusion","path":"loss.py","file_url":"https://github.com/IBM/villandiffusion/blob/HEAD/loss.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"496165266c2eceff","mcp_get_code":{"code_sha256":"496165266c2eceff"}},{"arxiv_id":"2209.15611","paper":"/paper/protein-structure-generation-via-folding","title":"Protein structure generation via folding diffusion","date":"2022-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/foldingdiff","path":"foldingdiff/beta_schedules.py","file_url":"https://github.com/microsoft/foldingdiff/blob/HEAD/foldingdiff/beta_schedules.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"96ef62e7f39a0d92","mcp_get_code":{"code_sha256":"96ef62e7f39a0d92"}},{"arxiv_id":"2206.00927","paper":"/paper/dpm-solver-a-fast-ode-solver-for-diffusion","title":"DPM-Solver: A Fast ODE Solver for Diffusion Probabilistic Model Sampling in Around 10 Steps","date":"2022-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"astra-vision/LiDPM","path":"lidpm/utils/scheduling.py","file_url":"https://github.com/astra-vision/LiDPM/blob/HEAD/lidpm/utils/scheduling.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"f9097d641770f184","mcp_get_code":{"code_sha256":"f9097d641770f184"}},{"arxiv_id":"2204.06125","paper":"/paper/hierarchical-text-conditional-image","title":"Hierarchical Text-Conditional Image Generation with CLIP Latents","date":"2022-04-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lucidrains/DALLE2-pytorch","path":"dalle2_pytorch/dalle2_pytorch.py","file_url":"https://github.com/lucidrains/DALLE2-pytorch/blob/HEAD/dalle2_pytorch/dalle2_pytorch.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7bc0ce30656f4c4a","mcp_get_code":{"code_sha256":"7bc0ce30656f4c4a"}},{"arxiv_id":"Han_UIBDiffusion_Universal_Imperceptible_Backdoor_Attack_for_Diffusion_Models_CVPR_2025_paper","paper":null,"title":"arXiv:Han_UIBDiffusion_Universal_Imperceptible_Backdoor_Attack_for_Diffusion_Models_CVPR_2025_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"TheLaoLab/UIBDiffusion","path":"loss.py","file_url":"https://github.com/TheLaoLab/UIBDiffusion/blob/HEAD/loss.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"496165266c2eceff","mcp_get_code":{"code_sha256":"496165266c2eceff"}}]}