{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:YV5N5NPLFUKAUD2QMVKG6ICNHL","short_pith_number":"pith:YV5N5NPL","canonical_record":{"source":{"id":"2607.28602","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-07-30T17:54:03Z","cross_cats_sorted":[],"title_canon_sha256":"94e3b894b469e199013304484f75db04834839bc02fac68ea7242857a597e097","abstract_canon_sha256":"5184f4ed4a492ffebd108dbeb931c2845042b46f963307130b56d4e77aae28ca"},"schema_version":"1.0"},"canonical_sha256":"c57adeb5eb2d140a0f5065546f204d3ac9a7cf02ef93053c6b0448581aa8d65a","source":{"kind":"arxiv","id":"2607.28602","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.28602","created_at":"2026-07-31T01:39:04Z"},{"alias_kind":"arxiv_version","alias_value":"2607.28602v1","created_at":"2026-07-31T01:39:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.28602","created_at":"2026-07-31T01:39:04Z"},{"alias_kind":"pith_short_12","alias_value":"YV5N5NPLFUKA","created_at":"2026-07-31T01:39:04Z"},{"alias_kind":"pith_short_16","alias_value":"YV5N5NPLFUKAUD2Q","created_at":"2026-07-31T01:39:04Z"},{"alias_kind":"pith_short_8","alias_value":"YV5N5NPL","created_at":"2026-07-31T01:39:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:YV5N5NPLFUKAUD2QMVKG6ICNHL","target":"record","payload":{"canonical_record":{"source":{"id":"2607.28602","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-07-30T17:54:03Z","cross_cats_sorted":[],"title_canon_sha256":"94e3b894b469e199013304484f75db04834839bc02fac68ea7242857a597e097","abstract_canon_sha256":"5184f4ed4a492ffebd108dbeb931c2845042b46f963307130b56d4e77aae28ca"},"schema_version":"1.0"},"canonical_sha256":"c57adeb5eb2d140a0f5065546f204d3ac9a7cf02ef93053c6b0448581aa8d65a","receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c57adeb5eb2d140a0f5065546f204d3ac9a7cf02ef93053c6b0448581aa8d65a","last_reissued_at":"2026-07-31T01:39:04.389987Z","signature_status":"unsigned_v0","first_computed_at":"2026-07-31T01:39:04.389987Z"},"source_kind":"arxiv","source_id":"2607.28602","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-07-31T01:39:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J2LX5GYipqcf/cPUcYuHqnjPbKqaThxwmjtN/sequRTj+qlqzqQPJzIsCF5b7S3KZTjIC3RxEOoTwsH1xQrcAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T11:49:00.828881Z"},"content_sha256":"cf399e3741255d9748a75fcb61805f868f9a0129301208c4bb8385a51db47dab","schema_version":"1.0","event_id":"sha256:cf399e3741255d9748a75fcb61805f868f9a0129301208c4bb8385a51db47dab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:YV5N5NPLFUKAUD2QMVKG6ICNHL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Pauli Encodings & Unclonable Encryption","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Omar Fawzi, Pierre Botteron, S\\'ebastien Designolle","submitted_at":"2026-07-30T17:54:03Z","abstract_excerpt":"The unclonable bit question asks whether quantum encryption can prevent an adversary from producing two systems that both reveal the plaintext once the key is disclosed. We introduce and study Pauli Encodings, a simple class of one-bit encryption schemes whose ciphertexts are normalized eigenspace projectors of Pauli strings. For every Pauli Encoding with K Pauli strings, we prove a universal lower bound $1/2+1/(2\\sqrt{K})$ on the optimal monogamy-of-entanglement winning probability, together with sharper bounds for several structured families. We then establish two limitations of natural appr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.28602","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/2607.28602/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-07-31T01:39:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S2pAKPd5982F0/HMmQte7gxVA0UqKHfEnuPyg7HRLSCfDici/hUwceKlnApEcPt9eNobgMC12mT+1egIRlq0Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T11:49:00.829366Z"},"content_sha256":"db0a5a22dd2af06a8e1b0b956a886e03a79a81edccff9016cb255d32552b3238","schema_version":"1.0","event_id":"sha256:db0a5a22dd2af06a8e1b0b956a886e03a79a81edccff9016cb255d32552b3238"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:YV5N5NPLFUKAUD2QMVKG6ICNHL","target":"integrity","payload":{"note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.5281/zenodo.4743211 resolves to 'toqito -- Theory of quantum information toolkit: A Python package for studying quantum information'. A reader following the printed text alone cannot reach it.","snippet":"DOI: 10.5281/zenodo. 4743211 (cited on p. 5). [Sag01] Bruce E. Sagan. The Symmetric Group: Representations, Combinatorial Algorithms, and Symmetric Func- tions. 2nd ed. Vol","arxiv_id":"2607.28602","detector":"doi_compliance","evidence":{"ref_index":17,"verdict_class":"incontrovertible","resolved_title":"toqito -- Theory of quantum information toolkit: A Python package for studying quantum information","printed_excerpt":"10.5281/zenodo","reconstructed_doi":"10.5281/zenodo.4743211"},"severity":"advisory","ref_index":17,"audited_at":"2026-08-03T13:38:25.476182Z","event_type":"pith.integrity.v1","detected_doi":"10.5281/zenodo.4743211","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"532b6806a996f6c8677fcf9c9dc0968cf1dc81abe898186667e082a5e350149a","paper_version":2,"verdict_class":"incontrovertible","resolved_title":"toqito -- Theory of quantum information toolkit: A Python package for studying quantum information","detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":17648,"payload_sha256":"e9359147886b9a3d6c8b874a99eadd41a49b0ec6fcd7c044a507f07e32c1bba3","signature_b64":"VFkpwOrEJa22dPBGnKy8qKifv874iB1ZHgC9seE3B/1IRE4wfJF4wqxmFV9xfjFP/1y550bmNimmBHPgGTqFBQ==","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-03T13:38:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Dnm7hOM8TbFQPqPX7f8fIViZJItQc/ebFisQMXV46cgPfSSUOaECl1nkXBJ+VAvCSan4Db8Hq1HfjW49fwreAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T11:49:00.833417Z"},"content_sha256":"2cb066aee029c5ba684fbca75a15aeadbd626fdd864d17a8dea6072dbf627829","schema_version":"1.0","event_id":"sha256:2cb066aee029c5ba684fbca75a15aeadbd626fdd864d17a8dea6072dbf627829"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:YV5N5NPLFUKAUD2QMVKG6ICNHL","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1007/978-1-4757-6804-6) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Graduate Texts in Mathematics. New York: Springer, 2001.DOI: 10.1007/978- 1-4757-6804-6 (cited on pp. 23, 30). [Ser77] Jean-Pierre Serre. Linear Representations of Finite Groups . Vol","arxiv_id":"2607.28602","detector":"doi_compliance","evidence":{"ref_index":203,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"10.1007/978-","reconstructed_doi":"10.1007/978-1-4757-6804-6"},"severity":"advisory","ref_index":203,"audited_at":"2026-08-03T03:08:39.930736Z","event_type":"pith.integrity.v1","detected_doi":"10.1007/978-1-4757-6804-6","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"771408686053da39a66bb00fe7fba62d728c0149d440fb8296bf78e0fe65ef7a","paper_version":2,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":17540,"payload_sha256":"7082cba1a4d183a1c3a84dc2cb472aaca843cc92766c377242b9c1506eb98da0","signature_b64":"TqRDOaGhwD4bFvYfVP+kATtcaACk8C+zP1cADg6JNE062XWQZuZm+4oZIv7jPZ9k/w7fvHQuJKEq0oF2Rz+5DQ==","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-03T03:13:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GTgQNfUjForLkOu0CUh0T9J6sIjex+z2spZXq4cEAs2MNcRnMpGP9RRX1bb/mlUbntI3ps9OaR1vy6GZSo3jDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T11:49:00.833795Z"},"content_sha256":"141f6c70081ff69ed154f4e99258d92415bbf972dfab7592e14fa485607dfd22","schema_version":"1.0","event_id":"sha256:141f6c70081ff69ed154f4e99258d92415bbf972dfab7592e14fa485607dfd22"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:YV5N5NPLFUKAUD2QMVKG6ICNHL","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.5281/zenodo.4743211) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"DOI: 10.5281/zenodo. 4743211 (cited on p. 5). [Sag01] Bruce E. Sagan. The Symmetric Group: Representations, Combinatorial Algorithms, and Symmetric Func- tions. 2nd ed. Vol","arxiv_id":"2607.28602","detector":"doi_compliance","evidence":{"ref_index":17,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"10.5281/zenodo","reconstructed_doi":"10.5281/zenodo.4743211"},"severity":"advisory","ref_index":17,"audited_at":"2026-08-03T03:08:39.930736Z","event_type":"pith.integrity.v1","detected_doi":"10.5281/zenodo.4743211","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"d43fc31c43704d0258733e92821c67f2d5f7f8971e781cb1667deea2ef02ad34","paper_version":2,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":17539,"payload_sha256":"1ac59c6ad39514163f6fbc7d350de24f5866b9b254868798c09155caac017424","signature_b64":"0lZFsEn2Onva1K4Q7yZxzge4D/LvzoOTwDcD/ephOl3pQ07o4ZOwKRdeluqp3pwBTQ3S/CwPs2iVzrYXVVj6BQ==","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-03T03:13:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L9zVsqNeC2YOEJ/HdWTq3JqIzHx0Aq2DTrh96Ef3MkOpb5meQbjWnEV2n8g6f/BobbviRh/NkYJIJWQU3VQkAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T11:49:00.834221Z"},"content_sha256":"6c1e47f3bfc35fd95936e9a7d3ed164909442e10d8d441480e5fd7028ab08397","schema_version":"1.0","event_id":"sha256:6c1e47f3bfc35fd95936e9a7d3ed164909442e10d8d441480e5fd7028ab08397"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YV5N5NPLFUKAUD2QMVKG6ICNHL/bundle.json","state_url":"https://pith.science/pith/YV5N5NPLFUKAUD2QMVKG6ICNHL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YV5N5NPLFUKAUD2QMVKG6ICNHL/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-06T11:49:00Z","links":{"resolver":"https://pith.science/pith/YV5N5NPLFUKAUD2QMVKG6ICNHL","bundle":"https://pith.science/pith/YV5N5NPLFUKAUD2QMVKG6ICNHL/bundle.json","state":"https://pith.science/pith/YV5N5NPLFUKAUD2QMVKG6ICNHL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YV5N5NPLFUKAUD2QMVKG6ICNHL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:YV5N5NPLFUKAUD2QMVKG6ICNHL","merge_version":"pith-open-graph-merge-v1","event_count":5,"valid_event_count":5,"invalid_event_count":0,"equivocation_count":1,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"5184f4ed4a492ffebd108dbeb931c2845042b46f963307130b56d4e77aae28ca","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-07-30T17:54:03Z","title_canon_sha256":"94e3b894b469e199013304484f75db04834839bc02fac68ea7242857a597e097"},"schema_version":"1.0","source":{"id":"2607.28602","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.28602","created_at":"2026-07-31T01:39:04Z"},{"alias_kind":"arxiv_version","alias_value":"2607.28602v1","created_at":"2026-07-31T01:39:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.28602","created_at":"2026-07-31T01:39:04Z"},{"alias_kind":"pith_short_12","alias_value":"YV5N5NPLFUKA","created_at":"2026-07-31T01:39:04Z"},{"alias_kind":"pith_short_16","alias_value":"YV5N5NPLFUKAUD2Q","created_at":"2026-07-31T01:39:04Z"},{"alias_kind":"pith_short_8","alias_value":"YV5N5NPL","created_at":"2026-07-31T01:39:04Z"}],"graph_snapshots":[{"event_id":"sha256:db0a5a22dd2af06a8e1b0b956a886e03a79a81edccff9016cb255d32552b3238","target":"graph","created_at":"2026-07-31T01:39:04Z","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/2607.28602/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The unclonable bit question asks whether quantum encryption can prevent an adversary from producing two systems that both reveal the plaintext once the key is disclosed. We introduce and study Pauli Encodings, a simple class of one-bit encryption schemes whose ciphertexts are normalized eigenspace projectors of Pauli strings. For every Pauli Encoding with K Pauli strings, we prove a universal lower bound $1/2+1/(2\\sqrt{K})$ on the optimal monogamy-of-entanglement winning probability, together with sharper bounds for several structured families. We then establish two limitations of natural appr","authors_text":"Omar Fawzi, Pierre Botteron, S\\'ebastien Designolle","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-07-30T17:54:03Z","title":"Pauli Encodings & Unclonable Encryption"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.28602","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:cf399e3741255d9748a75fcb61805f868f9a0129301208c4bb8385a51db47dab","target":"record","created_at":"2026-07-31T01:39:04Z","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":"5184f4ed4a492ffebd108dbeb931c2845042b46f963307130b56d4e77aae28ca","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-07-30T17:54:03Z","title_canon_sha256":"94e3b894b469e199013304484f75db04834839bc02fac68ea7242857a597e097"},"schema_version":"1.0","source":{"id":"2607.28602","kind":"arxiv","version":1}},"canonical_sha256":"c57adeb5eb2d140a0f5065546f204d3ac9a7cf02ef93053c6b0448581aa8d65a","receipt":{"builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c57adeb5eb2d140a0f5065546f204d3ac9a7cf02ef93053c6b0448581aa8d65a","first_computed_at":"2026-07-31T01:39:04.389987Z","kind":"pith_receipt","last_reissued_at":"2026-07-31T01:39:04.389987Z","receipt_version":"0.3","signature_status":"unsigned_v0"},"source_id":"2607.28602","source_kind":"arxiv","source_version":1}}},"equivocations":[{"signer_id":"pith.science","event_type":"integrity_finding","target":"integrity","event_ids":["sha256:141f6c70081ff69ed154f4e99258d92415bbf972dfab7592e14fa485607dfd22","sha256:2cb066aee029c5ba684fbca75a15aeadbd626fdd864d17a8dea6072dbf627829","sha256:6c1e47f3bfc35fd95936e9a7d3ed164909442e10d8d441480e5fd7028ab08397"]}],"invalid_events":[],"applied_event_ids":["sha256:cf399e3741255d9748a75fcb61805f868f9a0129301208c4bb8385a51db47dab","sha256:db0a5a22dd2af06a8e1b0b956a886e03a79a81edccff9016cb255d32552b3238"],"state_sha256":"7e4f9c200249a2b873011c1243cfd0efcef66ca758e0cd5b1fe40dcbd5300d50"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xsQdGYT04bs2aAxocOONLdbZP2qTW6F2JmpfOm3LIV7le6NELZ8bdm43N22PQBqBuwa5vfrRe/rWw7PzL0lNAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T11:49:00.836882Z","bundle_sha256":"748fb77b6ef971d360bc0e0a357b1083719e8d9dbc544dc7793c9728a19f4c85"}}