{"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/quadratic-beta-schedule","entry":"quadratic_beta_schedule","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":9,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":9,"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":5,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":5,"n_places":9,"n_places_pointer_only":3,"n_places_pointer_only_link_open":2,"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":2,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":3,"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":"2512.07289","arxiv_id_is_arxiv":true,"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":"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":"f9097d641770f184","code_sha256_prefix":"f9097d641770f184","mcp_get_code":{"code_sha256":"f9097d641770f184"}},{"arxiv_id":"2503.00522","arxiv_id_is_arxiv":true,"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":"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":"f9097d641770f184","code_sha256_prefix":"f9097d641770f184","mcp_get_code":{"code_sha256":"f9097d641770f184"}},{"arxiv_id":"2403.17259","arxiv_id_is_arxiv":true,"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_honours","verification_level":1,"contract_check":"HONOURS","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, ntkien1904/dmns when it was checked","code_sha256":"496165266c2eceff","code_sha256_prefix":"496165266c2eceff","mcp_get_code":{"code_sha256":"496165266c2eceff"}},{"arxiv_id":"2309.01745","arxiv_id_is_arxiv":true,"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":"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":"5b86fb8a011537d6","code_sha256_prefix":"5b86fb8a011537d6","mcp_get_code":{"code_sha256":"5b86fb8a011537d6"}},{"arxiv_id":"2306.06874","arxiv_id_is_arxiv":true,"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_honours","verification_level":1,"contract_check":"HONOURS","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 ntkien1904/dmns, and GitHub detected no licence in that repository when it was checked","code_sha256":"496165266c2eceff","code_sha256_prefix":"496165266c2eceff","mcp_get_code":{"code_sha256":"496165266c2eceff"}},{"arxiv_id":"2209.15611","arxiv_id_is_arxiv":true,"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":"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":"96ef62e7f39a0d92","code_sha256_prefix":"96ef62e7f39a0d92","mcp_get_code":{"code_sha256":"96ef62e7f39a0d92"}},{"arxiv_id":"2206.00927","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f9097d641770f184","code_sha256_prefix":"f9097d641770f184","mcp_get_code":{"code_sha256":"f9097d641770f184"}},{"arxiv_id":"2204.06125","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7bc0ce30656f4c4a","code_sha256_prefix":"7bc0ce30656f4c4a","mcp_get_code":{"code_sha256":"7bc0ce30656f4c4a"}},{"arxiv_id":"Han_UIBDiffusion_Universal_Imperceptible_Backdoor_Attack_for_Diffusion_Models_CVPR_2025_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id 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_honours","verification_level":1,"contract_check":"HONOURS","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 ntkien1904/dmns, and GitHub detected no licence in that repository when it was checked","code_sha256":"496165266c2eceff","code_sha256_prefix":"496165266c2eceff","mcp_get_code":{"code_sha256":"496165266c2eceff"}}],"record_sha256":"6091da5a6a19444acff8c9f52bcc04ba0761a7840b85a2680eed817d60b6897c","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}