{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:YEXPPMZQDQRYP2NU3GKDMWKQED","short_pith_number":"pith:YEXPPMZQ","canonical_record":{"source":{"id":"2605.13519","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2026-05-13T13:37:00Z","cross_cats_sorted":[],"title_canon_sha256":"f90df7077dde8c825e85809f46d4d6852a5ce1ba3833ccdd343f0788e5dca348","abstract_canon_sha256":"03a7652590d9aaf7ac31fe227ae38c36b5f136e591ce2c39c195b2374f605de6"},"schema_version":"1.0"},"canonical_sha256":"c12ef7b3301c2387e9b4d99436595020f0a800d1d34a237df48e04ab564de44b","source":{"kind":"arxiv","id":"2605.13519","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13519","created_at":"2026-05-18T02:44:24Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13519v1","created_at":"2026-05-18T02:44:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13519","created_at":"2026-05-18T02:44:24Z"},{"alias_kind":"pith_short_12","alias_value":"YEXPPMZQDQRY","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"YEXPPMZQDQRYP2NU","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"YEXPPMZQ","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:YEXPPMZQDQRYP2NU3GKDMWKQED","target":"record","payload":{"canonical_record":{"source":{"id":"2605.13519","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2026-05-13T13:37:00Z","cross_cats_sorted":[],"title_canon_sha256":"f90df7077dde8c825e85809f46d4d6852a5ce1ba3833ccdd343f0788e5dca348","abstract_canon_sha256":"03a7652590d9aaf7ac31fe227ae38c36b5f136e591ce2c39c195b2374f605de6"},"schema_version":"1.0"},"canonical_sha256":"c12ef7b3301c2387e9b4d99436595020f0a800d1d34a237df48e04ab564de44b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:24.402690Z","signature_b64":"8Dikb+sREfVafcz8P7E2rb63kgTBF70UAYdWps4U6ogoENjOEhbFLGbz3Vfdn9bO4+cEN+YN60ap9QSJdB4sBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c12ef7b3301c2387e9b4d99436595020f0a800d1d34a237df48e04ab564de44b","last_reissued_at":"2026-05-18T02:44:24.402269Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:24.402269Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.13519","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-18T02:44:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IRsO39tYD/TPXv2fkVyvgCpIRHgJq4bXArkyEAzuQ+LqAwXy6VSYliPyT0lJSKryrsT7QgnCAI0knB8cAWL4CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T05:49:49.769903Z"},"content_sha256":"a3e0624a521d60dda0e8c980ab0513906407073b68410d08a6ffb76c54ba5fd6","schema_version":"1.0","event_id":"sha256:a3e0624a521d60dda0e8c980ab0513906407073b68410d08a6ffb76c54ba5fd6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:YEXPPMZQDQRYP2NU3GKDMWKQED","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Perfect simulation for interacting Hawkes processes with reset-induced variable length memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"If the sure-event rate exceeds the candidate-event rate in interacting Hawkes processes, their clans of ancestors are finite almost surely.","cross_cats":[],"primary_cat":"math.PR","authors_text":"Branda P.I. Gon\\c{c}alves, Lucien Mauffret","submitted_at":"2026-05-13T13:37:00Z","abstract_excerpt":"We study a class of interacting nonlinear Hawkes point processes on the integer lattice in which each component is reset after its own jumps. The intensity of a component depends on the post-reset activity of its nearest neighbours, which produces a variable-length memory structure.\n  We develop a graphical construction based on a dominating Poisson environment and introduce the clan of ancestors of a space-time point. The clan is the finite or infinite backward exploration of all events whose acceptance decisions may influence the target value. Our main result is a constructive subcriticality"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Our main result is a constructive subcriticality criterion: if the sure-event rate exceeds the candidate-event rate, equivalently if β_*/(β^*−β_*)>1, then the clan is almost surely finite. The finiteness of the clan yields a measurable local construction of the stationary regime.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The graphical construction admits a dominating Poisson environment whose intensity bounds the nonlinear Hawkes intensities uniformly enough for the associated branching process to dominate the clan size; this domination must hold for the chosen nearest-neighbor interaction and reset rule.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A subcriticality criterion β_*/(β^* - β_*) > 1 guarantees almost-sure finiteness of the clan of ancestors, enabling an exact backward-forward perfect simulation algorithm for the stationary regime of these variable-memory Hawkes processes.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"If the sure-event rate exceeds the candidate-event rate in interacting Hawkes processes, their clans of ancestors are finite almost surely.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"045cdc4e0b84f20167d7986cf4fa74bc1f064b02914d1241d04ab6133103f21b"},"source":{"id":"2605.13519","kind":"arxiv","version":1},"verdict":{"id":"7a77455a-cad2-4e41-85c5-e9ff210c24ff","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T18:09:48.034797Z","strongest_claim":"Our main result is a constructive subcriticality criterion: if the sure-event rate exceeds the candidate-event rate, equivalently if β_*/(β^*−β_*)>1, then the clan is almost surely finite. The finiteness of the clan yields a measurable local construction of the stationary regime.","one_line_summary":"A subcriticality criterion β_*/(β^* - β_*) > 1 guarantees almost-sure finiteness of the clan of ancestors, enabling an exact backward-forward perfect simulation algorithm for the stationary regime of these variable-memory Hawkes processes.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The graphical construction admits a dominating Poisson environment whose intensity bounds the nonlinear Hawkes intensities uniformly enough for the associated branching process to dominate the clan size; this domination must hold for the chosen nearest-neighbor interaction and reset rule.","pith_extraction_headline":"If the sure-event rate exceeds the candidate-event rate in interacting Hawkes processes, their clans of ancestors are finite almost surely."},"references":{"count":12,"sample":[{"doi":"","year":1972,"title":"Athreya, K.B. and Ney, P.E. (1972).Branching Processes. Springer, Berlin","work_id":"60cea247-8248-4069-902c-17cde4d260e7","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1996,"title":"P. Brémaud and L. Massoulié. Stability of nonlinear Hawkes processes.Ann. Probab.24(1996), 1563–1588","work_id":"a717ae22-4b5a-4dd5-9d84-04a3ea732ccc","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2002,"title":"F. Comets, R. Fernandez and P.A. Ferrari. Processes with long memory: regenerative construction and perfect simulation.Ann. Appl. Probab.12(2002), 921–943","work_id":"32a5dceb-f1f9-4a08-b6d7-2b54fcdd749a","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2016,"title":"S. Delattre, N. Fournier and M. Hoffmann. Hawkes processes on large networks.Ann. Appl. Probab.26(2016), 216–261","work_id":"5d951fba-0405-49d5-a6ba-4d34bdc6031f","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2018,"title":"P. A. Ferrari, A. Galves, I. Grigorescu and E. Löcherbach. Phase transition for infinite systems of spiking neurons.J. Stat. Phys. 172(2018), 1564–1575","work_id":"32c18e19-aa2e-4204-8efa-074437579138","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":12,"snapshot_sha256":"d9da8c65be0d7c0930ad72410996b648906627744994e32389e43a3eeb782122","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"d048cb4c38617016d414d16f01a91bd9bd1701242eaf6413b7bfd9a2820f6efc"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"7a77455a-cad2-4e41-85c5-e9ff210c24ff"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:44:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tOg7N1cqwFuGCy4MAEfB2VZ2DqiaHlGa8ewfPDRWzGV4WRojT7FEXyz4oSUaPTtDHbEj93XvBDaOHeYaicEeDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T05:49:49.771225Z"},"content_sha256":"4c28b60228df7c552991ea3ab8313e049d2d61d4257d4d27a1e965afeb9a8ccc","schema_version":"1.0","event_id":"sha256:4c28b60228df7c552991ea3ab8313e049d2d61d4257d4d27a1e965afeb9a8ccc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YEXPPMZQDQRYP2NU3GKDMWKQED/bundle.json","state_url":"https://pith.science/pith/YEXPPMZQDQRYP2NU3GKDMWKQED/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YEXPPMZQDQRYP2NU3GKDMWKQED/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-01T05:49:49Z","links":{"resolver":"https://pith.science/pith/YEXPPMZQDQRYP2NU3GKDMWKQED","bundle":"https://pith.science/pith/YEXPPMZQDQRYP2NU3GKDMWKQED/bundle.json","state":"https://pith.science/pith/YEXPPMZQDQRYP2NU3GKDMWKQED/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YEXPPMZQDQRYP2NU3GKDMWKQED/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:YEXPPMZQDQRYP2NU3GKDMWKQED","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":"03a7652590d9aaf7ac31fe227ae38c36b5f136e591ce2c39c195b2374f605de6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2026-05-13T13:37:00Z","title_canon_sha256":"f90df7077dde8c825e85809f46d4d6852a5ce1ba3833ccdd343f0788e5dca348"},"schema_version":"1.0","source":{"id":"2605.13519","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13519","created_at":"2026-05-18T02:44:24Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13519v1","created_at":"2026-05-18T02:44:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13519","created_at":"2026-05-18T02:44:24Z"},{"alias_kind":"pith_short_12","alias_value":"YEXPPMZQDQRY","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"YEXPPMZQDQRYP2NU","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"YEXPPMZQ","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:4c28b60228df7c552991ea3ab8313e049d2d61d4257d4d27a1e965afeb9a8ccc","target":"graph","created_at":"2026-05-18T02:44:24Z","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":"Our main result is a constructive subcriticality criterion: if the sure-event rate exceeds the candidate-event rate, equivalently if β_*/(β^*−β_*)>1, then the clan is almost surely finite. The finiteness of the clan yields a measurable local construction of the stationary regime."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The graphical construction admits a dominating Poisson environment whose intensity bounds the nonlinear Hawkes intensities uniformly enough for the associated branching process to dominate the clan size; this domination must hold for the chosen nearest-neighbor interaction and reset rule."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"A subcriticality criterion β_*/(β^* - β_*) > 1 guarantees almost-sure finiteness of the clan of ancestors, enabling an exact backward-forward perfect simulation algorithm for the stationary regime of these variable-memory Hawkes processes."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"If the sure-event rate exceeds the candidate-event rate in interacting Hawkes processes, their clans of ancestors are finite almost surely."}],"snapshot_sha256":"045cdc4e0b84f20167d7986cf4fa74bc1f064b02914d1241d04ab6133103f21b"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"d048cb4c38617016d414d16f01a91bd9bd1701242eaf6413b7bfd9a2820f6efc"},"paper":{"abstract_excerpt":"We study a class of interacting nonlinear Hawkes point processes on the integer lattice in which each component is reset after its own jumps. The intensity of a component depends on the post-reset activity of its nearest neighbours, which produces a variable-length memory structure.\n  We develop a graphical construction based on a dominating Poisson environment and introduce the clan of ancestors of a space-time point. The clan is the finite or infinite backward exploration of all events whose acceptance decisions may influence the target value. Our main result is a constructive subcriticality","authors_text":"Branda P.I. Gon\\c{c}alves, Lucien Mauffret","cross_cats":[],"headline":"If the sure-event rate exceeds the candidate-event rate in interacting Hawkes processes, their clans of ancestors are finite almost surely.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2026-05-13T13:37:00Z","title":"Perfect simulation for interacting Hawkes processes with reset-induced variable length memory"},"references":{"count":12,"internal_anchors":0,"resolved_work":12,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Athreya, K.B. and Ney, P.E. (1972).Branching Processes. Springer, Berlin","work_id":"60cea247-8248-4069-902c-17cde4d260e7","year":1972},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"P. Brémaud and L. Massoulié. Stability of nonlinear Hawkes processes.Ann. Probab.24(1996), 1563–1588","work_id":"a717ae22-4b5a-4dd5-9d84-04a3ea732ccc","year":1996},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"F. Comets, R. Fernandez and P.A. Ferrari. Processes with long memory: regenerative construction and perfect simulation.Ann. Appl. Probab.12(2002), 921–943","work_id":"32a5dceb-f1f9-4a08-b6d7-2b54fcdd749a","year":2002},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"S. Delattre, N. Fournier and M. Hoffmann. Hawkes processes on large networks.Ann. Appl. Probab.26(2016), 216–261","work_id":"5d951fba-0405-49d5-a6ba-4d34bdc6031f","year":2016},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"P. A. Ferrari, A. Galves, I. Grigorescu and E. Löcherbach. Phase transition for infinite systems of spiking neurons.J. Stat. Phys. 172(2018), 1564–1575","work_id":"32c18e19-aa2e-4204-8efa-074437579138","year":2018}],"snapshot_sha256":"d9da8c65be0d7c0930ad72410996b648906627744994e32389e43a3eeb782122"},"source":{"id":"2605.13519","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T18:09:48.034797Z","id":"7a77455a-cad2-4e41-85c5-e9ff210c24ff","model_set":{"reader":"grok-4.3"},"one_line_summary":"A subcriticality criterion β_*/(β^* - β_*) > 1 guarantees almost-sure finiteness of the clan of ancestors, enabling an exact backward-forward perfect simulation algorithm for the stationary regime of these variable-memory Hawkes processes.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"If the sure-event rate exceeds the candidate-event rate in interacting Hawkes processes, their clans of ancestors are finite almost surely.","strongest_claim":"Our main result is a constructive subcriticality criterion: if the sure-event rate exceeds the candidate-event rate, equivalently if β_*/(β^*−β_*)>1, then the clan is almost surely finite. The finiteness of the clan yields a measurable local construction of the stationary regime.","weakest_assumption":"The graphical construction admits a dominating Poisson environment whose intensity bounds the nonlinear Hawkes intensities uniformly enough for the associated branching process to dominate the clan size; this domination must hold for the chosen nearest-neighbor interaction and reset rule."}},"verdict_id":"7a77455a-cad2-4e41-85c5-e9ff210c24ff"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a3e0624a521d60dda0e8c980ab0513906407073b68410d08a6ffb76c54ba5fd6","target":"record","created_at":"2026-05-18T02:44:24Z","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":"03a7652590d9aaf7ac31fe227ae38c36b5f136e591ce2c39c195b2374f605de6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2026-05-13T13:37:00Z","title_canon_sha256":"f90df7077dde8c825e85809f46d4d6852a5ce1ba3833ccdd343f0788e5dca348"},"schema_version":"1.0","source":{"id":"2605.13519","kind":"arxiv","version":1}},"canonical_sha256":"c12ef7b3301c2387e9b4d99436595020f0a800d1d34a237df48e04ab564de44b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c12ef7b3301c2387e9b4d99436595020f0a800d1d34a237df48e04ab564de44b","first_computed_at":"2026-05-18T02:44:24.402269Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:24.402269Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8Dikb+sREfVafcz8P7E2rb63kgTBF70UAYdWps4U6ogoENjOEhbFLGbz3Vfdn9bO4+cEN+YN60ap9QSJdB4sBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:24.402690Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.13519","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a3e0624a521d60dda0e8c980ab0513906407073b68410d08a6ffb76c54ba5fd6","sha256:4c28b60228df7c552991ea3ab8313e049d2d61d4257d4d27a1e965afeb9a8ccc"],"state_sha256":"6011d0a8e62d4b208b64e985430ec597a7372a0766a6c4520e9aeb2916937244"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YH5OqdVgbnOUYpFGD1Gqu+D3uO9RaaV9j+QPcozgb5iXw91QtF2LVSSH5kD8jebCUgIGlNKESORIkRRdTbakCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T05:49:49.776478Z","bundle_sha256":"8b3de28c2035a881dee17b343ed6d931a986149a143a3ef340b7f1bf681e1fa5"}}