{"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/inverse-data-transform","entry":"inverse_data_transform","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":11,"n_papers_ran":11,"n_papers_ran_no_instrument_failure":0,"n_papers_ran_instrument_only":11,"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":4,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":4,"n_samples_unverified":0,"n_samples_fingerprinted":3,"n_places":11,"n_places_pointer_only":7,"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":3,"ran_fixture":1,"ran":0,"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":"2607.17849","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-17849","title":"AlphaOracle: Oracle bone script decipherment via human-workflow-inspired deep learning","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"Yuliang-Liu/AlphaOracle","path":"models/Morphological_analysis/OBSD/ddm.py","file_url":"https://github.com/Yuliang-Liu/AlphaOracle/blob/HEAD/models/Morphological_analysis/OBSD/ddm.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"444601dceca73c5e","code_sha256_prefix":"444601dceca73c5e","mcp_get_code":{"code_sha256":"444601dceca73c5e"}},{"arxiv_id":"2601.04791","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-04791","title":"Measurement-Consistent Langevin Corrector for Stabilizing Latent Diffusion Inverse Problem Solvers","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"FlowDPS-Inverse/FlowDPS","path":"functions/svd_ddnm.py","file_url":"https://github.com/FlowDPS-Inverse/FlowDPS/blob/HEAD/functions/svd_ddnm.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, FlowDPS-Inverse/FlowDPS when it was checked","code_sha256":"39ba407e4342bdd3","code_sha256_prefix":"39ba407e4342bdd3","mcp_get_code":{"code_sha256":"39ba407e4342bdd3"}},{"arxiv_id":"2407.08939","arxiv_id_is_arxiv":true,"paper":"/paper/lightendiffusion-unsupervised-low-light-image","title":"LightenDiffusion: Unsupervised Low-Light Image Enhancement with Latent-Retinex Diffusion Models","date":"2024-07-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jianghaiscu/lightendiffusion","path":"utils/sampling.py","file_url":"https://github.com/jianghaiscu/lightendiffusion/blob/HEAD/utils/sampling.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, jianghaiscu/lightendiffusion when it was checked","code_sha256":"444601dceca73c5e","code_sha256_prefix":"444601dceca73c5e","mcp_get_code":{"code_sha256":"444601dceca73c5e"}},{"arxiv_id":"2406.01781","arxiv_id_is_arxiv":true,"paper":"/paper/deft-efficient-finetuning-of-conditional","title":"DEFT: Efficient Fine-Tuning of Diffusion Models by Learning the Generalised $h$-transform","date":"2024-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alexdenker/deft","path":"htransform/trainer.py","file_url":"https://github.com/alexdenker/deft/blob/HEAD/htransform/trainer.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, alexdenker/deft (NOASSERTION)","code_sha256":"e9bd5fc1351880c9","code_sha256_prefix":"e9bd5fc1351880c9","mcp_get_code":{"code_sha256":"e9bd5fc1351880c9"}},{"arxiv_id":"2406.00684","arxiv_id_is_arxiv":true,"paper":"/paper/deciphering-oracle-bone-language-with","title":"Deciphering Oracle Bone Language with Diffusion Models","date":"2024-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"guanhaisu/OBSD","path":"OBS_Diffusion/models/ddm.py","file_url":"https://github.com/guanhaisu/OBSD/blob/HEAD/OBS_Diffusion/models/ddm.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, guanhaisu/OBSD when it was checked","code_sha256":"444601dceca73c5e","code_sha256_prefix":"444601dceca73c5e","mcp_get_code":{"code_sha256":"444601dceca73c5e"}},{"arxiv_id":"2405.10748","arxiv_id_is_arxiv":true,"paper":"/paper/deep-data-consistency-a-fast-and-robust","title":"Deep Data Consistency: a Fast and Robust Diffusion Model-based Solver for Inverse Problems","date":"2024-05-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hanyu-chen373/deepdataconsistency","path":"functions/svd_ddnm.py","file_url":"https://github.com/hanyu-chen373/deepdataconsistency/blob/HEAD/functions/svd_ddnm.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"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 FlowDPS-Inverse/FlowDPS, and GitHub detected no licence in that repository when it was checked","code_sha256":"39ba407e4342bdd3","code_sha256_prefix":"39ba407e4342bdd3","mcp_get_code":{"code_sha256":"39ba407e4342bdd3"}},{"arxiv_id":"2310.11142","arxiv_id_is_arxiv":true,"paper":"/paper/bayesdiff-estimating-pixel-wise-uncertainty","title":"BayesDiff: Estimating Pixel-wise Uncertainty in Diffusion via Bayesian Inference","date":"2023-10-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"karrykkk/BayesDiff","path":"ddpm_and_guided/ddimUQ_utils.py","file_url":"https://github.com/karrykkk/BayesDiff/blob/HEAD/ddpm_and_guided/ddimUQ_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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, karrykkk/BayesDiff when it was checked","code_sha256":"cd9d1cd248f9be9e","code_sha256_prefix":"cd9d1cd248f9be9e","mcp_get_code":{"code_sha256":"cd9d1cd248f9be9e"}},{"arxiv_id":"2306.00306","arxiv_id_is_arxiv":true,"paper":"/paper/low-light-image-enhancement-with-wavelet","title":"Low-Light Image Enhancement with Wavelet-based Diffusion Models","date":"2023-06-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JianghaiSCU/Diffusion-Low-Light","path":"models/ddm.py","file_url":"https://github.com/JianghaiSCU/Diffusion-Low-Light/blob/HEAD/models/ddm.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"444601dceca73c5e","code_sha256_prefix":"444601dceca73c5e","mcp_get_code":{"code_sha256":"444601dceca73c5e"}},{"arxiv_id":"2303.00354","arxiv_id_is_arxiv":true,"paper":"/paper/unlimited-size-diffusion-restoration","title":"Unlimited-Size Diffusion Restoration","date":"2023-03-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wyhuai/ddnm","path":"functions/svd_ddnm.py","file_url":"https://github.com/wyhuai/ddnm/blob/HEAD/functions/svd_ddnm.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"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 FlowDPS-Inverse/FlowDPS, and GitHub detected no licence in that repository when it was checked","code_sha256":"39ba407e4342bdd3","code_sha256_prefix":"39ba407e4342bdd3","mcp_get_code":{"code_sha256":"39ba407e4342bdd3"}},{"arxiv_id":"2207.14626","arxiv_id_is_arxiv":true,"paper":"/paper/restoring-vision-in-adverse-weather","title":"Restoring Vision in Adverse Weather Conditions with Patch-Based Denoising Diffusion Models","date":"2022-07-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"igitugraz/weatherdiffusion","path":"models/ddm.py","file_url":"https://github.com/igitugraz/weatherdiffusion/blob/HEAD/models/ddm.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"444601dceca73c5e","code_sha256_prefix":"444601dceca73c5e","mcp_get_code":{"code_sha256":"444601dceca73c5e"}},{"arxiv_id":"2105.14951","arxiv_id_is_arxiv":true,"paper":"/paper/snips-solving-noisy-inverse-problems","title":"SNIPS: Solving Noisy Inverse Problems Stochastically","date":"2021-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bahjat-kawar/snips_torch","path":"runners/ncsn_runner.py","file_url":"https://github.com/bahjat-kawar/snips_torch/blob/HEAD/runners/ncsn_runner.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"cd9d1cd248f9be9e","code_sha256_prefix":"cd9d1cd248f9be9e","mcp_get_code":{"code_sha256":"cd9d1cd248f9be9e"}}],"record_sha256":"d8014d440df5d6f69e87256a1f107b219ad8dfc652ef856a1819f483b86dd096","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}