{"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/get-sampler","entry":"get_sampler","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":20,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":2,"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":12,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":2,"n_samples_unverified":7,"n_samples_fingerprinted":0,"n_places":20,"n_places_pointer_only":15,"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":2,"ran_fixture":0,"ran":3,"unverified":7},"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":"2504.04715","arxiv_id_is_arxiv":true,"paper":"/paper/are-you-getting-what-you-pay-for-auditing","title":"Are You Getting What You Pay For? Auditing Model Substitution in LLM APIs","date":"2025-04-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sunblaze-ucb/llm-api-audit","path":"benchmark/lm-evaluation-harness/lm_eval/api/samplers.py","file_url":"https://github.com/sunblaze-ucb/llm-api-audit/blob/HEAD/benchmark/lm-evaluation-harness/lm_eval/api/samplers.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":"d3ee5f783a8a7d3f","code_sha256_prefix":"d3ee5f783a8a7d3f","mcp_get_code":{"code_sha256":"d3ee5f783a8a7d3f"}},{"arxiv_id":"2503.10091","arxiv_id_is_arxiv":true,"paper":"/paper/g-2-sf-miad-geometry-guided-score-fusion-for","title":"G$^{2}$SF-MIAD: Geometry-Guided Score Fusion for Multimodal Industrial Anomaly Detection","date":"2025-03-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ctaoaa/G2SF","path":"G2SF_GITHUB/Fusion/fusion_engine_v2.py","file_url":"https://github.com/ctaoaa/G2SF/blob/HEAD/G2SF_GITHUB/Fusion/fusion_engine_v2.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":"163820e4f0bc74bd","code_sha256_prefix":"163820e4f0bc74bd","mcp_get_code":{"code_sha256":"163820e4f0bc74bd"}},{"arxiv_id":"2502.01189","arxiv_id_is_arxiv":true,"paper":"/paper/compressed-image-generation-with-denoising","title":"Compressed Image Generation with Denoising Diffusion Codebook Models","date":"2025-02-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DDCM-2025/ddcm-compressed-image-generation","path":"ddcm/guided_diffusion/gaussian_diffusion.py","file_url":"https://github.com/DDCM-2025/ddcm-compressed-image-generation/blob/HEAD/ddcm/guided_diffusion/gaussian_diffusion.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 lingxiaoyang2023/dsg2024, and GitHub detected no licence in that repository when it was checked","code_sha256":"b910fefa7866252e","code_sha256_prefix":"b910fefa7866252e","mcp_get_code":{"code_sha256":"b910fefa7866252e"}},{"arxiv_id":"2412.16748","arxiv_id_is_arxiv":true,"paper":"/paper/solving-inverse-problems-via-diffusion","title":"Solving Inverse Problems via Diffusion Optimal Control","date":"2024-12-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lihenryhfl/diffusion_optimal_control","path":"utils/gaussian_diffusion.py","file_url":"https://github.com/lihenryhfl/diffusion_optimal_control/blob/HEAD/utils/gaussian_diffusion.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":"3c731f22d73494cc","code_sha256_prefix":"3c731f22d73494cc","mcp_get_code":{"code_sha256":"3c731f22d73494cc"}},{"arxiv_id":"2410.09945","arxiv_id_is_arxiv":true,"paper":"/paper/variational-diffusion-posterior-sampling-with","title":"Variational Diffusion Posterior Sampling with Midpoint Guidance","date":"2024-10-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yazidjanati/mgps","path":"src/guided_diffusion/gaussian_diffusion.py","file_url":"https://github.com/yazidjanati/mgps/blob/HEAD/src/guided_diffusion/gaussian_diffusion.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, yazidjanati/mgps when it was checked","code_sha256":"b910fefa7866252e","code_sha256_prefix":"b910fefa7866252e","mcp_get_code":{"code_sha256":"b910fefa7866252e"}},{"arxiv_id":"2410.03463","arxiv_id_is_arxiv":true,"paper":"/paper/diffusion-state-guided-projected-gradient-for","title":"Diffusion State-Guided Projected Gradient for Inverse Problems","date":"2024-10-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LituRout/PSLD","path":"diffusion-posterior-sampling/guided_diffusion/gaussian_diffusion.py","file_url":"https://github.com/LituRout/PSLD/blob/HEAD/diffusion-posterior-sampling/guided_diffusion/gaussian_diffusion.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, LituRout/PSLD when it was checked","code_sha256":"b910fefa7866252e","code_sha256_prefix":"b910fefa7866252e","mcp_get_code":{"code_sha256":"b910fefa7866252e"}},{"arxiv_id":"2405.06264","arxiv_id_is_arxiv":true,"paper":"/paper/selective-focus-investigating-semantics","title":"Selective Focus: Investigating Semantics Sensitivity in Post-training Quantization for Lane Detection","date":"2024-05-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PannenetsF/SelectiveFocus","path":"pad/utils/runners/lane_det_quant_trainer.py","file_url":"https://github.com/PannenetsF/SelectiveFocus/blob/HEAD/pad/utils/runners/lane_det_quant_trainer.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, PannenetsF/SelectiveFocus when it was checked","code_sha256":"eb3e7062d67261a5","code_sha256_prefix":"eb3e7062d67261a5","mcp_get_code":{"code_sha256":"eb3e7062d67261a5"}},{"arxiv_id":"2403.17042","arxiv_id_is_arxiv":true,"paper":"/paper/provably-robust-score-based-diffusion","title":"Provably Robust Score-Based Diffusion Posterior Sampling for Plug-and-Play Image Reconstruction","date":"2024-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"x1xu/diffusion-plug-and-play","path":"guided_diffusion/gaussian_diffusion.py","file_url":"https://github.com/x1xu/diffusion-plug-and-play/blob/HEAD/guided_diffusion/gaussian_diffusion.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, x1xu/diffusion-plug-and-play when it was checked","code_sha256":"b910fefa7866252e","code_sha256_prefix":"b910fefa7866252e","mcp_get_code":{"code_sha256":"b910fefa7866252e"}},{"arxiv_id":"2403.11407","arxiv_id_is_arxiv":true,"paper":"/paper/divide-and-conquer-posterior-sampling-for","title":"Divide-and-Conquer Posterior Sampling for Denoising Diffusion Priors","date":"2024-03-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"badr-moufad/dcps","path":"src/guided_diffusion/gaussian_diffusion.py","file_url":"https://github.com/badr-moufad/dcps/blob/HEAD/src/guided_diffusion/gaussian_diffusion.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, badr-moufad/dcps when it was checked","code_sha256":"b910fefa7866252e","code_sha256_prefix":"b910fefa7866252e","mcp_get_code":{"code_sha256":"b910fefa7866252e"}},{"arxiv_id":"2403.06054","arxiv_id_is_arxiv":true,"paper":"/paper/decoupled-data-consistency-with-diffusion","title":"Decoupled Data Consistency with Diffusion Purification for Image Restoration","date":"2024-03-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"morefre/decoupled-data-consistency-with-diffusion-purification-for-image-restoration","path":"guided_diffusion/gaussian_diffusion.py","file_url":"https://github.com/morefre/decoupled-data-consistency-with-diffusion-purification-for-image-restoration/blob/HEAD/guided_diffusion/gaussian_diffusion.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, morefre/decoupled-data-consistency-with-diffusion-purification-for-image-restoration when it was checked","code_sha256":"b910fefa7866252e","code_sha256_prefix":"b910fefa7866252e","mcp_get_code":{"code_sha256":"b910fefa7866252e"}},{"arxiv_id":"2402.16907","arxiv_id_is_arxiv":true,"paper":"/paper/diffusion-posterior-proximal-sampling-for","title":"Diffusion Posterior Proximal Sampling for Image Restoration","date":"2024-02-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"74587887/dpps_code","path":"guided_diffusion/gaussian_diffusion.py","file_url":"https://github.com/74587887/dpps_code/blob/HEAD/guided_diffusion/gaussian_diffusion.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, 74587887/dpps_code when it was checked","code_sha256":"b910fefa7866252e","code_sha256_prefix":"b910fefa7866252e","mcp_get_code":{"code_sha256":"b910fefa7866252e"}},{"arxiv_id":"2402.03312","arxiv_id_is_arxiv":true,"paper":"/paper/test-time-adaptation-for-depth-completion","title":"Test-Time Adaptation for Depth Completion","date":"2024-02-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"seobbro/TTA-depth-completion","path":"src/tta_main.py","file_url":"https://github.com/seobbro/TTA-depth-completion/blob/HEAD/src/tta_main.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, seobbro/TTA-depth-completion when it was checked","code_sha256":"c63c98f24eff4ce7","code_sha256_prefix":"c63c98f24eff4ce7","mcp_get_code":{"code_sha256":"c63c98f24eff4ce7"}},{"arxiv_id":"2402.03201","arxiv_id_is_arxiv":true,"paper":"/paper/guidance-with-spherical-gaussian-constraint","title":"Guidance with Spherical Gaussian Constraint for Conditional Diffusion","date":"2024-02-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lingxiaoyang2023/dsg2024","path":"Linear_Inverse_Problems/guided_diffusion/gaussian_diffusion.py","file_url":"https://github.com/lingxiaoyang2023/dsg2024/blob/HEAD/Linear_Inverse_Problems/guided_diffusion/gaussian_diffusion.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, lingxiaoyang2023/dsg2024 when it was checked","code_sha256":"b910fefa7866252e","code_sha256_prefix":"b910fefa7866252e","mcp_get_code":{"code_sha256":"b910fefa7866252e"}},{"arxiv_id":"2312.02517","arxiv_id_is_arxiv":true,"paper":"/paper/simplifying-neural-network-training-under-1","title":"Simplifying Neural Network Training Under Class Imbalance","date":"2023-12-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ravidziv/SimplifyingImbalancedTraining","path":"imbalanced/data.py","file_url":"https://github.com/ravidziv/SimplifyingImbalancedTraining/blob/HEAD/imbalanced/data.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, ravidziv/SimplifyingImbalancedTraining when it was checked","code_sha256":"3b2896cbbe245a73","code_sha256_prefix":"3b2896cbbe245a73","mcp_get_code":{"code_sha256":"3b2896cbbe245a73"}},{"arxiv_id":"2310.02233","arxiv_id_is_arxiv":true,"paper":"/paper/generalized-schrodinger-bridge-matching","title":"Generalized Schrödinger Bridge Matching","date":"2023-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/generalized-schrodinger-bridge-matching","path":"gsbm/dataset.py","file_url":"https://github.com/facebookresearch/generalized-schrodinger-bridge-matching/blob/HEAD/gsbm/dataset.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, facebookresearch/generalized-schrodinger-bridge-matching (NOASSERTION)","code_sha256":"6c3287f25897592a","code_sha256_prefix":"6c3287f25897592a","mcp_get_code":{"code_sha256":"6c3287f25897592a"}},{"arxiv_id":"2309.00287","arxiv_id_is_arxiv":true,"paper":"/paper/fast-diffusion-em-a-diffusion-model-for-blind","title":"Fast Diffusion EM: a diffusion model for blind inverse problems with application to deconvolution","date":"2023-09-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"claroche-r/fastdiffusionem","path":"guided_diffusion/gaussian_diffusion.py","file_url":"https://github.com/claroche-r/fastdiffusionem/blob/HEAD/guided_diffusion/gaussian_diffusion.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, claroche-r/fastdiffusionem when it was checked","code_sha256":"b910fefa7866252e","code_sha256_prefix":"b910fefa7866252e","mcp_get_code":{"code_sha256":"b910fefa7866252e"}},{"arxiv_id":"2308.03374","arxiv_id_is_arxiv":true,"paper":"/paper/heterogeneous-forgetting-compensation-for","title":"Heterogeneous Forgetting Compensation for Class-Incremental Learning","date":"2023-08-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JiahuaDong/HFC","path":"samplers.py","file_url":"https://github.com/JiahuaDong/HFC/blob/HEAD/samplers.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, JiahuaDong/HFC when it was checked","code_sha256":"c5268f4f4b95766d","code_sha256_prefix":"c5268f4f4b95766d","mcp_get_code":{"code_sha256":"c5268f4f4b95766d"}},{"arxiv_id":"2304.08818","arxiv_id_is_arxiv":true,"paper":"/paper/align-your-latents-high-resolution-video","title":"Align your Latents: High-Resolution Video Synthesis with Latent Diffusion Models","date":"2023-04-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ai-forever/kandinskyvideo","path":"kandinsky_video/model/diffusion.py","file_url":"https://github.com/ai-forever/kandinskyvideo/blob/HEAD/kandinsky_video/model/diffusion.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":"887b76ef7e5c376f","code_sha256_prefix":"887b76ef7e5c376f","mcp_get_code":{"code_sha256":"887b76ef7e5c376f"}},{"arxiv_id":"2303.05456","arxiv_id_is_arxiv":true,"paper":"/paper/restoration-based-generative-models","title":"Restoration based Generative Models","date":"2023-02-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Jae-Moo/RGM","path":"forward.py","file_url":"https://github.com/Jae-Moo/RGM/blob/HEAD/forward.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":"38da6ef76f929991","code_sha256_prefix":"38da6ef76f929991","mcp_get_code":{"code_sha256":"38da6ef76f929991"}},{"arxiv_id":"2204.13902","arxiv_id_is_arxiv":true,"paper":"/paper/fast-sampling-of-diffusion-models-with","title":"Fast Sampling of Diffusion Models with Exponential Integrator","date":"2022-04-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qsh-zh/deis","path":"jax_deis/sampler.py","file_url":"https://github.com/qsh-zh/deis/blob/HEAD/jax_deis/sampler.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, qsh-zh/deis when it was checked","code_sha256":"e04b6fa68b802212","code_sha256_prefix":"e04b6fa68b802212","mcp_get_code":{"code_sha256":"e04b6fa68b802212"}}],"record_sha256":"e8b768cc2b5b67ca88a7e0519fd1c19da1a654e3d1dbfb9e0792bec25fa47340","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}