{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:7JH6DX43E7INDQPQHPA6BGH3GI","short_pith_number":"pith:7JH6DX43","schema_version":"1.0","canonical_sha256":"fa4fe1df9b27d0d1c1f03bc1e098fb3239971e0a5ee299d0192cb9d05a6dc3de","source":{"kind":"arxiv","id":"2405.10748","version":1},"attestation_state":"computed","paper":{"title":"Deep Data Consistency: a Fast and Robust Diffusion Model-based Solver for Inverse Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Hanyu Chen, Liying Xiao, Zhixiu Hao","submitted_at":"2024-05-17T12:54:43Z","abstract_excerpt":"Diffusion models have become a successful approach for solving various image inverse problems by providing a powerful diffusion prior. Many studies tried to combine the measurement into diffusion by score function replacement, matrix decomposition, or optimization algorithms, but it is hard to balance the data consistency and realness. The slow sampling speed is also a main obstacle to its wide application. To address the challenges, we propose Deep Data Consistency (DDC) to update the data consistency step with a deep learning model when solving inverse problems with diffusion models. By anal"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2405.10748","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2024-05-17T12:54:43Z","cross_cats_sorted":[],"title_canon_sha256":"e24cb6f7de16384aa1529df9471c3eb22ace477b2cb7afa8a7d8c4f9106bc674","abstract_canon_sha256":"1d8710a1f25a7376294f9e3bf606425c2deb4e8ba1217085e0b9e02962fc486a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:20:16.377435Z","signature_b64":"glkS3tP+tJhdDHoQIB2OX8/UryHB2xavCb7oA4+vpFKKq8zWxOiQTmXM4LgeEQxz+nW3e8v+IzG9thsj5mi/AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa4fe1df9b27d0d1c1f03bc1e098fb3239971e0a5ee299d0192cb9d05a6dc3de","last_reissued_at":"2026-07-05T08:20:16.377017Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:20:16.377017Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deep Data Consistency: a Fast and Robust Diffusion Model-based Solver for Inverse Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Hanyu Chen, Liying Xiao, Zhixiu Hao","submitted_at":"2024-05-17T12:54:43Z","abstract_excerpt":"Diffusion models have become a successful approach for solving various image inverse problems by providing a powerful diffusion prior. Many studies tried to combine the measurement into diffusion by score function replacement, matrix decomposition, or optimization algorithms, but it is hard to balance the data consistency and realness. The slow sampling speed is also a main obstacle to its wide application. To address the challenges, we propose Deep Data Consistency (DDC) to update the data consistency step with a deep learning model when solving inverse problems with diffusion models. By anal"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.10748","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2405.10748/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2405.10748","created_at":"2026-07-05T08:20:16.377079+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.10748v1","created_at":"2026-07-05T08:20:16.377079+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.10748","created_at":"2026-07-05T08:20:16.377079+00:00"},{"alias_kind":"pith_short_12","alias_value":"7JH6DX43E7IN","created_at":"2026-07-05T08:20:16.377079+00:00"},{"alias_kind":"pith_short_16","alias_value":"7JH6DX43E7INDQPQ","created_at":"2026-07-05T08:20:16.377079+00:00"},{"alias_kind":"pith_short_8","alias_value":"7JH6DX43","created_at":"2026-07-05T08:20:16.377079+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2607.01176","citing_title":"High-dimensional Embedding Prior for Noisy K-space Domain MRIReconstruction","ref_index":2,"is_internal_anchor":false},{"citing_arxiv_id":"2509.14566","citing_title":"DICE: Diffusion Consensus Equilibrium for Sparse-view CT Reconstruction","ref_index":29,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7JH6DX43E7INDQPQHPA6BGH3GI","json":"https://pith.science/pith/7JH6DX43E7INDQPQHPA6BGH3GI.json","graph_json":"https://pith.science/api/pith-number/7JH6DX43E7INDQPQHPA6BGH3GI/graph.json","events_json":"https://pith.science/api/pith-number/7JH6DX43E7INDQPQHPA6BGH3GI/events.json","paper":"https://pith.science/paper/7JH6DX43"},"agent_actions":{"view_html":"https://pith.science/pith/7JH6DX43E7INDQPQHPA6BGH3GI","download_json":"https://pith.science/pith/7JH6DX43E7INDQPQHPA6BGH3GI.json","view_paper":"https://pith.science/paper/7JH6DX43","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.10748&json=true","fetch_graph":"https://pith.science/api/pith-number/7JH6DX43E7INDQPQHPA6BGH3GI/graph.json","fetch_events":"https://pith.science/api/pith-number/7JH6DX43E7INDQPQHPA6BGH3GI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7JH6DX43E7INDQPQHPA6BGH3GI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7JH6DX43E7INDQPQHPA6BGH3GI/action/storage_attestation","attest_author":"https://pith.science/pith/7JH6DX43E7INDQPQHPA6BGH3GI/action/author_attestation","sign_citation":"https://pith.science/pith/7JH6DX43E7INDQPQHPA6BGH3GI/action/citation_signature","submit_replication":"https://pith.science/pith/7JH6DX43E7INDQPQHPA6BGH3GI/action/replication_record"}},"created_at":"2026-07-05T08:20:16.377079+00:00","updated_at":"2026-07-05T08:20:16.377079+00:00"}