{"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/zero-init","entry":"zero_init","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":6,"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":5,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":4,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":5,"n_places_pointer_only_link_open":1,"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":4,"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":"2412.03439","arxiv_id_is_arxiv":true,"paper":"/paper/cleandift-diffusion-features-without-noise","title":"CleanDIFT: Diffusion Features without Noise","date":"2024-12-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CompVis/cleandift","path":"src/utils.py","file_url":"https://github.com/CompVis/cleandift/blob/HEAD/src/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, CompVis/cleandift when it was checked","code_sha256":"f77f674b4dd20ec9","code_sha256_prefix":"f77f674b4dd20ec9","mcp_get_code":{"code_sha256":"f77f674b4dd20ec9"}},{"arxiv_id":"2406.12378","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-mapping-of-phase-diagrams-with","title":"Efficient mapping of phase diagrams with conditional Boltzmann Generators","date":"2024-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"maxschebek/flow_diagrams","path":"flow_diagrams/utils/weights.py","file_url":"https://github.com/maxschebek/flow_diagrams/blob/HEAD/flow_diagrams/utils/weights.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, maxschebek/flow_diagrams when it was checked","code_sha256":"4fcb2833615ed0b5","code_sha256_prefix":"4fcb2833615ed0b5","mcp_get_code":{"code_sha256":"4fcb2833615ed0b5"}},{"arxiv_id":"2404.15766","arxiv_id_is_arxiv":true,"paper":"/paper/unifying-bayesian-flow-networks-and-diffusion","title":"Unifying Bayesian Flow Networks and Diffusion Models through Stochastic Differential Equations","date":"2024-04-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ML-GSAI/BFN-Solver","path":"networks/unet_vdm.py","file_url":"https://github.com/ML-GSAI/BFN-Solver/blob/HEAD/networks/unet_vdm.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, ML-GSAI/BFN-Solver when it was checked","code_sha256":"b6858c53f43787dc","code_sha256_prefix":"b6858c53f43787dc","mcp_get_code":{"code_sha256":"b6858c53f43787dc"}},{"arxiv_id":"2403.10648","arxiv_id_is_arxiv":true,"paper":"/paper/debiasing-with-diffusion-probabilistic","title":"Debiasing with Diffusion: Probabilistic reconstruction of Dark Matter fields from galaxies with CAMELS","date":null,"month_inferred_from_arxiv_id":"2024-03","title_source":"archive","repo":"victoriaono/variational-diffusion-cdm","path":"model/utils/utils.py","file_url":"https://github.com/victoriaono/variational-diffusion-cdm/blob/HEAD/model/utils/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, victoriaono/variational-diffusion-cdm when it was checked","code_sha256":"5bdb96892de5c9ee","code_sha256_prefix":"5bdb96892de5c9ee","mcp_get_code":{"code_sha256":"5bdb96892de5c9ee"}},{"arxiv_id":"2308.07037","arxiv_id_is_arxiv":true,"paper":"/paper/bayesian-flow-networks","title":"Bayesian Flow Networks","date":"2023-08-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nnaisense/bayesian-flow-networks","path":"networks/unet_vdm.py","file_url":"https://github.com/nnaisense/bayesian-flow-networks/blob/HEAD/networks/unet_vdm.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"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 ML-GSAI/BFN-Solver, and GitHub detected no licence in that repository when it was checked","code_sha256":"b6858c53f43787dc","code_sha256_prefix":"b6858c53f43787dc","mcp_get_code":{"code_sha256":"b6858c53f43787dc"}},{"arxiv_id":"2206.00364","arxiv_id_is_arxiv":true,"paper":"/paper/elucidating-the-design-space-of-diffusion","title":"Elucidating the Design Space of Diffusion-Based Generative Models","date":"2022-06-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"crowsonkb/k-diffusion","path":"k_diffusion/models/image_transformer_v2.py","file_url":"https://github.com/crowsonkb/k-diffusion/blob/HEAD/k_diffusion/models/image_transformer_v2.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d63461a574db572f","code_sha256_prefix":"d63461a574db572f","mcp_get_code":{"code_sha256":"d63461a574db572f"}}],"record_sha256":"db258cd6a7a2de882106bc0b2c3ebe15462a8e564bb02d7a3fb4e5b501da1aff","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}