{"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/clip-noise-schedule","entry":"clip_noise_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":7,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":1,"n_papers_ran_instrument_only":5,"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":4,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":3,"n_samples_unverified":1,"n_samples_fingerprinted":4,"n_places":7,"n_places_pointer_only":2,"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":3,"ran":1,"unverified":1},"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":"2607.06546","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-06546","title":"Graph Convolutional Attention: A Spectral Perspective on Graph Denoising and Diffusion","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"shervinkhalafi/graph_conv_att","path":"src/tmgg/diffusion/diffusion_math.py","file_url":"https://github.com/shervinkhalafi/graph_conv_att/blob/HEAD/src/tmgg/diffusion/diffusion_math.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"EUPL-1.2","inline_ok":false,"inline_ok_link":false,"withheld_clause":"EUPL-1.2, as GitHub detects it on this paper's repository, shervinkhalafi/graph_conv_att, is not in the permissive set Syntology serves inline","code_sha256":"c2b22e5bef3eb735","code_sha256_prefix":"c2b22e5bef3eb735","mcp_get_code":{"code_sha256":"c2b22e5bef3eb735"}},{"arxiv_id":"2410.10605","arxiv_id_is_arxiv":true,"paper":"/paper/boltzmann-priors-for-implicit-transfer","title":"Boltzmann priors for Implicit Transfer Operators","date":null,"month_inferred_from_arxiv_id":"2024-10","title_source":"archive","repo":"olsson-group/bopito","path":"bopito/models/beta_schedule.py","file_url":"https://github.com/olsson-group/bopito/blob/HEAD/bopito/models/beta_schedule.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"227cedce4e185b09","code_sha256_prefix":"227cedce4e185b09","mcp_get_code":{"code_sha256":"227cedce4e185b09"}},{"arxiv_id":"2404.12141","arxiv_id_is_arxiv":true,"paper":"/paper/molcraft-structure-based-drug-design-in","title":"MolCRAFT: Structure-Based Drug Design in Continuous Parameter Space","date":"2024-04-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AlgoMole/GeoBFN","path":"core/losses/loss_utils.py","file_url":"https://github.com/AlgoMole/GeoBFN/blob/HEAD/core/losses/loss_utils.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, AlgoMole/GeoBFN when it was checked","code_sha256":"227cedce4e185b09","code_sha256_prefix":"227cedce4e185b09","mcp_get_code":{"code_sha256":"227cedce4e185b09"}},{"arxiv_id":"2404.10935","arxiv_id_is_arxiv":true,"paper":"/paper/molecular-relaxation-by-reverse-diffusion","title":"Molecular relaxation by reverse diffusion with time step prediction","date":"2024-04-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"khaledkah/morered","path":"src/morered/noise_schedules.py","file_url":"https://github.com/khaledkah/morered/blob/HEAD/src/morered/noise_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":"3e6594d415b64c0f","code_sha256_prefix":"3e6594d415b64c0f","mcp_get_code":{"code_sha256":"3e6594d415b64c0f"}},{"arxiv_id":"2401.02683","arxiv_id_is_arxiv":true,"paper":"/paper/geometric-facilitated-denoising-diffusion","title":"Geometric-Facilitated Denoising Diffusion Model for 3D Molecule Generation","date":"2024-01-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LEOXC1571/GFMDiff","path":"models/diff/noise.py","file_url":"https://github.com/LEOXC1571/GFMDiff/blob/HEAD/models/diff/noise.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"761b3c71b3bd357b","code_sha256_prefix":"761b3c71b3bd357b","mcp_get_code":{"code_sha256":"761b3c71b3bd357b"}},{"arxiv_id":"2311.13466","arxiv_id_is_arxiv":true,"paper":"/paper/accelerating-inference-in-molecular-diffusion","title":"Accelerating Inference in Molecular Diffusion Models with Latent Representations of Protein Structure","date":"2023-11-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dunni3/keypoint-diffusion","path":"models/ligand_diffuser.py","file_url":"https://github.com/dunni3/keypoint-diffusion/blob/HEAD/models/ligand_diffuser.py","status":"unverified","verification_level":0,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2eb9e464e505772e","code_sha256_prefix":"2eb9e464e505772e","mcp_get_code":{"code_sha256":"2eb9e464e505772e"}},{"arxiv_id":"2306.16819","arxiv_id_is_arxiv":true,"paper":"/paper/graph-denoising-diffusion-for-inverse-protein","title":"Graph Denoising Diffusion for Inverse Protein Folding","date":"2023-06-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ykiiiiii/GraDe_IF","path":"diffusion/utils.py","file_url":"https://github.com/ykiiiiii/GraDe_IF/blob/HEAD/diffusion/utils.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"227cedce4e185b09","code_sha256_prefix":"227cedce4e185b09","mcp_get_code":{"code_sha256":"227cedce4e185b09"}}],"record_sha256":"e671465fe40eca81d90a3ba8c2b35db09883deea3c79d8d1501dd7eee707796b","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}