{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:MT3Q25WZV377YNZVMJDYOUZVID","short_pith_number":"pith:MT3Q25WZ","schema_version":"1.0","canonical_sha256":"64f70d76d9aefffc3735624787533540ccf367cbca28db42cb3f64c7a658ffd5","source":{"kind":"arxiv","id":"2502.04093","version":3},"attestation_state":"computed","paper":{"title":"IPComp: Interpolation Based Progressive Lossy Compression for Scientific Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Franck Cappello, Jiajun Huang, Jinyang Liu, Kai Zhao, Longtao Zhang, Ruoyu Li, Sheng Di, Ximiao Li, Zhuoxun Yang","submitted_at":"2025-02-06T14:07:26Z","abstract_excerpt":"Compression is a crucial solution for data reduction in modern scientific applications due to the exponential growth of data from simulations, experiments, and observations. Compression with progressive retrieval capability allows users to access coarse approximations of data quickly and then incrementally refine these approximations to higher fidelity. Existing progressive compression solutions suffer from low reduction ratios or high operation costs, effectively undermining the approach's benefits. In this paper, we propose the first-ever interpolation-based progressive lossy compression sol"},"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.04093","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2025-02-06T14:07:26Z","cross_cats_sorted":[],"title_canon_sha256":"dde4a435022da8547a1e4695fbea169faa84247e58976b094597c9edf64ea9d0","abstract_canon_sha256":"1e0d5da36ff3516c5108ca55ebb66e44a08f6f1671c78121578184427bbe9fb6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:44:42.803888Z","signature_b64":"ubYYoSdUF3nQPsV5Nwe7VPMsVhGyNvPGZkTyablJfToruD+wi0YwuHGbyhJAR5gvA862nHyLjEPgBYR4FE/sDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64f70d76d9aefffc3735624787533540ccf367cbca28db42cb3f64c7a658ffd5","last_reissued_at":"2026-07-05T10:44:42.803421Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:44:42.803421Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"IPComp: Interpolation Based Progressive Lossy Compression for Scientific Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Franck Cappello, Jiajun Huang, Jinyang Liu, Kai Zhao, Longtao Zhang, Ruoyu Li, Sheng Di, Ximiao Li, Zhuoxun Yang","submitted_at":"2025-02-06T14:07:26Z","abstract_excerpt":"Compression is a crucial solution for data reduction in modern scientific applications due to the exponential growth of data from simulations, experiments, and observations. Compression with progressive retrieval capability allows users to access coarse approximations of data quickly and then incrementally refine these approximations to higher fidelity. Existing progressive compression solutions suffer from low reduction ratios or high operation costs, effectively undermining the approach's benefits. In this paper, we propose the first-ever interpolation-based progressive lossy compression sol"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.04093","kind":"arxiv","version":3},"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.04093/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.04093","created_at":"2026-07-05T10:44:42.803485+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.04093v3","created_at":"2026-07-05T10:44:42.803485+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.04093","created_at":"2026-07-05T10:44:42.803485+00:00"},{"alias_kind":"pith_short_12","alias_value":"MT3Q25WZV377","created_at":"2026-07-05T10:44:42.803485+00:00"},{"alias_kind":"pith_short_16","alias_value":"MT3Q25WZV377YNZV","created_at":"2026-07-05T10:44:42.803485+00:00"},{"alias_kind":"pith_short_8","alias_value":"MT3Q25WZ","created_at":"2026-07-05T10:44:42.803485+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.01626","citing_title":"STZ: A High Quality and High Speed Streaming Lossy Compression Framework for Scientific Data","ref_index":45,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MT3Q25WZV377YNZVMJDYOUZVID","json":"https://pith.science/pith/MT3Q25WZV377YNZVMJDYOUZVID.json","graph_json":"https://pith.science/api/pith-number/MT3Q25WZV377YNZVMJDYOUZVID/graph.json","events_json":"https://pith.science/api/pith-number/MT3Q25WZV377YNZVMJDYOUZVID/events.json","paper":"https://pith.science/paper/MT3Q25WZ"},"agent_actions":{"view_html":"https://pith.science/pith/MT3Q25WZV377YNZVMJDYOUZVID","download_json":"https://pith.science/pith/MT3Q25WZV377YNZVMJDYOUZVID.json","view_paper":"https://pith.science/paper/MT3Q25WZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.04093&json=true","fetch_graph":"https://pith.science/api/pith-number/MT3Q25WZV377YNZVMJDYOUZVID/graph.json","fetch_events":"https://pith.science/api/pith-number/MT3Q25WZV377YNZVMJDYOUZVID/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MT3Q25WZV377YNZVMJDYOUZVID/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MT3Q25WZV377YNZVMJDYOUZVID/action/storage_attestation","attest_author":"https://pith.science/pith/MT3Q25WZV377YNZVMJDYOUZVID/action/author_attestation","sign_citation":"https://pith.science/pith/MT3Q25WZV377YNZVMJDYOUZVID/action/citation_signature","submit_replication":"https://pith.science/pith/MT3Q25WZV377YNZVMJDYOUZVID/action/replication_record"}},"created_at":"2026-07-05T10:44:42.803485+00:00","updated_at":"2026-07-05T10:44:42.803485+00:00"}