{"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/create-sampler","entry":"create_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":14,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":5,"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":14,"n_places_pointer_only":10,"n_places_pointer_only_link_open":2,"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":"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 yazidjanati/mgps, and GitHub detected no licence in that repository when it was checked","code_sha256":"7a9479e9edb0166b","code_sha256_prefix":"7a9479e9edb0166b","mcp_get_code":{"code_sha256":"7a9479e9edb0166b"}},{"arxiv_id":"2501.01428","arxiv_id_is_arxiv":true,"paper":"/paper/gpt4scene-understand-3d-scenes-from-videos","title":"GPT4Scene: Understand 3D Scenes from Videos with Vision-Language Models","date":"2025-01-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Qi-Zhangyang/GPT4Scene","path":"evaluate/val_dataset.py","file_url":"https://github.com/Qi-Zhangyang/GPT4Scene/blob/HEAD/evaluate/val_dataset.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":"8d7bf7ad0e60457f","code_sha256_prefix":"8d7bf7ad0e60457f","mcp_get_code":{"code_sha256":"8d7bf7ad0e60457f"}},{"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":"294fde7d083cb8c9","code_sha256_prefix":"294fde7d083cb8c9","mcp_get_code":{"code_sha256":"294fde7d083cb8c9"}},{"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":"7a9479e9edb0166b","code_sha256_prefix":"7a9479e9edb0166b","mcp_get_code":{"code_sha256":"7a9479e9edb0166b"}},{"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":"7a9479e9edb0166b","code_sha256_prefix":"7a9479e9edb0166b","mcp_get_code":{"code_sha256":"7a9479e9edb0166b"}},{"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":"7a9479e9edb0166b","code_sha256_prefix":"7a9479e9edb0166b","mcp_get_code":{"code_sha256":"7a9479e9edb0166b"}},{"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":"77fad1533b052188","code_sha256_prefix":"77fad1533b052188","mcp_get_code":{"code_sha256":"77fad1533b052188"}},{"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":"7a9479e9edb0166b","code_sha256_prefix":"7a9479e9edb0166b","mcp_get_code":{"code_sha256":"7a9479e9edb0166b"}},{"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":"a06381763d81bd41","code_sha256_prefix":"a06381763d81bd41","mcp_get_code":{"code_sha256":"a06381763d81bd41"}},{"arxiv_id":"2401.03253","arxiv_id_is_arxiv":true,"paper":"/paper/large-language-models-as-visual-cross-domain","title":"VLLaVO: Mitigating Visual Gap through LLMs","date":"2024-01-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LL-a-VO/VLLaVO","path":"lens/utils.py","file_url":"https://github.com/LL-a-VO/VLLaVO/blob/HEAD/lens/utils.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, LL-a-VO/VLLaVO when it was checked","code_sha256":"1d11345966a0f999","code_sha256_prefix":"1d11345966a0f999","mcp_get_code":{"code_sha256":"1d11345966a0f999"}},{"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":"7a9479e9edb0166b","code_sha256_prefix":"7a9479e9edb0166b","mcp_get_code":{"code_sha256":"7a9479e9edb0166b"}},{"arxiv_id":"2306.16410","arxiv_id_is_arxiv":true,"paper":"/paper/towards-language-models-that-can-see-computer","title":"Towards Language Models That Can See: Computer Vision Through the LENS of Natural Language","date":"2023-06-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"contextualai/lens","path":"lens/utils.py","file_url":"https://github.com/contextualai/lens/blob/HEAD/lens/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":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from LL-a-VO/VLLaVO, and GitHub detected no licence in that repository when it was checked","code_sha256":"1d11345966a0f999","code_sha256_prefix":"1d11345966a0f999","mcp_get_code":{"code_sha256":"1d11345966a0f999"}},{"arxiv_id":"2305.07922","arxiv_id_is_arxiv":true,"paper":"/paper/codet5-open-code-large-language-models-for","title":"CodeT5+: Open Code Large Language Models for Code Understanding and Generation","date":"2023-05-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"salesforce/codet5","path":"CodeT5+/code_retrieval/data_utils.py","file_url":"https://github.com/salesforce/codet5/blob/HEAD/CodeT5%2B/code_retrieval/data_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8d7bf7ad0e60457f","code_sha256_prefix":"8d7bf7ad0e60457f","mcp_get_code":{"code_sha256":"8d7bf7ad0e60457f"}},{"arxiv_id":"1908.07442","arxiv_id_is_arxiv":true,"paper":"/paper/tabnet-attentive-interpretable-tabular","title":"TabNet: Attentive Interpretable Tabular Learning","date":"2019-08-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dreamquark-ai/tabnet","path":"pytorch_tabnet/utils.py","file_url":"https://github.com/dreamquark-ai/tabnet/blob/HEAD/pytorch_tabnet/utils.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":"145cd251b469e65e","code_sha256_prefix":"145cd251b469e65e","mcp_get_code":{"code_sha256":"145cd251b469e65e"}}],"record_sha256":"c9be5844ff712f5a2022ae96f7f484584bcb13688af724b2dec60aa5146fdd0b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}