{"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/optimization-manager","entry":"optimization_manager","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":26,"n_papers_ran":24,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":21,"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":9,"n_samples_ran":8,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":5,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":26,"n_places_pointer_only":23,"n_places_pointer_only_link_open":14,"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":5,"ran_fixture":0,"ran":3,"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":"2605.31596","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-31596","title":"KLIP: localized distribution shift detection via KL-divergence with diffusion priors in Inverse Problems","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"voilalab/KLIP","path":"song22/losses.py","file_url":"https://github.com/voilalab/KLIP/blob/HEAD/song22/losses.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, voilalab/KLIP when it was checked","code_sha256":"562a245a3880c52b","code_sha256_prefix":"562a245a3880c52b","mcp_get_code":{"code_sha256":"562a245a3880c52b"}},{"arxiv_id":"2412.09465","arxiv_id_is_arxiv":true,"paper":"/paper/oftsr-one-step-flow-for-image-super","title":"OFTSR: One-Step Flow for Image Super-Resolution with Tunable Fidelity-Realism Trade-offs","date":"2024-12-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yuanzhi-zhu/oftsr","path":"fm/losses.py","file_url":"https://github.com/yuanzhi-zhu/oftsr/blob/HEAD/fm/losses.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4c3fe3149cfaaedc","code_sha256_prefix":"4c3fe3149cfaaedc","mcp_get_code":{"code_sha256":"4c3fe3149cfaaedc"}},{"arxiv_id":"2410.24012","arxiv_id_is_arxiv":true,"paper":"/paper/diffusion-twigs-with-loop-guidance-for","title":"Diffusion Twigs with Loop Guidance for Conditional Graph Generation","date":"2024-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Aalto-QuML/Diffusion_twigs","path":"losses.py","file_url":"https://github.com/Aalto-QuML/Diffusion_twigs/blob/HEAD/losses.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d4922b3c3f09927a","code_sha256_prefix":"d4922b3c3f09927a","mcp_get_code":{"code_sha256":"d4922b3c3f09927a"}},{"arxiv_id":"2408.08502","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-image-to-image-diffusion-classifier","title":"Efficient Image-to-Image Diffusion Classifier for Adversarial Robustness","date":"2024-08-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hfmei/idc","path":"IDC-BPDA/score_sde/losses.py","file_url":"https://github.com/hfmei/idc/blob/HEAD/IDC-BPDA/score_sde/losses.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, hfmei/idc when it was checked","code_sha256":"366bb8c7035a2fc8","code_sha256_prefix":"366bb8c7035a2fc8","mcp_get_code":{"code_sha256":"366bb8c7035a2fc8"}},{"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":"losses.py","file_url":"https://github.com/yangling0818/consistency_flow_matching/blob/HEAD/losses.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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 hfmei/idc, and GitHub detected no licence in that repository when it was checked","code_sha256":"366bb8c7035a2fc8","code_sha256_prefix":"366bb8c7035a2fc8","mcp_get_code":{"code_sha256":"366bb8c7035a2fc8"}},{"arxiv_id":"2405.20971","arxiv_id_is_arxiv":true,"paper":"/paper/amortizing-intractable-inference-in-diffusion","title":"Amortizing intractable inference in diffusion models for vision, language, and control","date":"2024-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gfnorg/diffusion-finetuning","path":"diffusion_lm/losses.py","file_url":"https://github.com/gfnorg/diffusion-finetuning/blob/HEAD/diffusion_lm/losses.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, gfnorg/diffusion-finetuning when it was checked","code_sha256":"9b714e281bb784b7","code_sha256_prefix":"9b714e281bb784b7","mcp_get_code":{"code_sha256":"9b714e281bb784b7"}},{"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":"losses.py","file_url":"https://github.com/YasminZhang/ICTM/blob/HEAD/losses.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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 hfmei/idc, and GitHub detected no licence in that repository when it was checked","code_sha256":"366bb8c7035a2fc8","code_sha256_prefix":"366bb8c7035a2fc8","mcp_get_code":{"code_sha256":"366bb8c7035a2fc8"}},{"arxiv_id":"2405.17673","arxiv_id_is_arxiv":true,"paper":"/paper/fast-samplers-for-inverse-problems-in","title":"Fast Samplers for Inverse Problems in Iterative Refinement Models","date":"2024-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mandt-lab/c-pigdm","path":"flow/losses.py","file_url":"https://github.com/mandt-lab/c-pigdm/blob/HEAD/flow/losses.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, mandt-lab/c-pigdm when it was checked","code_sha256":"366bb8c7035a2fc8","code_sha256_prefix":"366bb8c7035a2fc8","mcp_get_code":{"code_sha256":"366bb8c7035a2fc8"}},{"arxiv_id":"2312.16414","arxiv_id_is_arxiv":true,"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/losses.py","file_url":"https://github.com/nguyenngocbaocmt02/boss/blob/HEAD/ImageGeneration/losses.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, nguyenngocbaocmt02/boss when it was checked","code_sha256":"366bb8c7035a2fc8","code_sha256_prefix":"366bb8c7035a2fc8","mcp_get_code":{"code_sha256":"366bb8c7035a2fc8"}},{"arxiv_id":"2311.16124","arxiv_id_is_arxiv":true,"paper":"/paper/diffattack-evasion-attacks-against-diffusion-1","title":"DiffAttack: Evasion Attacks Against Diffusion-Based Adversarial Purification","date":"2023-10-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kangmintong/DiffAttack","path":"DiffAttack_DDPM_Based/score_sde/losses.py","file_url":"https://github.com/kangmintong/DiffAttack/blob/HEAD/DiffAttack_DDPM_Based/score_sde/losses.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, kangmintong/DiffAttack when it was checked","code_sha256":"366bb8c7035a2fc8","code_sha256_prefix":"366bb8c7035a2fc8","mcp_get_code":{"code_sha256":"366bb8c7035a2fc8"}},{"arxiv_id":"2310.16834","arxiv_id_is_arxiv":true,"paper":"/paper/discrete-diffusion-language-modeling-by","title":"Discrete Diffusion Modeling by Estimating the Ratios of the Data Distribution","date":"2023-10-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"louaaron/Score-Entropy-Discrete-Diffusion","path":"losses.py","file_url":"https://github.com/louaaron/Score-Entropy-Discrete-Diffusion/blob/HEAD/losses.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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 gfnorg/diffusion-finetuning, and GitHub detected no licence in that repository when it was checked","code_sha256":"9b714e281bb784b7","code_sha256_prefix":"9b714e281bb784b7","mcp_get_code":{"code_sha256":"9b714e281bb784b7"}},{"arxiv_id":"2309.16779","arxiv_id_is_arxiv":true,"paper":"/paper/intriguing-properties-of-generative","title":"Intriguing properties of generative classifiers","date":"2023-09-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SamsungSAILMontreal/ForestDiffusion","path":"STaSy/losses.py","file_url":"https://github.com/SamsungSAILMontreal/ForestDiffusion/blob/HEAD/STaSy/losses.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, SamsungSAILMontreal/ForestDiffusion when it was checked","code_sha256":"18269deb82a2a3f6","code_sha256_prefix":"18269deb82a2a3f6","mcp_get_code":{"code_sha256":"18269deb82a2a3f6"}},{"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/losses.py","file_url":"https://github.com/berthyf96/score_prior/blob/HEAD/score_flow/losses.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, berthyf96/score_prior when it was checked","code_sha256":"53f39e2a10eaea69","code_sha256_prefix":"53f39e2a10eaea69","mcp_get_code":{"code_sha256":"53f39e2a10eaea69"}},{"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":"losses.py","file_url":"https://github.com/gabrielraya/symmetry_breaking_diffusion_models/blob/HEAD/losses.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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 hfmei/idc, and GitHub detected no licence in that repository when it was checked","code_sha256":"366bb8c7035a2fc8","code_sha256_prefix":"366bb8c7035a2fc8","mcp_get_code":{"code_sha256":"366bb8c7035a2fc8"}},{"arxiv_id":"2303.08133","arxiv_id_is_arxiv":true,"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/losses.py","file_url":"https://github.com/lzzcd001/MeshDiffusion/blob/HEAD/lib/diffusion/losses.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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 hfmei/idc, and GitHub detected no licence in that repository when it was checked","code_sha256":"366bb8c7035a2fc8","code_sha256_prefix":"366bb8c7035a2fc8","mcp_get_code":{"code_sha256":"366bb8c7035a2fc8"}},{"arxiv_id":"2212.01842","arxiv_id_is_arxiv":true,"paper":"/paper/graphgdp-generative-diffusion-processes-for","title":"GraphGDP: Generative Diffusion Processes for Permutation Invariant Graph Generation","date":"2022-12-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"graph-0/graphgdp","path":"losses.py","file_url":"https://github.com/graph-0/graphgdp/blob/HEAD/losses.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6d0eb222ef011692","code_sha256_prefix":"6d0eb222ef011692","mcp_get_code":{"code_sha256":"6d0eb222ef011692"}},{"arxiv_id":"2211.16116","arxiv_id_is_arxiv":true,"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/losses.py","file_url":"https://github.com/henryaddison/score_sde_pytorch/blob/HEAD/src/ml_downscaling_emulator/losses.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 hfmei/idc, and GitHub detected no licence in that repository when it was checked","code_sha256":"366bb8c7035a2fc8","code_sha256_prefix":"366bb8c7035a2fc8","mcp_get_code":{"code_sha256":"366bb8c7035a2fc8"}},{"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":"losses.py","file_url":"https://github.com/sony/fp-diffusion/blob/HEAD/losses.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 hfmei/idc, and GitHub detected no licence in that repository when it was checked","code_sha256":"366bb8c7035a2fc8","code_sha256_prefix":"366bb8c7035a2fc8","mcp_get_code":{"code_sha256":"366bb8c7035a2fc8"}},{"arxiv_id":"2209.12753","arxiv_id_is_arxiv":true,"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":"real_world/losses.py","file_url":"https://github.com/chen-hao-chao/qcsbm/blob/HEAD/real_world/losses.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 hfmei/idc, and GitHub detected no licence in that repository when it was checked","code_sha256":"366bb8c7035a2fc8","code_sha256_prefix":"366bb8c7035a2fc8","mcp_get_code":{"code_sha256":"366bb8c7035a2fc8"}},{"arxiv_id":"2206.05564","arxiv_id_is_arxiv":true,"paper":"/paper/gddim-generalized-denoising-diffusion","title":"gDDIM: Generalized denoising diffusion implicit models","date":"2022-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qsh-zh/gDDIM","path":"blur_jax/losses.py","file_url":"https://github.com/qsh-zh/gDDIM/blob/HEAD/blur_jax/losses.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 voilalab/KLIP, and GitHub detected no licence in that repository when it was checked","code_sha256":"562a245a3880c52b","code_sha256_prefix":"562a245a3880c52b","mcp_get_code":{"code_sha256":"562a245a3880c52b"}},{"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":"losses.py","file_url":"https://github.com/byeonghu-na/INDM/blob/HEAD/losses.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 hfmei/idc, and GitHub detected no licence in that repository when it was checked","code_sha256":"366bb8c7035a2fc8","code_sha256_prefix":"366bb8c7035a2fc8","mcp_get_code":{"code_sha256":"366bb8c7035a2fc8"}},{"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":"losses.py","file_url":"https://github.com/bjing2016/subspace-diffusion/blob/HEAD/losses.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 hfmei/idc, and GitHub detected no licence in that repository when it was checked","code_sha256":"366bb8c7035a2fc8","code_sha256_prefix":"366bb8c7035a2fc8","mcp_get_code":{"code_sha256":"366bb8c7035a2fc8"}},{"arxiv_id":"2110.05243","arxiv_id_is_arxiv":true,"paper":"/paper/score-based-diffusion-models-for-accelerated","title":"Score-based diffusion models for accelerated MRI","date":"2021-10-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HJ-harry/score-MRI","path":"losses.py","file_url":"https://github.com/HJ-harry/score-MRI/blob/HEAD/losses.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 hfmei/idc, and GitHub detected no licence in that repository when it was checked","code_sha256":"366bb8c7035a2fc8","code_sha256_prefix":"366bb8c7035a2fc8","mcp_get_code":{"code_sha256":"366bb8c7035a2fc8"}},{"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":"losses.py","file_url":"https://github.com/Kim-Dongjun/Soft-Truncation/blob/HEAD/losses.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 hfmei/idc, and GitHub detected no licence in that repository when it was checked","code_sha256":"366bb8c7035a2fc8","code_sha256_prefix":"366bb8c7035a2fc8","mcp_get_code":{"code_sha256":"366bb8c7035a2fc8"}},{"arxiv_id":"2101.09258","arxiv_id_is_arxiv":true,"paper":"/paper/on-maximum-likelihood-training-of-score-based","title":"Maximum Likelihood Training of Score-Based Diffusion Models","date":"2021-01-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"luchengthu/mle_score_ode","path":"losses.py","file_url":"https://github.com/luchengthu/mle_score_ode/blob/HEAD/losses.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, luchengthu/mle_score_ode when it was checked","code_sha256":"99dc1b69bbfb52a7","code_sha256_prefix":"99dc1b69bbfb52a7","mcp_get_code":{"code_sha256":"99dc1b69bbfb52a7"}},{"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":"losses.py","file_url":"https://github.com/HJ-harry/DiffusionMBIR/blob/HEAD/losses.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 hfmei/idc, and GitHub detected no licence in that repository when it was checked","code_sha256":"366bb8c7035a2fc8","code_sha256_prefix":"366bb8c7035a2fc8","mcp_get_code":{"code_sha256":"366bb8c7035a2fc8"}}],"record_sha256":"6ab9bdf239f0cd04783af403027e25e713536519e3c05899aae0df0478df657b","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}