{"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/load-dataset-stats","entry":"load_dataset_stats","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":11,"n_papers_ran":3,"n_papers_ran_no_instrument_failure":3,"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":7,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":0,"n_samples_unverified":4,"n_samples_fingerprinted":0,"n_places":11,"n_places_pointer_only":7,"n_places_pointer_only_link_open":4,"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":0,"ran":3,"unverified":4},"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":"2601.11444","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-11444","title":"When Are Two Scores Better Than One? Investigating Ensembles of Diffusion Models","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"rarazafin/score_diffusion_ensemble","path":"score_based_cifar10/evaluation.py","file_url":"https://github.com/rarazafin/score_diffusion_ensemble/blob/HEAD/score_based_cifar10/evaluation.py","status":"unverified","verification_level":0,"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, rarazafin/score_diffusion_ensemble when it was checked","code_sha256":"b45ab263f8440954","code_sha256_prefix":"b45ab263f8440954","mcp_get_code":{"code_sha256":"b45ab263f8440954"}},{"arxiv_id":"2407.02398","arxiv_id_is_arxiv":true,"paper":"/paper/consistency-flow-matching-defining-straight","title":"Consistency Flow Matching: Defining Straight Flows with Velocity Consistency","date":"2024-07-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yangling0818/consistency_flow_matching","path":"evaluation.py","file_url":"https://github.com/yangling0818/consistency_flow_matching/blob/HEAD/evaluation.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"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 rarazafin/score_diffusion_ensemble, and GitHub detected no licence in that repository when it was checked","code_sha256":"b45ab263f8440954","code_sha256_prefix":"b45ab263f8440954","mcp_get_code":{"code_sha256":"b45ab263f8440954"}},{"arxiv_id":"2405.18816","arxiv_id_is_arxiv":true,"paper":"/paper/flow-priors-for-linear-inverse-problems-via","title":"Flow Priors for Linear Inverse Problems via Iterative Corrupted Trajectory Matching","date":"2024-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YasminZhang/ICTM","path":"evaluation.py","file_url":"https://github.com/YasminZhang/ICTM/blob/HEAD/evaluation.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"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 rarazafin/score_diffusion_ensemble, and GitHub detected no licence in that repository when it was checked","code_sha256":"b45ab263f8440954","code_sha256_prefix":"b45ab263f8440954","mcp_get_code":{"code_sha256":"b45ab263f8440954"}},{"arxiv_id":"2309.01949","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-bayesian-computational-imaging-with","title":"Variational Bayesian Imaging with an Efficient Surrogate Score-based Prior","date":"2023-09-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"berthyf96/score_prior","path":"score_flow/evaluation.py","file_url":"https://github.com/berthyf96/score_prior/blob/HEAD/score_flow/evaluation.py","status":"unverified","verification_level":0,"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, berthyf96/score_prior when it was checked","code_sha256":"beaa2ce502047cbf","code_sha256_prefix":"beaa2ce502047cbf","mcp_get_code":{"code_sha256":"beaa2ce502047cbf"}},{"arxiv_id":"2305.19693","arxiv_id_is_arxiv":true,"paper":"/paper/spontaneous-symmetry-breaking-in-generative-1","title":"Spontaneous Symmetry Breaking in Generative Diffusion Models","date":"2023-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gabrielraya/symmetry_breaking_diffusion_models","path":"evaluation.py","file_url":"https://github.com/gabrielraya/symmetry_breaking_diffusion_models/blob/HEAD/evaluation.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"72cc7337a59b2a93","code_sha256_prefix":"72cc7337a59b2a93","mcp_get_code":{"code_sha256":"72cc7337a59b2a93"}},{"arxiv_id":"2303.00800","arxiv_id_is_arxiv":true,"paper":"/paper/continuous-time-functional-diffusion","title":"Continuous-Time Functional Diffusion Processes","date":"2023-03-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"giulio98/functional-diffusion-processes","path":"src/functional_diffusion_processes/metrics/metrics_utils.py","file_url":"https://github.com/giulio98/functional-diffusion-processes/blob/HEAD/src/functional_diffusion_processes/metrics/metrics_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"Apache-2.0, as GitHub detects it on this paper's repository, giulio98/functional-diffusion-processes, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"355ae31ad66b7e7c","code_sha256_prefix":"355ae31ad66b7e7c","mcp_get_code":{"code_sha256":"355ae31ad66b7e7c"}},{"arxiv_id":"2210.04296","arxiv_id_is_arxiv":true,"paper":"/paper/regularizing-score-based-models-with-score","title":"FP-Diffusion: Improving Score-based Diffusion Models by Enforcing the Underlying Score Fokker-Planck Equation","date":"2022-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sony/fp-diffusion","path":"evaluation.py","file_url":"https://github.com/sony/fp-diffusion/blob/HEAD/evaluation.py","status":"unverified","verification_level":0,"contract_check":null,"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 rarazafin/score_diffusion_ensemble, and GitHub detected no licence in that repository when it was checked","code_sha256":"b45ab263f8440954","code_sha256_prefix":"b45ab263f8440954","mcp_get_code":{"code_sha256":"b45ab263f8440954"}},{"arxiv_id":"2205.13699","arxiv_id_is_arxiv":true,"paper":"/paper/maximum-likelihood-training-of-implicit","title":"Maximum Likelihood Training of Implicit Nonlinear Diffusion Models","date":"2022-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"byeonghu-na/INDM","path":"evaluation.py","file_url":"https://github.com/byeonghu-na/INDM/blob/HEAD/evaluation.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9aab5813052c11b2","code_sha256_prefix":"9aab5813052c11b2","mcp_get_code":{"code_sha256":"9aab5813052c11b2"}},{"arxiv_id":"2205.01490","arxiv_id_is_arxiv":true,"paper":"/paper/subspace-diffusion-generative-models","title":"Subspace Diffusion Generative Models","date":"2022-05-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bjing2016/subspace-diffusion","path":"evaluation.py","file_url":"https://github.com/bjing2016/subspace-diffusion/blob/HEAD/evaluation.py","status":"unverified","verification_level":0,"contract_check":null,"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 rarazafin/score_diffusion_ensemble, and GitHub detected no licence in that repository when it was checked","code_sha256":"b45ab263f8440954","code_sha256_prefix":"b45ab263f8440954","mcp_get_code":{"code_sha256":"b45ab263f8440954"}},{"arxiv_id":"2106.05527","arxiv_id_is_arxiv":true,"paper":"/paper/score-matching-model-for-unbounded-data-score-1","title":"Soft Truncation: A Universal Training Technique of Score-based Diffusion Model for High Precision Score Estimation","date":"2021-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Kim-Dongjun/Soft-Truncation","path":"evaluation.py","file_url":"https://github.com/Kim-Dongjun/Soft-Truncation/blob/HEAD/evaluation.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c7b30d41729eeb8e","code_sha256_prefix":"c7b30d41729eeb8e","mcp_get_code":{"code_sha256":"c7b30d41729eeb8e"}},{"arxiv_id":"Chung_Solving_3D_Inverse_Problems_Using_Pre-Trained_2D_Diffusion_Models_CVPR_2023_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Chung_Solving_3D_Inverse_Problems_Using_Pre-Trained_2D_Diffusion_Models_CVPR_2023_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"HJ-harry/DiffusionMBIR","path":"evaluation.py","file_url":"https://github.com/HJ-harry/DiffusionMBIR/blob/HEAD/evaluation.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"58a6128e1c09da2d","code_sha256_prefix":"58a6128e1c09da2d","mcp_get_code":{"code_sha256":"58a6128e1c09da2d"}}],"record_sha256":"a07f6af30b77455680199c24ee53b68acda25f17ab6ce0cfe74ee1bce7b3a410","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}