{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:QVGW34J56KIGR5RYM6T2XEYJQE","short_pith_number":"pith:QVGW34J5","canonical_record":{"source":{"id":"2605.16058","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-05-15T15:24:03Z","cross_cats_sorted":["cs.MS"],"title_canon_sha256":"f8ed6fb8093d61c89b6785a0a89fcb3837a48e414d46134c8bb107cd10bb939d","abstract_canon_sha256":"c899818e28716f27d2d71606d1255bed03e111c4e69ba42671f8d97e3c67a145"},"schema_version":"1.0"},"canonical_sha256":"854d6df13df29068f63867a7ab93098107dcb7edad22b183710d9a2cdcf75aae","source":{"kind":"arxiv","id":"2605.16058","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16058","created_at":"2026-05-20T00:01:50Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16058v1","created_at":"2026-05-20T00:01:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16058","created_at":"2026-05-20T00:01:50Z"},{"alias_kind":"pith_short_12","alias_value":"QVGW34J56KIG","created_at":"2026-05-20T00:01:50Z"},{"alias_kind":"pith_short_16","alias_value":"QVGW34J56KIGR5RY","created_at":"2026-05-20T00:01:50Z"},{"alias_kind":"pith_short_8","alias_value":"QVGW34J5","created_at":"2026-05-20T00:01:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:QVGW34J56KIGR5RYM6T2XEYJQE","target":"record","payload":{"canonical_record":{"source":{"id":"2605.16058","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-05-15T15:24:03Z","cross_cats_sorted":["cs.MS"],"title_canon_sha256":"f8ed6fb8093d61c89b6785a0a89fcb3837a48e414d46134c8bb107cd10bb939d","abstract_canon_sha256":"c899818e28716f27d2d71606d1255bed03e111c4e69ba42671f8d97e3c67a145"},"schema_version":"1.0"},"canonical_sha256":"854d6df13df29068f63867a7ab93098107dcb7edad22b183710d9a2cdcf75aae","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:01:50.996554Z","signature_b64":"FydFZHc2ZcKjKCX/FiBhfZrJDGzwQ/m7nm4QYVlIOad2DvArw0XX3pO2Zdp+a3XjIjDZ+kCRqzCPUnYaWzXdAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"854d6df13df29068f63867a7ab93098107dcb7edad22b183710d9a2cdcf75aae","last_reissued_at":"2026-05-20T00:01:50.995878Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:01:50.995878Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.16058","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-05-20T00:01:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iMMG+B0fFxEozAmIh4mF2wET1uyzt5Stn5+RSZNxPbXPC8A6JNWrsqNxvjHxIcS79THb3WApDeWnKwgr8LUmAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:04:00.925137Z"},"content_sha256":"d9631e24228875172ac71f1c78ca1538f82b220c9e46141df44ff89e2fd24a77","schema_version":"1.0","event_id":"sha256:d9631e24228875172ac71f1c78ca1538f82b220c9e46141df44ff89e2fd24a77"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:QVGW34J56KIGR5RYM6T2XEYJQE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"High-Performance Star-M SVD for Big Data Compression","license":"http://creativecommons.org/licenses/by/4.0/","headline":"A shared-memory parallel implementation of the star-M SVD enables high-performance compression of large scientific datasets.","cross_cats":["cs.MS"],"primary_cat":"cs.DC","authors_text":"Aditya Devarakonda, Grey Ballard, Md Taufique Hussain, Naman Pesricha, Srinivas Eswar, Vishwas Rao","submitted_at":"2026-05-15T15:24:03Z","abstract_excerpt":"In the era of big data, effectively compressing large datasets while performing complex mathematical operations is crucial. Tensor-based decomposition methods have shown superior compression capabilities with minimal loss of accuracy compared to traditional matrix methods. Under the star-M tensor framework, tensors can be decomposed in a matrix-mimetic way, including using the star-M SVD. This tensor SVD has optimality guarantees and has shown exceptional performance on specific types of data, but software implementations have been mostly limited to productivity-oriented languages. In this wor"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"This software will enable optimal compression of extensive scientific datasets, paving the way for enhanced data analysis and insights.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The star-M SVD has optimality guarantees and has shown exceptional performance on specific types of data, as referenced in the abstract.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Development of a shared-memory parallel high-performance implementation of star-M SVD for optimal compression of large scientific datasets.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A shared-memory parallel implementation of the star-M SVD enables high-performance compression of large scientific datasets.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"00f6c1b05e63a22b14fcea5a420dfddabfdb88012b2cad291af0334fb6100105"},"source":{"id":"2605.16058","kind":"arxiv","version":1},"verdict":{"id":"751fe1fb-3f99-4da8-9aad-044a356ad752","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T18:47:17.791198Z","strongest_claim":"This software will enable optimal compression of extensive scientific datasets, paving the way for enhanced data analysis and insights.","one_line_summary":"Development of a shared-memory parallel high-performance implementation of star-M SVD for optimal compression of large scientific datasets.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The star-M SVD has optimality guarantees and has shown exceptional performance on specific types of data, as referenced in the abstract.","pith_extraction_headline":"A shared-memory parallel implementation of the star-M SVD enables high-performance compression of large scientific datasets."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.16058/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_compliance","ran_at":"2026-05-19T19:01:33.270070Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-19T19:01:18.984708Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T17:33:41.550891Z","status":"skipped","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T16:41:55.523038Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"e1b5f50836be0874e04e4bb6543c4e1d571d5c343039fa52de54ea4ae01af34f"},"references":{"count":38,"sample":[{"doi":"","year":2021,"title":"Higham, Jakub Kurzak, Piotr Luszczek, Stanimire Tomov, and Mawussi Zounon","work_id":"335d380e-14db-483d-b9c6-10f16c4488c3","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2022,"title":"Parallel algorithms for tensor train arithmetic","work_id":"6d347f75-62c5-4815-be20-0a0bcfd6d447","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2016,"title":"Woody Austin, Grey Ballard, and Tamara G. Kolda. Parallel tensor compression for large-scale scientific data. In2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS), pages 912","work_id":"8c9cbec8-b462-4997-81b2-a60099538fb0","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2020,"title":"Grey Ballard, Alicia Klinvex, and Tamara G. Kolda. TuckerMPI: A parallel C++/MPI software package for large-scale data compression via the tucker tensor decomposition.ACM Transactions on Mathematical ","work_id":"530e5fb2-fc4b-4da9-ac58-0169fecc4a90","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2020,"title":"Grey Ballard, Alicia Klinvex, and Tamara G. Kolda. TuckerMPI: A parallel C++/MPI software package for large-scale data compression via the Tucker tensor decomposition.ACM Transactions on Mathematical ","work_id":"78c5149d-0fd8-4bbc-99a3-d0172ea62492","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":38,"snapshot_sha256":"06bd707120603c45449005179866a0780d5e3fa0ce6cac3ab6f0eab5c4e200f8","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":"751fe1fb-3f99-4da8-9aad-044a356ad752"},"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:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gOczJBSjFLiE5lGCttUCYqqIGGOD9boy6w4RioiD1pR5wP9C0eR7CxrDvyjLMhCXOrd2orlcEXuTSEFaUgL9CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:04:00.925743Z"},"content_sha256":"34c3202b908d7d415bb0ed3ccbc39d808e2972ed88ec33b14f58646f7b0be800","schema_version":"1.0","event_id":"sha256:34c3202b908d7d415bb0ed3ccbc39d808e2972ed88ec33b14f58646f7b0be800"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QVGW34J56KIGR5RYM6T2XEYJQE/bundle.json","state_url":"https://pith.science/pith/QVGW34J56KIGR5RYM6T2XEYJQE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QVGW34J56KIGR5RYM6T2XEYJQE/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-06-03T01:04:00Z","links":{"resolver":"https://pith.science/pith/QVGW34J56KIGR5RYM6T2XEYJQE","bundle":"https://pith.science/pith/QVGW34J56KIGR5RYM6T2XEYJQE/bundle.json","state":"https://pith.science/pith/QVGW34J56KIGR5RYM6T2XEYJQE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QVGW34J56KIGR5RYM6T2XEYJQE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:QVGW34J56KIGR5RYM6T2XEYJQE","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":"c899818e28716f27d2d71606d1255bed03e111c4e69ba42671f8d97e3c67a145","cross_cats_sorted":["cs.MS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-05-15T15:24:03Z","title_canon_sha256":"f8ed6fb8093d61c89b6785a0a89fcb3837a48e414d46134c8bb107cd10bb939d"},"schema_version":"1.0","source":{"id":"2605.16058","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16058","created_at":"2026-05-20T00:01:50Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16058v1","created_at":"2026-05-20T00:01:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16058","created_at":"2026-05-20T00:01:50Z"},{"alias_kind":"pith_short_12","alias_value":"QVGW34J56KIG","created_at":"2026-05-20T00:01:50Z"},{"alias_kind":"pith_short_16","alias_value":"QVGW34J56KIGR5RY","created_at":"2026-05-20T00:01:50Z"},{"alias_kind":"pith_short_8","alias_value":"QVGW34J5","created_at":"2026-05-20T00:01:50Z"}],"graph_snapshots":[{"event_id":"sha256:34c3202b908d7d415bb0ed3ccbc39d808e2972ed88ec33b14f58646f7b0be800","target":"graph","created_at":"2026-05-20T00:01:50Z","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":"This software will enable optimal compression of extensive scientific datasets, paving the way for enhanced data analysis and insights."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The star-M SVD has optimality guarantees and has shown exceptional performance on specific types of data, as referenced in the abstract."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Development of a shared-memory parallel high-performance implementation of star-M SVD for optimal compression of large scientific datasets."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A shared-memory parallel implementation of the star-M SVD enables high-performance compression of large scientific datasets."}],"snapshot_sha256":"00f6c1b05e63a22b14fcea5a420dfddabfdb88012b2cad291af0334fb6100105"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T19:01:33.270070Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T19:01:18.984708Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T17:33:41.550891Z","status":"skipped","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T16:41:55.523038Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.16058/integrity.json","findings":[],"snapshot_sha256":"e1b5f50836be0874e04e4bb6543c4e1d571d5c343039fa52de54ea4ae01af34f","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In the era of big data, effectively compressing large datasets while performing complex mathematical operations is crucial. Tensor-based decomposition methods have shown superior compression capabilities with minimal loss of accuracy compared to traditional matrix methods. Under the star-M tensor framework, tensors can be decomposed in a matrix-mimetic way, including using the star-M SVD. This tensor SVD has optimality guarantees and has shown exceptional performance on specific types of data, but software implementations have been mostly limited to productivity-oriented languages. In this wor","authors_text":"Aditya Devarakonda, Grey Ballard, Md Taufique Hussain, Naman Pesricha, Srinivas Eswar, Vishwas Rao","cross_cats":["cs.MS"],"headline":"A shared-memory parallel implementation of the star-M SVD enables high-performance compression of large scientific datasets.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-05-15T15:24:03Z","title":"High-Performance Star-M SVD for Big Data Compression"},"references":{"count":38,"internal_anchors":0,"resolved_work":38,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Higham, Jakub Kurzak, Piotr Luszczek, Stanimire Tomov, and Mawussi Zounon","work_id":"335d380e-14db-483d-b9c6-10f16c4488c3","year":2021},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Parallel algorithms for tensor train arithmetic","work_id":"6d347f75-62c5-4815-be20-0a0bcfd6d447","year":2022},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Woody Austin, Grey Ballard, and Tamara G. Kolda. Parallel tensor compression for large-scale scientific data. In2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS), pages 912","work_id":"8c9cbec8-b462-4997-81b2-a60099538fb0","year":2016},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Grey Ballard, Alicia Klinvex, and Tamara G. Kolda. TuckerMPI: A parallel C++/MPI software package for large-scale data compression via the tucker tensor decomposition.ACM Transactions on Mathematical ","work_id":"530e5fb2-fc4b-4da9-ac58-0169fecc4a90","year":2020},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Grey Ballard, Alicia Klinvex, and Tamara G. Kolda. TuckerMPI: A parallel C++/MPI software package for large-scale data compression via the Tucker tensor decomposition.ACM Transactions on Mathematical ","work_id":"78c5149d-0fd8-4bbc-99a3-d0172ea62492","year":2020}],"snapshot_sha256":"06bd707120603c45449005179866a0780d5e3fa0ce6cac3ab6f0eab5c4e200f8"},"source":{"id":"2605.16058","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T18:47:17.791198Z","id":"751fe1fb-3f99-4da8-9aad-044a356ad752","model_set":{"reader":"grok-4.3"},"one_line_summary":"Development of a shared-memory parallel high-performance implementation of star-M SVD for optimal compression of large scientific datasets.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A shared-memory parallel implementation of the star-M SVD enables high-performance compression of large scientific datasets.","strongest_claim":"This software will enable optimal compression of extensive scientific datasets, paving the way for enhanced data analysis and insights.","weakest_assumption":"The star-M SVD has optimality guarantees and has shown exceptional performance on specific types of data, as referenced in the abstract."}},"verdict_id":"751fe1fb-3f99-4da8-9aad-044a356ad752"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d9631e24228875172ac71f1c78ca1538f82b220c9e46141df44ff89e2fd24a77","target":"record","created_at":"2026-05-20T00:01:50Z","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":"c899818e28716f27d2d71606d1255bed03e111c4e69ba42671f8d97e3c67a145","cross_cats_sorted":["cs.MS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-05-15T15:24:03Z","title_canon_sha256":"f8ed6fb8093d61c89b6785a0a89fcb3837a48e414d46134c8bb107cd10bb939d"},"schema_version":"1.0","source":{"id":"2605.16058","kind":"arxiv","version":1}},"canonical_sha256":"854d6df13df29068f63867a7ab93098107dcb7edad22b183710d9a2cdcf75aae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"854d6df13df29068f63867a7ab93098107dcb7edad22b183710d9a2cdcf75aae","first_computed_at":"2026-05-20T00:01:50.995878Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:01:50.995878Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FydFZHc2ZcKjKCX/FiBhfZrJDGzwQ/m7nm4QYVlIOad2DvArw0XX3pO2Zdp+a3XjIjDZ+kCRqzCPUnYaWzXdAQ==","signature_status":"signed_v1","signed_at":"2026-05-20T00:01:50.996554Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.16058","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d9631e24228875172ac71f1c78ca1538f82b220c9e46141df44ff89e2fd24a77","sha256:34c3202b908d7d415bb0ed3ccbc39d808e2972ed88ec33b14f58646f7b0be800"],"state_sha256":"4423f9bd118fe50e3144d60ad18fb370ca010b3c0bd4944ebe517d6285d18845"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dSnqIHb77LM9I5bOw0ODi9V2Y2rFJ27wQpk/KNmgclwU1yyv090p9F35O1vF/DJ24kFgXXWBz9t2MZHu0kwlCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T01:04:00.928381Z","bundle_sha256":"6e4f9c7527e68cafd305f2d36ef733b8fc4ca2ed58adaf2342749be10cb31797"}}