{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:576XC73FFTOSK4EXQXEFQNHCLL","short_pith_number":"pith:576XC73F","canonical_record":{"source":{"id":"2605.15066","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2026-05-14T16:56:35Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"372081e84101975713fd6fd29401cf8a59eb10c946fbf4918c1621f8733569d7","abstract_canon_sha256":"02af2e2dc014bd743712f2bbe6b1cd8d60f293039b69f508eaf8a90b0a61084b"},"schema_version":"1.0"},"canonical_sha256":"effd717f652cdd25709785c85834e25ad6da6f7d926ee6c1cf4cc2ab25bea2d4","source":{"kind":"arxiv","id":"2605.15066","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15066","created_at":"2026-05-17T23:38:54Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15066v1","created_at":"2026-05-17T23:38:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15066","created_at":"2026-05-17T23:38:54Z"},{"alias_kind":"pith_short_12","alias_value":"576XC73FFTOS","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"576XC73FFTOSK4EX","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"576XC73F","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:576XC73FFTOSK4EXQXEFQNHCLL","target":"record","payload":{"canonical_record":{"source":{"id":"2605.15066","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2026-05-14T16:56:35Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"372081e84101975713fd6fd29401cf8a59eb10c946fbf4918c1621f8733569d7","abstract_canon_sha256":"02af2e2dc014bd743712f2bbe6b1cd8d60f293039b69f508eaf8a90b0a61084b"},"schema_version":"1.0"},"canonical_sha256":"effd717f652cdd25709785c85834e25ad6da6f7d926ee6c1cf4cc2ab25bea2d4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:38:54.229963Z","signature_b64":"ktURxUft9wJf+y0Rgd8eAfZDgA9EVlB/5LZUV4/U4912TmU7eG/ApJUgXcozWS7WAiuAN3HTmgcDwR6aYgQ2CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"effd717f652cdd25709785c85834e25ad6da6f7d926ee6c1cf4cc2ab25bea2d4","last_reissued_at":"2026-05-17T23:38:54.229160Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:38:54.229160Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.15066","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-17T23:38:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9Qfr80FSsbKZkXaa6JDWEtVJo2X4M85ua2vtyHmKlDUFRwQNQpSE6O3ZBpnZLStg//+mu5jjmCxZ3LAQn8cGBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T23:18:50.788499Z"},"content_sha256":"af8e683e64192ef8c477ba9bfcd44e1a81b61ca2420fa41bf72c6f0810f5a646","schema_version":"1.0","event_id":"sha256:af8e683e64192ef8c477ba9bfcd44e1a81b61ca2420fa41bf72c6f0810f5a646"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:576XC73FFTOSK4EXQXEFQNHCLL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The critical activation density in graph bootstrap percolation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"For every graph H the critical H-percolation threshold p_c(n,H) is located in terms of the limiting density ρ(H) of the graphs that activate an edge most efficiently.","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Brett Kolesnik, Maksim Zhukovskii, Pawe{\\l} Pra{\\l}at, Rajko Nenadov, Tam\\'as Makai, Xavier P\\'erez-Gim\\'enez","submitted_at":"2026-05-14T16:56:35Z","abstract_excerpt":"In graph bootstrap percolation, edges of an Erd\\H{o}s-R\\'enyi random graph ${\\mathcal G}_{n,p}$ are initially active. Activation spreads to other edges of the complete graph $K_n$ by an iterative process governed by a fixed graph $H$, whereby an edge becomes active whenever it is the only inactive edge in a copy of $H$. If all edges of $K_n$ are eventually activated, we say the process $H$-percolates. The case $H=K_3$ corresponds to the classical sharp threshold for connectivity in ${\\mathcal G}_{n,p}$. When $H=K_4$, there are close connections with $2$-neighbor bootstrap percolation from stat"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"for every graph H, we locate the critical H-percolation threshold p_c(n,H)","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the critical limiting density ρ(H) of graphs that most efficiently activate a given edge is well-defined and finite for every H, and that the threshold is determined by this quantity.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"For any fixed graph H the critical percolation threshold p_c(n,H) equals the value determined by the minimal activation density ρ(H) of graphs that efficiently activate an edge.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"For every graph H the critical H-percolation threshold p_c(n,H) is located in terms of the limiting density ρ(H) of the graphs that activate an edge most efficiently.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"de4d5078fc9a83ec4ba0afa448f4e8bef3c934ded18058d468407166489f8e52"},"source":{"id":"2605.15066","kind":"arxiv","version":1},"verdict":{"id":"ac963031-7fbb-4e57-a814-21e4cf41cf3d","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T02:57:30.338857Z","strongest_claim":"for every graph H, we locate the critical H-percolation threshold p_c(n,H)","one_line_summary":"For any fixed graph H the critical percolation threshold p_c(n,H) equals the value determined by the minimal activation density ρ(H) of graphs that efficiently activate an edge.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the critical limiting density ρ(H) of graphs that most efficiently activate a given edge is well-defined and finite for every H, and that the threshold is determined by this quantity.","pith_extraction_headline":"For every graph H the critical H-percolation threshold p_c(n,H) is located in terms of the limiting density ρ(H) of the graphs that activate an edge most efficiently."},"references":{"count":30,"sample":[{"doi":"","year":1988,"title":"M. Aizenman and J. L. Lebowitz,Metastability effects in bootstrap percolation, J. Phys. A21(1988), no. 19, 3801–3813","work_id":"32a08250-75c2-4560-b60c-880d47df233d","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1985,"title":"N. Alon,An extremal problem for sets with applications to graph theory, J. Combin. Theory Ser. A40(1985), no. 1, 82–89","work_id":"0e5f2e1d-37cf-4e60-9169-d2eaaaa69502","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2016,"title":"N. Alon and J. H. Spencer,The probabilistic method, fourth ed., Wiley Series in Discrete Mathematics and Optimization, John Wiley & Sons, Inc., Hoboken, NJ, 2016","work_id":"4499de7c-30a3-4c53-87d6-15694724ad69","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2018,"title":"O. Angel and B. Kolesnik,Sharp thresholds for contagious sets in random graphs, Ann. Appl. Probab.28(2018), no. 2, 1052–1098","work_id":"41cb610d-ae93-4915-8d84-8e2d75c86b6b","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2021,"title":",Large deviations for subcritical bootstrap percolation on the Erd˝ os–Rényi graph, J. Stat. Phys.185(2021), no. 2, Paper No. 8, 16","work_id":"dc0e7b4d-8ff3-4b1d-8ac6-666e7cfc27e3","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":30,"snapshot_sha256":"ded220e1a6d40e552d9364e3a039c3f426434a349ce47a064514e90b340e29ee","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":"ac963031-7fbb-4e57-a814-21e4cf41cf3d"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:38:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8g/3bRXdcDrmVfQeAltCoDIfsMp8DiQfILS1XoAN+DpxYu4/pnk/Gzl/wzN1MBpYIrk0XV01Aa9sNruvbyPFDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T23:18:50.789113Z"},"content_sha256":"5cd601c1fd7334c1aaf6bf5a4eb916a12404140b146b5858834f6f99a6d8fec1","schema_version":"1.0","event_id":"sha256:5cd601c1fd7334c1aaf6bf5a4eb916a12404140b146b5858834f6f99a6d8fec1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/576XC73FFTOSK4EXQXEFQNHCLL/bundle.json","state_url":"https://pith.science/pith/576XC73FFTOSK4EXQXEFQNHCLL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/576XC73FFTOSK4EXQXEFQNHCLL/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-01T23:18:50Z","links":{"resolver":"https://pith.science/pith/576XC73FFTOSK4EXQXEFQNHCLL","bundle":"https://pith.science/pith/576XC73FFTOSK4EXQXEFQNHCLL/bundle.json","state":"https://pith.science/pith/576XC73FFTOSK4EXQXEFQNHCLL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/576XC73FFTOSK4EXQXEFQNHCLL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:576XC73FFTOSK4EXQXEFQNHCLL","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":"02af2e2dc014bd743712f2bbe6b1cd8d60f293039b69f508eaf8a90b0a61084b","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2026-05-14T16:56:35Z","title_canon_sha256":"372081e84101975713fd6fd29401cf8a59eb10c946fbf4918c1621f8733569d7"},"schema_version":"1.0","source":{"id":"2605.15066","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15066","created_at":"2026-05-17T23:38:54Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15066v1","created_at":"2026-05-17T23:38:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15066","created_at":"2026-05-17T23:38:54Z"},{"alias_kind":"pith_short_12","alias_value":"576XC73FFTOS","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"576XC73FFTOSK4EX","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"576XC73F","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:5cd601c1fd7334c1aaf6bf5a4eb916a12404140b146b5858834f6f99a6d8fec1","target":"graph","created_at":"2026-05-17T23:38:54Z","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":"for every graph H, we locate the critical H-percolation threshold p_c(n,H)"},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the critical limiting density ρ(H) of graphs that most efficiently activate a given edge is well-defined and finite for every H, and that the threshold is determined by this quantity."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"For any fixed graph H the critical percolation threshold p_c(n,H) equals the value determined by the minimal activation density ρ(H) of graphs that efficiently activate an edge."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"For every graph H the critical H-percolation threshold p_c(n,H) is located in terms of the limiting density ρ(H) of the graphs that activate an edge most efficiently."}],"snapshot_sha256":"de4d5078fc9a83ec4ba0afa448f4e8bef3c934ded18058d468407166489f8e52"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"In graph bootstrap percolation, edges of an Erd\\H{o}s-R\\'enyi random graph ${\\mathcal G}_{n,p}$ are initially active. Activation spreads to other edges of the complete graph $K_n$ by an iterative process governed by a fixed graph $H$, whereby an edge becomes active whenever it is the only inactive edge in a copy of $H$. If all edges of $K_n$ are eventually activated, we say the process $H$-percolates. The case $H=K_3$ corresponds to the classical sharp threshold for connectivity in ${\\mathcal G}_{n,p}$. When $H=K_4$, there are close connections with $2$-neighbor bootstrap percolation from stat","authors_text":"Brett Kolesnik, Maksim Zhukovskii, Pawe{\\l} Pra{\\l}at, Rajko Nenadov, Tam\\'as Makai, Xavier P\\'erez-Gim\\'enez","cross_cats":["math.CO"],"headline":"For every graph H the critical H-percolation threshold p_c(n,H) is located in terms of the limiting density ρ(H) of the graphs that activate an edge most efficiently.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2026-05-14T16:56:35Z","title":"The critical activation density in graph bootstrap percolation"},"references":{"count":30,"internal_anchors":0,"resolved_work":30,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"M. Aizenman and J. L. Lebowitz,Metastability effects in bootstrap percolation, J. Phys. A21(1988), no. 19, 3801–3813","work_id":"32a08250-75c2-4560-b60c-880d47df233d","year":1988},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"N. Alon,An extremal problem for sets with applications to graph theory, J. Combin. Theory Ser. A40(1985), no. 1, 82–89","work_id":"0e5f2e1d-37cf-4e60-9169-d2eaaaa69502","year":1985},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"N. Alon and J. H. Spencer,The probabilistic method, fourth ed., Wiley Series in Discrete Mathematics and Optimization, John Wiley & Sons, Inc., Hoboken, NJ, 2016","work_id":"4499de7c-30a3-4c53-87d6-15694724ad69","year":2016},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"O. Angel and B. Kolesnik,Sharp thresholds for contagious sets in random graphs, Ann. Appl. Probab.28(2018), no. 2, 1052–1098","work_id":"41cb610d-ae93-4915-8d84-8e2d75c86b6b","year":2018},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":",Large deviations for subcritical bootstrap percolation on the Erd˝ os–Rényi graph, J. Stat. Phys.185(2021), no. 2, Paper No. 8, 16","work_id":"dc0e7b4d-8ff3-4b1d-8ac6-666e7cfc27e3","year":2021}],"snapshot_sha256":"ded220e1a6d40e552d9364e3a039c3f426434a349ce47a064514e90b340e29ee"},"source":{"id":"2605.15066","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-15T02:57:30.338857Z","id":"ac963031-7fbb-4e57-a814-21e4cf41cf3d","model_set":{"reader":"grok-4.3"},"one_line_summary":"For any fixed graph H the critical percolation threshold p_c(n,H) equals the value determined by the minimal activation density ρ(H) of graphs that efficiently activate an edge.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"For every graph H the critical H-percolation threshold p_c(n,H) is located in terms of the limiting density ρ(H) of the graphs that activate an edge most efficiently.","strongest_claim":"for every graph H, we locate the critical H-percolation threshold p_c(n,H)","weakest_assumption":"That the critical limiting density ρ(H) of graphs that most efficiently activate a given edge is well-defined and finite for every H, and that the threshold is determined by this quantity."}},"verdict_id":"ac963031-7fbb-4e57-a814-21e4cf41cf3d"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:af8e683e64192ef8c477ba9bfcd44e1a81b61ca2420fa41bf72c6f0810f5a646","target":"record","created_at":"2026-05-17T23:38:54Z","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":"02af2e2dc014bd743712f2bbe6b1cd8d60f293039b69f508eaf8a90b0a61084b","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2026-05-14T16:56:35Z","title_canon_sha256":"372081e84101975713fd6fd29401cf8a59eb10c946fbf4918c1621f8733569d7"},"schema_version":"1.0","source":{"id":"2605.15066","kind":"arxiv","version":1}},"canonical_sha256":"effd717f652cdd25709785c85834e25ad6da6f7d926ee6c1cf4cc2ab25bea2d4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"effd717f652cdd25709785c85834e25ad6da6f7d926ee6c1cf4cc2ab25bea2d4","first_computed_at":"2026-05-17T23:38:54.229160Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:38:54.229160Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ktURxUft9wJf+y0Rgd8eAfZDgA9EVlB/5LZUV4/U4912TmU7eG/ApJUgXcozWS7WAiuAN3HTmgcDwR6aYgQ2CQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:38:54.229963Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.15066","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:af8e683e64192ef8c477ba9bfcd44e1a81b61ca2420fa41bf72c6f0810f5a646","sha256:5cd601c1fd7334c1aaf6bf5a4eb916a12404140b146b5858834f6f99a6d8fec1"],"state_sha256":"d4cab77dc31abc6d46fea59e27036c0b9465ffe04fefe1fa0f0db41c4e36f71a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CkE5hPGo8KwPYTTUWhjM1aZKsiXvlv+HMPAF24M17I/LkEqPeKUmPXWVdiV0id6ocfub0zIN5AcI8aGj7VCZBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T23:18:50.791781Z","bundle_sha256":"40a19fa9513c8d88c3a2ba2eae2b43ec23c8d3377c9b931483a3a57336c76ecd"}}