{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:EBPXMTFHOEFDNDEJZS4U47RQPK","short_pith_number":"pith:EBPXMTFH","canonical_record":{"source":{"id":"2604.09173","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2026-04-10T09:58:17Z","cross_cats_sorted":["cs.OS"],"title_canon_sha256":"7a3086fbafc1e369a8721945f04bd80b8c59037f4396ebc982b7b72e62623c01","abstract_canon_sha256":"59be6a55d422d9655fb28b3d83bcda2ad32cd4b00e36e2300851c48bcf5e3d5c"},"schema_version":"1.0"},"canonical_sha256":"205f764ca7710a368c89ccb94e7e307aa5eb53301296fb98246614321020601f","source":{"kind":"arxiv","id":"2604.09173","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.09173","created_at":"2026-05-20T00:01:41Z"},{"alias_kind":"arxiv_version","alias_value":"2604.09173v2","created_at":"2026-05-20T00:01:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.09173","created_at":"2026-05-20T00:01:41Z"},{"alias_kind":"pith_short_12","alias_value":"EBPXMTFHOEFD","created_at":"2026-05-20T00:01:41Z"},{"alias_kind":"pith_short_16","alias_value":"EBPXMTFHOEFDNDEJ","created_at":"2026-05-20T00:01:41Z"},{"alias_kind":"pith_short_8","alias_value":"EBPXMTFH","created_at":"2026-05-20T00:01:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:EBPXMTFHOEFDNDEJZS4U47RQPK","target":"record","payload":{"canonical_record":{"source":{"id":"2604.09173","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2026-04-10T09:58:17Z","cross_cats_sorted":["cs.OS"],"title_canon_sha256":"7a3086fbafc1e369a8721945f04bd80b8c59037f4396ebc982b7b72e62623c01","abstract_canon_sha256":"59be6a55d422d9655fb28b3d83bcda2ad32cd4b00e36e2300851c48bcf5e3d5c"},"schema_version":"1.0"},"canonical_sha256":"205f764ca7710a368c89ccb94e7e307aa5eb53301296fb98246614321020601f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:01:41.184762Z","signature_b64":"fAx71KjcTZTVLeUJQDlG5U8VcgSoGyiDN4U1CLaDrUR+31jtRN9F/fb8jdHHHlPgfUBLlM3k7SRQY18r9FFwDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"205f764ca7710a368c89ccb94e7e307aa5eb53301296fb98246614321020601f","last_reissued_at":"2026-05-20T00:01:41.183984Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:01:41.183984Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2604.09173","source_version":2,"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-05-20T00:01:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ryd/vEPnUW5ZvPWoDlSkht1UlwcoSSYJ6OyqWHzjmZElkJb6p3hL2gljuVwgGJNB9dD0h43yeFlqF/L737UvCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:46:33.869920Z"},"content_sha256":"50e2cdaf2a1ad09831ec1c4a890c04836c6a14f75f96919cd1ee8ab4ffcedaae","schema_version":"1.0","event_id":"sha256:50e2cdaf2a1ad09831ec1c4a890c04836c6a14f75f96919cd1ee8ab4ffcedaae"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:EBPXMTFHOEFDNDEJZS4U47RQPK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decoupling Vector Data and Index Storage for Space Efficiency","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"COMPASS decouples vector data from index metadata to compress each separately, cutting storage by up to 58.7% while keeping search and update performance competitive.","cross_cats":["cs.OS"],"primary_cat":"cs.DB","authors_text":"Di Wu, Juncheng Zhang, Patrick P. C. Lee, Rui Yang, Yanjing Ren, Yuanming Ren","submitted_at":"2026-04-10T09:58:17Z","abstract_excerpt":"Managing large-scale vector datasets with disk-resident graph approximate nearest neighbor search (ANNS) systems incurs substantial storage overhead due to the co-location of vector data and auxiliary index metadata, which prevents the storage layer from exploiting their distinct compressibility. We present COMPASS, a component-aware compressed storage framework for disk-resident graph vector search. Leveraging data-index decoupling as a foundation, COMPASS losslessly compresses each component according to its distinct compressibility characteristics, thereby significantly reducing storage spa"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"COMPASS reduces storage space by up to 58.7%, while delivering improved or competitive search and update performance compared to state-of-the-art disk-resident graph ANNS systems.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The assumption that vector data and auxiliary index metadata possess sufficiently distinct compressibility characteristics that can be exploited independently after decoupling without introducing unacceptable overhead in search or update paths.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"COMPASS decouples vector data and index storage in disk-resident graph ANNS systems to enable component-specific lossless compression, reducing space by up to 58.7% with improved or competitive performance.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"COMPASS decouples vector data from index metadata to compress each separately, cutting storage by up to 58.7% while keeping search and update performance competitive.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"79dd99846a81ef628aef563cec3d483cccd6b754c15f0f123ab3ea1acffc6452"},"source":{"id":"2604.09173","kind":"arxiv","version":2},"verdict":{"id":"89b35d54-671b-480c-aa1f-b13a922d473d","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T18:19:24.413198Z","strongest_claim":"COMPASS reduces storage space by up to 58.7%, while delivering improved or competitive search and update performance compared to state-of-the-art disk-resident graph ANNS systems.","one_line_summary":"COMPASS decouples vector data and index storage in disk-resident graph ANNS systems to enable component-specific lossless compression, reducing space by up to 58.7% with improved or competitive performance.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The assumption that vector data and auxiliary index metadata possess sufficiently distinct compressibility characteristics that can be exploited independently after decoupling without introducing unacceptable overhead in search or update paths.","pith_extraction_headline":"COMPASS decouples vector data from index metadata to compress each separately, cutting storage by up to 58.7% while keeping search and update performance competitive."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.09173/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":55,"sample":[{"doi":"","year":2025,"title":"Apache. Cassandra. https://cassandra.apache. org/, 2025","work_id":"1fd7f730-286c-4a7e-9a03-14134d385fcd","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2020,"title":"Language models are few-shot learners.Proc","work_id":"86fe48dd-a5c8-4ff4-8046-4939b9720674","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2020,"title":"Zhichao Cao, Siying Dong, Sagar Vemuri, and David H. C. Du. Characterizing, modeling, and benchmarking RocksDB key-value workloads at Facebook. InProc. of USENIX FAST, 2020","work_id":"4ef0b7a2-64dd-409c-a5bd-1c165de0d5df","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2006,"title":"Fay Chang, Jeffrey Dean, Sanjay Ghemawat, Wilson C. Hsieh, Deborah A. Wallach, Mike Burrows, Tushar Chandra, Andrew Fikes, and Robert E Gruber. Bigtable: A distributed storage system for structured da","work_id":"cb5d9d16-fa9a-4d40-acb7-63989a7c1523","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2018,"title":"Sptag: A li- brary for fast approximate nearest neighbor search","work_id":"7276f1cd-8198-4bf3-9721-e36e9de987dc","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":55,"snapshot_sha256":"19a418bf1e22b3c886f3dd39fe32c37e515e474c590fb64b06a24fae5da0e006","internal_anchors":2},"formal_canon":{"evidence_count":2,"snapshot_sha256":"2f4009285ec88bb5c7f0a4975028941934ac6ad803d0c3cf1574a623c8455e05"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"89b35d54-671b-480c-aa1f-b13a922d473d"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:01:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"++zOUO0HsDIJaLZEo1sZY3RyIRsbqva02hOM9t9kB1znASka0aHmx9xbep0mTSWGqsFWEB4SuG1XJRtN9/GMBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:46:33.871058Z"},"content_sha256":"533e9ec0d27a14d3719d50f6812e8c5828db51cc1524daac988d81f4dfcc3ba8","schema_version":"1.0","event_id":"sha256:533e9ec0d27a14d3719d50f6812e8c5828db51cc1524daac988d81f4dfcc3ba8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EBPXMTFHOEFDNDEJZS4U47RQPK/bundle.json","state_url":"https://pith.science/pith/EBPXMTFHOEFDNDEJZS4U47RQPK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EBPXMTFHOEFDNDEJZS4U47RQPK/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-05-25T18:46:33Z","links":{"resolver":"https://pith.science/pith/EBPXMTFHOEFDNDEJZS4U47RQPK","bundle":"https://pith.science/pith/EBPXMTFHOEFDNDEJZS4U47RQPK/bundle.json","state":"https://pith.science/pith/EBPXMTFHOEFDNDEJZS4U47RQPK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EBPXMTFHOEFDNDEJZS4U47RQPK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:EBPXMTFHOEFDNDEJZS4U47RQPK","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"59be6a55d422d9655fb28b3d83bcda2ad32cd4b00e36e2300851c48bcf5e3d5c","cross_cats_sorted":["cs.OS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2026-04-10T09:58:17Z","title_canon_sha256":"7a3086fbafc1e369a8721945f04bd80b8c59037f4396ebc982b7b72e62623c01"},"schema_version":"1.0","source":{"id":"2604.09173","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.09173","created_at":"2026-05-20T00:01:41Z"},{"alias_kind":"arxiv_version","alias_value":"2604.09173v2","created_at":"2026-05-20T00:01:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.09173","created_at":"2026-05-20T00:01:41Z"},{"alias_kind":"pith_short_12","alias_value":"EBPXMTFHOEFD","created_at":"2026-05-20T00:01:41Z"},{"alias_kind":"pith_short_16","alias_value":"EBPXMTFHOEFDNDEJ","created_at":"2026-05-20T00:01:41Z"},{"alias_kind":"pith_short_8","alias_value":"EBPXMTFH","created_at":"2026-05-20T00:01:41Z"}],"graph_snapshots":[{"event_id":"sha256:533e9ec0d27a14d3719d50f6812e8c5828db51cc1524daac988d81f4dfcc3ba8","target":"graph","created_at":"2026-05-20T00:01:41Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"COMPASS reduces storage space by up to 58.7%, while delivering improved or competitive search and update performance compared to state-of-the-art disk-resident graph ANNS systems."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The assumption that vector data and auxiliary index metadata possess sufficiently distinct compressibility characteristics that can be exploited independently after decoupling without introducing unacceptable overhead in search or update paths."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"COMPASS decouples vector data and index storage in disk-resident graph ANNS systems to enable component-specific lossless compression, reducing space by up to 58.7% with improved or competitive performance."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"COMPASS decouples vector data from index metadata to compress each separately, cutting storage by up to 58.7% while keeping search and update performance competitive."}],"snapshot_sha256":"79dd99846a81ef628aef563cec3d483cccd6b754c15f0f123ab3ea1acffc6452"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"2f4009285ec88bb5c7f0a4975028941934ac6ad803d0c3cf1574a623c8455e05"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2604.09173/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Managing large-scale vector datasets with disk-resident graph approximate nearest neighbor search (ANNS) systems incurs substantial storage overhead due to the co-location of vector data and auxiliary index metadata, which prevents the storage layer from exploiting their distinct compressibility. We present COMPASS, a component-aware compressed storage framework for disk-resident graph vector search. Leveraging data-index decoupling as a foundation, COMPASS losslessly compresses each component according to its distinct compressibility characteristics, thereby significantly reducing storage spa","authors_text":"Di Wu, Juncheng Zhang, Patrick P. C. Lee, Rui Yang, Yanjing Ren, Yuanming Ren","cross_cats":["cs.OS"],"headline":"COMPASS decouples vector data from index metadata to compress each separately, cutting storage by up to 58.7% while keeping search and update performance competitive.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2026-04-10T09:58:17Z","title":"Decoupling Vector Data and Index Storage for Space Efficiency"},"references":{"count":55,"internal_anchors":2,"resolved_work":55,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Apache. Cassandra. https://cassandra.apache. org/, 2025","work_id":"1fd7f730-286c-4a7e-9a03-14134d385fcd","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Language models are few-shot learners.Proc","work_id":"86fe48dd-a5c8-4ff4-8046-4939b9720674","year":2020},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Zhichao Cao, Siying Dong, Sagar Vemuri, and David H. C. Du. Characterizing, modeling, and benchmarking RocksDB key-value workloads at Facebook. InProc. of USENIX FAST, 2020","work_id":"4ef0b7a2-64dd-409c-a5bd-1c165de0d5df","year":2020},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Fay Chang, Jeffrey Dean, Sanjay Ghemawat, Wilson C. Hsieh, Deborah A. Wallach, Mike Burrows, Tushar Chandra, Andrew Fikes, and Robert E Gruber. Bigtable: A distributed storage system for structured da","work_id":"cb5d9d16-fa9a-4d40-acb7-63989a7c1523","year":2006},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Sptag: A li- brary for fast approximate nearest neighbor search","work_id":"7276f1cd-8198-4bf3-9721-e36e9de987dc","year":2018}],"snapshot_sha256":"19a418bf1e22b3c886f3dd39fe32c37e515e474c590fb64b06a24fae5da0e006"},"source":{"id":"2604.09173","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-19T18:19:24.413198Z","id":"89b35d54-671b-480c-aa1f-b13a922d473d","model_set":{"reader":"grok-4.3"},"one_line_summary":"COMPASS decouples vector data and index storage in disk-resident graph ANNS systems to enable component-specific lossless compression, reducing space by up to 58.7% with improved or competitive performance.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"COMPASS decouples vector data from index metadata to compress each separately, cutting storage by up to 58.7% while keeping search and update performance competitive.","strongest_claim":"COMPASS reduces storage space by up to 58.7%, while delivering improved or competitive search and update performance compared to state-of-the-art disk-resident graph ANNS systems.","weakest_assumption":"The assumption that vector data and auxiliary index metadata possess sufficiently distinct compressibility characteristics that can be exploited independently after decoupling without introducing unacceptable overhead in search or update paths."}},"verdict_id":"89b35d54-671b-480c-aa1f-b13a922d473d"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:50e2cdaf2a1ad09831ec1c4a890c04836c6a14f75f96919cd1ee8ab4ffcedaae","target":"record","created_at":"2026-05-20T00:01:41Z","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":"59be6a55d422d9655fb28b3d83bcda2ad32cd4b00e36e2300851c48bcf5e3d5c","cross_cats_sorted":["cs.OS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2026-04-10T09:58:17Z","title_canon_sha256":"7a3086fbafc1e369a8721945f04bd80b8c59037f4396ebc982b7b72e62623c01"},"schema_version":"1.0","source":{"id":"2604.09173","kind":"arxiv","version":2}},"canonical_sha256":"205f764ca7710a368c89ccb94e7e307aa5eb53301296fb98246614321020601f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"205f764ca7710a368c89ccb94e7e307aa5eb53301296fb98246614321020601f","first_computed_at":"2026-05-20T00:01:41.183984Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:01:41.183984Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fAx71KjcTZTVLeUJQDlG5U8VcgSoGyiDN4U1CLaDrUR+31jtRN9F/fb8jdHHHlPgfUBLlM3k7SRQY18r9FFwDw==","signature_status":"signed_v1","signed_at":"2026-05-20T00:01:41.184762Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.09173","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:50e2cdaf2a1ad09831ec1c4a890c04836c6a14f75f96919cd1ee8ab4ffcedaae","sha256:533e9ec0d27a14d3719d50f6812e8c5828db51cc1524daac988d81f4dfcc3ba8"],"state_sha256":"c141f2d746a07467f1868d35659f581871277d36cc12b1ac3f52ec718bd90fba"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RldgbVkNhTbi/sy1P4U0PQKVqakUn/3vXhMbDKZsuzcsqy+T9dkAGlX5deeMMZa8oYCiAFmapoQcLfKwtvedDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T18:46:33.876624Z","bundle_sha256":"a8434cc375d16b80e6191d20dc0e6572a55002d949630bd7b96e76edf148a8e8"}}