{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:FJZXLHNJTUX47SX4P74LKRQ56L","short_pith_number":"pith:FJZXLHNJ","canonical_record":{"source":{"id":"2608.08386","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.HC","submitted_at":"2026-08-09T00:45:52Z","cross_cats_sorted":["cs.GR"],"title_canon_sha256":"046dc7147c9997e7ad6abfa039445161074eb035da41160d702e55a1d18f0ea4","abstract_canon_sha256":"acf6fd3d0fbb689841a6d25fbf15e070e9ccea9f9096909df641cf871a03bbcf"},"schema_version":"1.0"},"canonical_sha256":"2a73759da99d2fcfcafc7ff8b5461df2cb1105fd0b58d0afbed2105478d837a3","source":{"kind":"arxiv","id":"2608.08386","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.08386","created_at":"2026-08-11T01:22:30Z"},{"alias_kind":"arxiv_version","alias_value":"2608.08386v1","created_at":"2026-08-11T01:22:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.08386","created_at":"2026-08-11T01:22:30Z"},{"alias_kind":"pith_short_12","alias_value":"FJZXLHNJTUX4","created_at":"2026-08-11T01:22:30Z"},{"alias_kind":"pith_short_16","alias_value":"FJZXLHNJTUX47SX4","created_at":"2026-08-11T01:22:30Z"},{"alias_kind":"pith_short_8","alias_value":"FJZXLHNJ","created_at":"2026-08-11T01:22:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:FJZXLHNJTUX47SX4P74LKRQ56L","target":"record","payload":{"canonical_record":{"source":{"id":"2608.08386","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.HC","submitted_at":"2026-08-09T00:45:52Z","cross_cats_sorted":["cs.GR"],"title_canon_sha256":"046dc7147c9997e7ad6abfa039445161074eb035da41160d702e55a1d18f0ea4","abstract_canon_sha256":"acf6fd3d0fbb689841a6d25fbf15e070e9ccea9f9096909df641cf871a03bbcf"},"schema_version":"1.0"},"canonical_sha256":"2a73759da99d2fcfcafc7ff8b5461df2cb1105fd0b58d0afbed2105478d837a3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-11T01:22:30.143511Z","signature_b64":"u5vZyvBiGVeyBcRuOG29Wz2izc7y5YJQj/GDWEAa/5b8jOhetqoE2sSWupG2d0dfxOvQ2MsYnGog9y+OBgs/Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a73759da99d2fcfcafc7ff8b5461df2cb1105fd0b58d0afbed2105478d837a3","last_reissued_at":"2026-08-11T01:22:30.140978Z","signature_status":"signed_v1","first_computed_at":"2026-08-11T01:22:30.140978Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2608.08386","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-11T01:22:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8HalrNznxE+AR3N9hpsLDCMD8kFPnIcWF2gQ1Lj6zGmXgNDmLZcbu//d5xJVOYcmDwZalnyuh+OBfA1EGwh+AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T17:10:10.994181Z"},"content_sha256":"61b76e2bdd1ebaab07852ed7f1e7de700b5dbd5d291c8e0544e674589252f45d","schema_version":"1.0","event_id":"sha256:61b76e2bdd1ebaab07852ed7f1e7de700b5dbd5d291c8e0544e674589252f45d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:FJZXLHNJTUX47SX4P74LKRQ56L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"FZ-VIS: A Visual Analytics Framework for Quantities-of-Interest-Aware Scientific Lossy Compression","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.GR"],"primary_cat":"cs.HC","authors_text":"Bei Wang, Congrong Ren, Franck Cappello, Guoxi Liu, Hanqi Guo, Robert Underwood, Sheng Di, Xin Liang, Yuxiao Li","submitted_at":"2026-08-09T00:45:52Z","abstract_excerpt":"Modern scientific simulations generate massive volumes of data, making lossy compression essential for efficient storage and transmission. However, preserving critical quantities of interest (QoIs) under lossy compression is inherently data- and task-dependent, requiring domain scientists to navigate complex trade-offs between compression ratio and data fidelity. Exploring these trade-offs often involves large design and evaluation spaces, motivating human-in-the-loop approaches that combine interactive exploration with quantitative analysis. To address this challenge, we present FZ-VIS, an in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.08386","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/2608.08386/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-11T01:22:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XCtph9V6qWoVHFOd8eem6SHf8YNiQ5/dM9qI4I0mNgjXTVxBvQhU6bIe6AobYBfZCT5vf04F/jOXxN2qS7mxAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T17:10:10.994534Z"},"content_sha256":"50c0e5aca0493b68a0a55ee48003eda93f284192df104fb3a6c1baf63c4b0925","schema_version":"1.0","event_id":"sha256:50c0e5aca0493b68a0a55ee48003eda93f284192df104fb3a6c1baf63c4b0925"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:FJZXLHNJTUX47SX4P74LKRQ56L","target":"integrity","payload":{"note":"Identifier '10.1109/pacificvis.2018' is syntactically valid but the DOI registry (doi.org) returned 404, and Crossref / OpenAlex / internal corpus also have no record. The cited work could not be located through any authoritative source.","snippet":"M. Soler, M. Plainchault, B. Conche, and J. Tierny. Topologically Controlled Lossy Compression. In2018 IEEE Pacific Visualization Symposium (PacificVis), pp. 46–55, 2018. doi: 10.1109/PacificVis.2018. 00015 2","arxiv_id":"2608.08386","detector":"doi_compliance","evidence":{"doi":"10.1109/pacificvis.2018","arxiv_id":null,"ref_index":46,"raw_excerpt":"M. Soler, M. Plainchault, B. Conche, and J. Tierny. Topologically Controlled Lossy Compression. In2018 IEEE Pacific Visualization Symposium (PacificVis), pp. 46–55, 2018. doi: 10.1109/PacificVis.2018. 00015 2","parse_status":"well_formed","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"],"resolution_status":"hard_miss"},"severity":"critical","ref_index":46,"audited_at":"2026-08-14T05:29:30.642302Z","event_type":"pith.integrity.v1","detected_doi":"10.1109/pacificvis.2018","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"600163466dc080e94498ecb508bb686994a73c292271189c83e09b079aac7ce4","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":19679,"payload_sha256":"f0ff21b63fd7266924a73937c55dcda84eb18a2ba6512f1982fa13f9c6cbe5f1","signature_b64":"IWvYkta5SZWm4FAZ8ITLBj+rZXjAs/U3sW1w6dEYwKzW5qab9lIZkluVoJWxOrFq3FvaViEkBoU4+lbLq9t5Dg==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-14T05:33:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9WIVlwvLb8w0sgmABuLEbOGanZJtcpPwAdpvWHu4LD4ssnq6QQVtC29+H2GReYMnawhoz4QOJ+jtqazjn8msAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T17:10:10.997275Z"},"content_sha256":"467c953b753c883e6d6cff2cfbafcf81889f5b3bbb5b806b757b456bf4efdce9","schema_version":"1.0","event_id":"sha256:467c953b753c883e6d6cff2cfbafcf81889f5b3bbb5b806b757b456bf4efdce9"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:FJZXLHNJTUX47SX4P74LKRQ56L","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1109/tvcg.2024.3456337) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Y . Li, X. Liang, B. Wang, Y . Qiu, L. Yan, and H. Guo. MSz: An Efficient Parallel Algorithm for Correcting Morse-Smale Segmentations in Error- Bounded Lossy Compressors.IEEE Transactions on Visualization and Computer Graphics, 31(1):130–14","arxiv_id":"2608.08386","detector":"doi_compliance","evidence":{"ref_index":25,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"10.1109/tvcg.2024","reconstructed_doi":"10.1109/tvcg.2024.3456337"},"severity":"advisory","ref_index":25,"audited_at":"2026-08-14T05:29:30.642302Z","event_type":"pith.integrity.v1","detected_doi":"10.1109/tvcg.2024.3456337","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"7f37a7d8e058939ac062b1dea8dfe45feeebedaf0dc79b58b229be99e24030d0","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":19678,"payload_sha256":"3c5632b8bd697ed57c8a366638e9829c528d430e50918665ee8673da9b09d1fd","signature_b64":"tHepclepwNHHktjkP5uDdc0014lke33pkmeyB5gHB7+Eas6WKHUjJgWTAGTLoveK4O/MjfyJwyleHGmjg/5OAQ==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-14T05:33:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kh2neap5LMR1kFWV6Qy6ZQ6K1rmFHpAX1Fg/yRJOsKh8daDbcpkpr4itOeEVRaYEEYZ0gXNZmL2Udmagk9YZDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T17:10:10.997519Z"},"content_sha256":"3d3b6caedfb1fe784a65a555f9185d94ae1f75417edee85a2a4cfd849bb2dd15","schema_version":"1.0","event_id":"sha256:3d3b6caedfb1fe784a65a555f9185d94ae1f75417edee85a2a4cfd849bb2dd15"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:FJZXLHNJTUX47SX4P74LKRQ56L","target":"integrity","payload":{"note":"Identifier '10.1109/tpds.2017' is syntactically valid but the DOI registry (doi.org) returned 404, and Crossref / OpenAlex / internal corpus also have no record. The cited work could not be located through any authoritative source.","snippet":"S. Di and F. Cappello. Optimization of Error-Bounded Lossy Compression for Hard-to-Compress HPC Data.IEEE Transactions on Parallel and Distributed Systems, 29(1):129–143, Jan. 2018. doi: 10.1109/TPDS.2017. 2749300 2","arxiv_id":"2608.08386","detector":"doi_compliance","evidence":{"doi":"10.1109/tpds.2017","arxiv_id":null,"ref_index":9,"raw_excerpt":"S. Di and F. Cappello. Optimization of Error-Bounded Lossy Compression for Hard-to-Compress HPC Data.IEEE Transactions on Parallel and Distributed Systems, 29(1):129–143, Jan. 2018. doi: 10.1109/TPDS.2017. 2749300 2","parse_status":"well_formed","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"],"resolution_status":"hard_miss"},"severity":"critical","ref_index":9,"audited_at":"2026-08-14T05:29:30.642302Z","event_type":"pith.integrity.v1","detected_doi":"10.1109/tpds.2017","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"28a15e94c8bac8e9408f42ba98da53611decc060e4fdc944e3ff82e6b8648a6b","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":19677,"payload_sha256":"f844326c486ceca06ab054d7d4973cb0b39ee0cbddb116d6ef73a15befe1cb1c","signature_b64":"xT9/4V7HtITNBO/jz6NbptOhV7Zjb6buEsR1WJBLawsy+1vXfBxaL0l8sMWC7jpJgsJH7R7oXVFbLuEgXYEhDg==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-14T05:33:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z5CKygno1lpOBkw4puhzqS2vBuThs13O+fkOTje7L9bXbjKvCLQJnLUnXSUdabrvip0iy3wH/F2ckLK3y5oTCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T17:10:10.997754Z"},"content_sha256":"f8ec7d0bec00c70a25c635d90c8ee64c09df5c766985ca59534b34df730521d5","schema_version":"1.0","event_id":"sha256:f8ec7d0bec00c70a25c635d90c8ee64c09df5c766985ca59534b34df730521d5"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:FJZXLHNJTUX47SX4P74LKRQ56L","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1109/IPDPS.2016.112) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"S. Di and F. Cappello. Fast Error-Bounded Lossy HPC Data Compression with SZ. In2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS), pp. 730–739, May 2016. doi: 10.1109/IPDPS.2016. 11 2","arxiv_id":"2608.08386","detector":"doi_compliance","evidence":{"ref_index":8,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"10.1109/ipdps.2016","reconstructed_doi":"10.1109/IPDPS.2016.112"},"severity":"advisory","ref_index":8,"audited_at":"2026-08-14T05:29:30.642302Z","event_type":"pith.integrity.v1","detected_doi":"10.1109/IPDPS.2016.112","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"36af73d8ed8c0ff5c7b26b19f7c31d3d024ac27db249bbdb69956c138a6bd87a","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":19676,"payload_sha256":"2662908f7f70f17466f57b445af5cc949d556b1202a2e50c92c93b25843f4894","signature_b64":"MhQOjwJSZgmPvtWFUkn+105w5Sb3Zdn8u1+RtBYSy/MbhUv8E6ZuiN/YnIBl+c23/YKio6fzGIKFcqB/k4EYAQ==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-14T05:33:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K0Lt3qwYLJlyIrvq67chvCQd4pPAaMzGRZ1Bvp35I9MqH8C4tBLofqUfVYwx3ASpH6BIt8Mhfn8WytNd7HS7CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T17:10:10.997975Z"},"content_sha256":"19ff3f79d49f427915c3607330b77c6631b5d3c65c68caf2f1172c027b2cd876","schema_version":"1.0","event_id":"sha256:19ff3f79d49f427915c3607330b77c6631b5d3c65c68caf2f1172c027b2cd876"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FJZXLHNJTUX47SX4P74LKRQ56L/bundle.json","state_url":"https://pith.science/pith/FJZXLHNJTUX47SX4P74LKRQ56L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FJZXLHNJTUX47SX4P74LKRQ56L/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-21T17:10:10Z","links":{"resolver":"https://pith.science/pith/FJZXLHNJTUX47SX4P74LKRQ56L","bundle":"https://pith.science/pith/FJZXLHNJTUX47SX4P74LKRQ56L/bundle.json","state":"https://pith.science/pith/FJZXLHNJTUX47SX4P74LKRQ56L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FJZXLHNJTUX47SX4P74LKRQ56L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:FJZXLHNJTUX47SX4P74LKRQ56L","merge_version":"pith-open-graph-merge-v1","event_count":6,"valid_event_count":6,"invalid_event_count":0,"equivocation_count":1,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"acf6fd3d0fbb689841a6d25fbf15e070e9ccea9f9096909df641cf871a03bbcf","cross_cats_sorted":["cs.GR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.HC","submitted_at":"2026-08-09T00:45:52Z","title_canon_sha256":"046dc7147c9997e7ad6abfa039445161074eb035da41160d702e55a1d18f0ea4"},"schema_version":"1.0","source":{"id":"2608.08386","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.08386","created_at":"2026-08-11T01:22:30Z"},{"alias_kind":"arxiv_version","alias_value":"2608.08386v1","created_at":"2026-08-11T01:22:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.08386","created_at":"2026-08-11T01:22:30Z"},{"alias_kind":"pith_short_12","alias_value":"FJZXLHNJTUX4","created_at":"2026-08-11T01:22:30Z"},{"alias_kind":"pith_short_16","alias_value":"FJZXLHNJTUX47SX4","created_at":"2026-08-11T01:22:30Z"},{"alias_kind":"pith_short_8","alias_value":"FJZXLHNJ","created_at":"2026-08-11T01:22:30Z"}],"graph_snapshots":[{"event_id":"sha256:50c0e5aca0493b68a0a55ee48003eda93f284192df104fb3a6c1baf63c4b0925","target":"graph","created_at":"2026-08-11T01:22:30Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2608.08386/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Modern scientific simulations generate massive volumes of data, making lossy compression essential for efficient storage and transmission. However, preserving critical quantities of interest (QoIs) under lossy compression is inherently data- and task-dependent, requiring domain scientists to navigate complex trade-offs between compression ratio and data fidelity. Exploring these trade-offs often involves large design and evaluation spaces, motivating human-in-the-loop approaches that combine interactive exploration with quantitative analysis. To address this challenge, we present FZ-VIS, an in","authors_text":"Bei Wang, Congrong Ren, Franck Cappello, Guoxi Liu, Hanqi Guo, Robert Underwood, Sheng Di, Xin Liang, Yuxiao Li","cross_cats":["cs.GR"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.HC","submitted_at":"2026-08-09T00:45:52Z","title":"FZ-VIS: A Visual Analytics Framework for Quantities-of-Interest-Aware Scientific Lossy Compression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.08386","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:61b76e2bdd1ebaab07852ed7f1e7de700b5dbd5d291c8e0544e674589252f45d","target":"record","created_at":"2026-08-11T01:22:30Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"acf6fd3d0fbb689841a6d25fbf15e070e9ccea9f9096909df641cf871a03bbcf","cross_cats_sorted":["cs.GR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.HC","submitted_at":"2026-08-09T00:45:52Z","title_canon_sha256":"046dc7147c9997e7ad6abfa039445161074eb035da41160d702e55a1d18f0ea4"},"schema_version":"1.0","source":{"id":"2608.08386","kind":"arxiv","version":1}},"canonical_sha256":"2a73759da99d2fcfcafc7ff8b5461df2cb1105fd0b58d0afbed2105478d837a3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2a73759da99d2fcfcafc7ff8b5461df2cb1105fd0b58d0afbed2105478d837a3","first_computed_at":"2026-08-11T01:22:30.140978Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-11T01:22:30.140978Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"u5vZyvBiGVeyBcRuOG29Wz2izc7y5YJQj/GDWEAa/5b8jOhetqoE2sSWupG2d0dfxOvQ2MsYnGog9y+OBgs/Dg==","signature_status":"signed_v1","signed_at":"2026-08-11T01:22:30.143511Z","signed_message":"canonical_sha256_bytes"},"source_id":"2608.08386","source_kind":"arxiv","source_version":1}}},"equivocations":[{"signer_id":"pith.science","event_type":"integrity_finding","target":"integrity","event_ids":["sha256:19ff3f79d49f427915c3607330b77c6631b5d3c65c68caf2f1172c027b2cd876","sha256:3d3b6caedfb1fe784a65a555f9185d94ae1f75417edee85a2a4cfd849bb2dd15","sha256:467c953b753c883e6d6cff2cfbafcf81889f5b3bbb5b806b757b456bf4efdce9","sha256:f8ec7d0bec00c70a25c635d90c8ee64c09df5c766985ca59534b34df730521d5"]}],"invalid_events":[],"applied_event_ids":["sha256:61b76e2bdd1ebaab07852ed7f1e7de700b5dbd5d291c8e0544e674589252f45d","sha256:50c0e5aca0493b68a0a55ee48003eda93f284192df104fb3a6c1baf63c4b0925"],"state_sha256":"5b23ad552f500d574eb182f5f9a29dbe170eac49a06b3cc6be365063cdcbfed3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nZxE0PWD9E2bMzHo6htWa0fSxJhsjZcUFZPtKul4/4wxdHNPk100c7Zcy+AVnKdgkb06KQd8gpKunPDWaW0qBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T17:10:11.000069Z","bundle_sha256":"8903ceb67a964c6110d36106d97399d0b8d00799e12d5a25130b58ee44cc357f"}}