{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:S7Y4ADH7HN57R63GO6PZYWHSM3","short_pith_number":"pith:S7Y4ADH7","schema_version":"1.0","canonical_sha256":"97f1c00cff3b7bf8fb66779f9c58f266c2cbccb2c96997b4b9505b7b8a5cdd99","source":{"kind":"arxiv","id":"2502.12951","version":1},"attestation_state":"computed","paper":{"title":"Guaranteed Conditional Diffusion: 3D Block-based Models for Scientific Data Compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Anand Rangarajan, Jaemoon Lee, Liangji Zhu, Sanjay Ranka, Xiao Li","submitted_at":"2025-02-18T15:33:09Z","abstract_excerpt":"This paper proposes a new compression paradigm -- Guaranteed Conditional Diffusion with Tensor Correction (GCDTC) -- for lossy scientific data compression. The framework is based on recent conditional diffusion (CD) generative models, and it consists of a conditional diffusion model, tensor correction, and error guarantee. Our diffusion model is a mixture of 3D conditioning and 2D denoising U-Net. The approach leverages a 3D block-based compressing module to address spatiotemporal correlations in structured scientific data. Then, the reverse diffusion process for 2D spatial data is conditioned"},"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":"2502.12951","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-02-18T15:33:09Z","cross_cats_sorted":[],"title_canon_sha256":"0e921b9f091ece076c77e8b2094e4c2dcccf318bcc1842c318a5b88da4d9d9e1","abstract_canon_sha256":"e73f3a85ce4cc6a8588df769875bd81f529c6a4a0c34f4af3b6d0344b78fc2c8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:16:26.830021Z","signature_b64":"7MUuxpIgIPdawOq3UxyWvOP40Ej8ZO9WHSCeNox7AmieTtIhbKs+TygwQq5vv+QTXx4UnjyWn7Hgd4wuik4wCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"97f1c00cff3b7bf8fb66779f9c58f266c2cbccb2c96997b4b9505b7b8a5cdd99","last_reissued_at":"2026-07-05T10:16:26.829540Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:16:26.829540Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Guaranteed Conditional Diffusion: 3D Block-based Models for Scientific Data Compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Anand Rangarajan, Jaemoon Lee, Liangji Zhu, Sanjay Ranka, Xiao Li","submitted_at":"2025-02-18T15:33:09Z","abstract_excerpt":"This paper proposes a new compression paradigm -- Guaranteed Conditional Diffusion with Tensor Correction (GCDTC) -- for lossy scientific data compression. The framework is based on recent conditional diffusion (CD) generative models, and it consists of a conditional diffusion model, tensor correction, and error guarantee. Our diffusion model is a mixture of 3D conditioning and 2D denoising U-Net. The approach leverages a 3D block-based compressing module to address spatiotemporal correlations in structured scientific data. Then, the reverse diffusion process for 2D spatial data is conditioned"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.12951","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/2502.12951/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":"2502.12951","created_at":"2026-07-05T10:16:26.829591+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.12951v1","created_at":"2026-07-05T10:16:26.829591+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.12951","created_at":"2026-07-05T10:16:26.829591+00:00"},{"alias_kind":"pith_short_12","alias_value":"S7Y4ADH7HN57","created_at":"2026-07-05T10:16:26.829591+00:00"},{"alias_kind":"pith_short_16","alias_value":"S7Y4ADH7HN57R63G","created_at":"2026-07-05T10:16:26.829591+00:00"},{"alias_kind":"pith_short_8","alias_value":"S7Y4ADH7","created_at":"2026-07-05T10:16:26.829591+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.02129","citing_title":"Generative Latent Diffusion for Efficient Spatiotemporal Data Reduction","ref_index":20,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/S7Y4ADH7HN57R63GO6PZYWHSM3","json":"https://pith.science/pith/S7Y4ADH7HN57R63GO6PZYWHSM3.json","graph_json":"https://pith.science/api/pith-number/S7Y4ADH7HN57R63GO6PZYWHSM3/graph.json","events_json":"https://pith.science/api/pith-number/S7Y4ADH7HN57R63GO6PZYWHSM3/events.json","paper":"https://pith.science/paper/S7Y4ADH7"},"agent_actions":{"view_html":"https://pith.science/pith/S7Y4ADH7HN57R63GO6PZYWHSM3","download_json":"https://pith.science/pith/S7Y4ADH7HN57R63GO6PZYWHSM3.json","view_paper":"https://pith.science/paper/S7Y4ADH7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.12951&json=true","fetch_graph":"https://pith.science/api/pith-number/S7Y4ADH7HN57R63GO6PZYWHSM3/graph.json","fetch_events":"https://pith.science/api/pith-number/S7Y4ADH7HN57R63GO6PZYWHSM3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S7Y4ADH7HN57R63GO6PZYWHSM3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S7Y4ADH7HN57R63GO6PZYWHSM3/action/storage_attestation","attest_author":"https://pith.science/pith/S7Y4ADH7HN57R63GO6PZYWHSM3/action/author_attestation","sign_citation":"https://pith.science/pith/S7Y4ADH7HN57R63GO6PZYWHSM3/action/citation_signature","submit_replication":"https://pith.science/pith/S7Y4ADH7HN57R63GO6PZYWHSM3/action/replication_record"}},"created_at":"2026-07-05T10:16:26.829591+00:00","updated_at":"2026-07-05T10:16:26.829591+00:00"}