{"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/noise-like","entry":"noise_like","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":10,"n_papers_ran":10,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":8,"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":9,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":7,"n_samples_unverified":0,"n_samples_fingerprinted":1,"n_places":13,"n_places_pointer_only":4,"n_places_pointer_only_link_open":0,"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":7,"ran":2,"unverified":0},"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":"2606.28134","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-28134","title":"Beyond Sparse Supervision: Diffusion-Guided Learning for Few-Shot Graph Fraud Detection","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"llmllmllm/ADC-GNN","path":"diffusion.py","file_url":"https://github.com/llmllmllm/ADC-GNN/blob/HEAD/diffusion.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, llmllmllm/ADC-GNN when it was checked","code_sha256":"05b70adbf0dd99ce","code_sha256_prefix":"05b70adbf0dd99ce","mcp_get_code":{"code_sha256":"05b70adbf0dd99ce"}},{"arxiv_id":"2509.22583","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2509-22583","title":"Orochi: Versatile Biomedical Image Processor","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"BioMedAI-UCSC/InverseSR","path":"project/models/ddim.py","file_url":"https://github.com/BioMedAI-UCSC/InverseSR/blob/HEAD/project/models/ddim.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"11184d08b418b129","code_sha256_prefix":"11184d08b418b129","mcp_get_code":{"code_sha256":"11184d08b418b129"}},{"arxiv_id":"2502.07005","arxiv_id_is_arxiv":true,"paper":"/paper/geometry-aware-rl-for-manipulation-of-varying","title":"Geometry-aware RL for Manipulation of Varying Shapes and Deformable Objects","date":"2025-02-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thobotics/geometry_rl","path":"geometry_rl/modules/pyg_data/utils.py","file_url":"https://github.com/thobotics/geometry_rl/blob/HEAD/geometry_rl/modules/pyg_data/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c1641728823d6467","code_sha256_prefix":"c1641728823d6467","mcp_get_code":{"code_sha256":"c1641728823d6467"}},{"arxiv_id":"2403.05751","arxiv_id_is_arxiv":true,"paper":"/paper/mg-tsd-multi-granularity-time-series","title":"MG-TSD: Multi-Granularity Time Series Diffusion Models with Guided Learning Process","date":"2024-03-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Hundredl/MG-TSD","path":"src/mgtsd_module.py","file_url":"https://github.com/Hundredl/MG-TSD/blob/HEAD/src/mgtsd_module.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c5fe8ab6ba5d7df5","code_sha256_prefix":"c5fe8ab6ba5d7df5","mcp_get_code":{"code_sha256":"c5fe8ab6ba5d7df5"}},{"arxiv_id":"2401.12517","arxiv_id_is_arxiv":true,"paper":"/paper/ddmi-domain-agnostic-latent-diffusion-models","title":"DDMI: Domain-Agnostic Latent Diffusion Models for Synthesizing High-Quality Implicit Neural Representations","date":"2024-01-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mlvlab/DDMI","path":"diffusion/ddpm.py","file_url":"https://github.com/mlvlab/DDMI/blob/HEAD/diffusion/ddpm.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"104973640b230918","code_sha256_prefix":"104973640b230918","mcp_get_code":{"code_sha256":"104973640b230918"}},{"arxiv_id":"2401.09047","arxiv_id_is_arxiv":true,"paper":"/paper/videocrafter2-overcoming-data-limitations-for","title":"VideoCrafter2: Overcoming Data Limitations for High-Quality Video Diffusion Models","date":"2024-01-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"videocrafter/videocrafter","path":"lvdm/models/ddpm3d.py","file_url":"https://github.com/videocrafter/videocrafter/blob/HEAD/lvdm/models/ddpm3d.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, videocrafter/videocrafter (NOASSERTION)","code_sha256":"f791d43d666fedd1","code_sha256_prefix":"f791d43d666fedd1","mcp_get_code":{"code_sha256":"f791d43d666fedd1"}},{"arxiv_id":"2308.12465","arxiv_id_is_arxiv":true,"paper":"/paper/inversesr-3d-brain-mri-super-resolution-using","title":"InverseSR: 3D Brain MRI Super-Resolution Using a Latent Diffusion Model","date":"2023-08-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"biomedai-ucsc/inversesr","path":"project/models/ddim.py","file_url":"https://github.com/biomedai-ucsc/inversesr/blob/HEAD/project/models/ddim.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"11184d08b418b129","code_sha256_prefix":"11184d08b418b129","mcp_get_code":{"code_sha256":"11184d08b418b129"}},{"arxiv_id":"2301.12503","arxiv_id_is_arxiv":true,"paper":"/paper/audioldm-text-to-audio-generation-with-latent","title":"AudioLDM: Text-to-Audio Generation with Latent Diffusion Models","date":"2023-01-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"haoheliu/AudioLDM","path":"audioldm/ldm.py","file_url":"https://github.com/haoheliu/AudioLDM/blob/HEAD/audioldm/ldm.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"well_formed","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, haoheliu/AudioLDM (NOASSERTION)","code_sha256":"2d7200ac60d9a4bd","code_sha256_prefix":"2d7200ac60d9a4bd","mcp_get_code":{"code_sha256":"2d7200ac60d9a4bd"}},{"arxiv_id":"2209.14566","arxiv_id_is_arxiv":true,"paper":"/paper/diffusion-adversarial-representation-learning","title":"Diffusion Adversarial Representation Learning for Self-supervised Vessel Segmentation","date":"2022-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bispl-kaist/DARL","path":"model/ddpm_modules/diffusion_seg.py","file_url":"https://github.com/bispl-kaist/DARL/blob/HEAD/model/ddpm_modules/diffusion_seg.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c5fe8ab6ba5d7df5","code_sha256_prefix":"c5fe8ab6ba5d7df5","mcp_get_code":{"code_sha256":"c5fe8ab6ba5d7df5"}},{"arxiv_id":"2006.11239","arxiv_id_is_arxiv":true,"paper":"/paper/denoising-diffusion-probabilistic-models","title":"Denoising Diffusion Probabilistic Models","date":"2020-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vainf/diff-pruning","path":"ldm_exp/ldm/models/diffusion/ddpm.py","file_url":"https://github.com/vainf/diff-pruning/blob/HEAD/ldm_exp/ldm/models/diffusion/ddpm.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"104973640b230918","code_sha256_prefix":"104973640b230918","mcp_get_code":{"code_sha256":"104973640b230918"}},{"arxiv_id":"2006.11239","arxiv_id_is_arxiv":true,"paper":"/paper/denoising-diffusion-probabilistic-models","title":"Denoising Diffusion Probabilistic Models","date":"2020-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tiwarylab/DDPM_REMD","path":"denoising_diffusion_pytorch/denoising_diffusion_pytorch.py","file_url":"https://github.com/tiwarylab/DDPM_REMD/blob/HEAD/denoising_diffusion_pytorch/denoising_diffusion_pytorch.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"11184d08b418b129","code_sha256_prefix":"11184d08b418b129","mcp_get_code":{"code_sha256":"11184d08b418b129"}},{"arxiv_id":"2006.11239","arxiv_id_is_arxiv":true,"paper":"/paper/denoising-diffusion-probabilistic-models","title":"Denoising Diffusion Probabilistic Models","date":"2020-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"keonlee9420/DiffGAN-TTS","path":"model/diffusion.py","file_url":"https://github.com/keonlee9420/DiffGAN-TTS/blob/HEAD/model/diffusion.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a68547100f9ac8f8","code_sha256_prefix":"a68547100f9ac8f8","mcp_get_code":{"code_sha256":"a68547100f9ac8f8"}},{"arxiv_id":"2006.11239","arxiv_id_is_arxiv":true,"paper":"/paper/denoising-diffusion-probabilistic-models","title":"Denoising Diffusion Probabilistic Models","date":"2020-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hojonathanho/diffusion","path":"diffusion_tf/diffusion_utils.py","file_url":"https://github.com/hojonathanho/diffusion/blob/HEAD/diffusion_tf/diffusion_utils.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, hojonathanho/diffusion when it was checked","code_sha256":"ac0b112cced85e41","code_sha256_prefix":"ac0b112cced85e41","mcp_get_code":{"code_sha256":"ac0b112cced85e41"}}],"record_sha256":"9ea047601d8d5314f1441d820f2d353eb7925b2f5ee70e39be04146cae54090e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}