{"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/get-div-fn","entry":"get_div_fn","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":12,"n_papers_ran":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":2,"n_samples_ran":0,"n_samples_fingerprinted":0,"n_places":12,"n_places_pointer_only":2,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":2},"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","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/likelihood.py","file_url":"https://github.com/rarazafin/score_diffusion_ensemble/blob/HEAD/score_based_cifar10/likelihood.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"0bfcb6b2d940e393","mcp_get_code":{"code_sha256":"0bfcb6b2d940e393"}},{"arxiv_id":"2407.02398","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":"likelihood.py","file_url":"https://github.com/yangling0818/consistency_flow_matching/blob/HEAD/likelihood.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0bfcb6b2d940e393","mcp_get_code":{"code_sha256":"0bfcb6b2d940e393"}},{"arxiv_id":"2405.18816","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":"likelihood.py","file_url":"https://github.com/YasminZhang/ICTM/blob/HEAD/likelihood.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0bfcb6b2d940e393","mcp_get_code":{"code_sha256":"0bfcb6b2d940e393"}},{"arxiv_id":"2312.16414","paper":"/paper/bellman-optimal-step-size-straightening-of","title":"Bellman Optimal Stepsize Straightening of Flow-Matching Models","date":"2023-12-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nguyenngocbaocmt02/boss","path":"ImageGeneration/likelihood.py","file_url":"https://github.com/nguyenngocbaocmt02/boss/blob/HEAD/ImageGeneration/likelihood.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"0bfcb6b2d940e393","mcp_get_code":{"code_sha256":"0bfcb6b2d940e393"}},{"arxiv_id":"2303.08133","paper":"/paper/meshdiffusion-score-based-generative-3d-mesh","title":"MeshDiffusion: Score-based Generative 3D Mesh Modeling","date":"2023-03-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lzzcd001/MeshDiffusion","path":"lib/diffusion/likelihood.py","file_url":"https://github.com/lzzcd001/MeshDiffusion/blob/HEAD/lib/diffusion/likelihood.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0bfcb6b2d940e393","mcp_get_code":{"code_sha256":"0bfcb6b2d940e393"}},{"arxiv_id":"2211.16116","paper":"/paper/machine-learning-emulation-of-a-local-scale","title":"Machine learning emulation of a local-scale UK climate model","date":"2022-11-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"henryaddison/score_sde_pytorch","path":"src/ml_downscaling_emulator/likelihood.py","file_url":"https://github.com/henryaddison/score_sde_pytorch/blob/HEAD/src/ml_downscaling_emulator/likelihood.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":"0bfcb6b2d940e393","mcp_get_code":{"code_sha256":"0bfcb6b2d940e393"}},{"arxiv_id":"2210.04296","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":"likelihood.py","file_url":"https://github.com/sony/fp-diffusion/blob/HEAD/likelihood.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":"0bfcb6b2d940e393","mcp_get_code":{"code_sha256":"0bfcb6b2d940e393"}},{"arxiv_id":"2209.12753","paper":"/paper/quasi-conservative-score-based-generative","title":"On Investigating the Conservative Property of Score-Based Generative Models","date":"2022-09-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chen-hao-chao/qcsbm","path":"2d_examples/likelihood.py","file_url":"https://github.com/chen-hao-chao/qcsbm/blob/HEAD/2d_examples/likelihood.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":"fc7647832d475a31","mcp_get_code":{"code_sha256":"fc7647832d475a31"}},{"arxiv_id":"2205.13699","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":"likelihood.py","file_url":"https://github.com/byeonghu-na/INDM/blob/HEAD/likelihood.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":"0bfcb6b2d940e393","mcp_get_code":{"code_sha256":"0bfcb6b2d940e393"}},{"arxiv_id":"2205.01490","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":"likelihood.py","file_url":"https://github.com/bjing2016/subspace-diffusion/blob/HEAD/likelihood.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":"0bfcb6b2d940e393","mcp_get_code":{"code_sha256":"0bfcb6b2d940e393"}},{"arxiv_id":"2106.05527","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":"likelihood.py","file_url":"https://github.com/Kim-Dongjun/Soft-Truncation/blob/HEAD/likelihood.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":"0bfcb6b2d940e393","mcp_get_code":{"code_sha256":"0bfcb6b2d940e393"}},{"arxiv_id":"Chung_Solving_3D_Inverse_Problems_Using_Pre-Trained_2D_Diffusion_Models_CVPR_2023_paper","paper":null,"title":"arXiv: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":"likelihood.py","file_url":"https://github.com/HJ-harry/DiffusionMBIR/blob/HEAD/likelihood.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":"0bfcb6b2d940e393","mcp_get_code":{"code_sha256":"0bfcb6b2d940e393"}}]}