{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:SG6M2SEANCM3VY5W5GTQIWIC4R","short_pith_number":"pith:SG6M2SEA","canonical_record":{"source":{"id":"2605.15833","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-15T10:36:41Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"3d411c71e8d556fc9518e0bd0ecf918aaffb87d7851932319f80d16647a6b619","abstract_canon_sha256":"326e9623c9a24d3f75951687cafcc2afdecf61170adf73eef972820471168876"},"schema_version":"1.0"},"canonical_sha256":"91bccd48806899bae3b6e9a7045902e440aac0c97bc7f509d54bf748c4e5c109","source":{"kind":"arxiv","id":"2605.15833","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15833","created_at":"2026-05-20T00:01:20Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15833v1","created_at":"2026-05-20T00:01:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15833","created_at":"2026-05-20T00:01:20Z"},{"alias_kind":"pith_short_12","alias_value":"SG6M2SEANCM3","created_at":"2026-05-20T00:01:20Z"},{"alias_kind":"pith_short_16","alias_value":"SG6M2SEANCM3VY5W","created_at":"2026-05-20T00:01:20Z"},{"alias_kind":"pith_short_8","alias_value":"SG6M2SEA","created_at":"2026-05-20T00:01:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:SG6M2SEANCM3VY5W5GTQIWIC4R","target":"record","payload":{"canonical_record":{"source":{"id":"2605.15833","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-15T10:36:41Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"3d411c71e8d556fc9518e0bd0ecf918aaffb87d7851932319f80d16647a6b619","abstract_canon_sha256":"326e9623c9a24d3f75951687cafcc2afdecf61170adf73eef972820471168876"},"schema_version":"1.0"},"canonical_sha256":"91bccd48806899bae3b6e9a7045902e440aac0c97bc7f509d54bf748c4e5c109","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:01:20.838381Z","signature_b64":"/klr51ZTnGCN8ltZcQR7uacC4kIqf0UpaGl6T8MMe3xPLMxndEJfQ3BzPTlcl9qtzeliWsHmT7NhmRdonBgVAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"91bccd48806899bae3b6e9a7045902e440aac0c97bc7f509d54bf748c4e5c109","last_reissued_at":"2026-05-20T00:01:20.837503Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:01:20.837503Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.15833","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:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0e/UPVi3Kr6hKicI0+x5N4sJh0XKb4S1+hpQKemiZVntTKwViIVeZp/YJZPhciJeB4Lz3ZIWFPkNOo5AE1CfBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T11:34:19.958300Z"},"content_sha256":"95a09d019496d8f79ebfb437bae4617e8661c4cc383bc3f9c4fe342075ef8f33","schema_version":"1.0","event_id":"sha256:95a09d019496d8f79ebfb437bae4617e8661c4cc383bc3f9c4fe342075ef8f33"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:SG6M2SEANCM3VY5W5GTQIWIC4R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exploration of $k$-edge-deficient temporal graphs in linear time","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Any always-connected k-edge-deficient temporal graph admits an exploration schedule of length O(nk log k) computable in polynomial time.","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Ivan Lahtin, Viktor Zamaraev","submitted_at":"2026-05-15T10:36:41Z","abstract_excerpt":"We study the Temporal Exploration problem, where an agent must visit all vertices of a temporal graph while traversing at most one available edge per time step. Unlike static graphs, which can be explored in linear time, temporal constraints can substantially increase exploration time even when every snapshot of the graph is connected.\n  To better understand the source of this complexity, we focus on a near-static setting and consider always-connected $k$-edge-deficient temporal graphs, in which each snapshot is connected and differs from a fixed underlying $n$-vertex graph by at most $k$ edge"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"any always-connected k-edge-deficient temporal graph admits an exploration schedule of length O(nk log k). Moreover, given such a temporal graph, the corresponding exploration schedule can be computed in polynomial time.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The temporal graph is always-connected (every snapshot is connected) and k-edge-deficient (each snapshot differs from a fixed underlying n-vertex graph by at most k edges).","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Always-connected k-edge-deficient temporal graphs admit exploration schedules of length O(nk log k) computable in polynomial time.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Any always-connected k-edge-deficient temporal graph admits an exploration schedule of length O(nk log k) computable in polynomial time.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"239cce5b033bf9280b49cf75969dc2a7fb20785c4ba167681dc40a830484b356"},"source":{"id":"2605.15833","kind":"arxiv","version":1},"verdict":{"id":"9c15198f-6325-4730-b1e0-ff0a054cd491","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T19:15:53.094372Z","strongest_claim":"any always-connected k-edge-deficient temporal graph admits an exploration schedule of length O(nk log k). Moreover, given such a temporal graph, the corresponding exploration schedule can be computed in polynomial time.","one_line_summary":"Always-connected k-edge-deficient temporal graphs admit exploration schedules of length O(nk log k) computable in polynomial time.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The temporal graph is always-connected (every snapshot is connected) and k-edge-deficient (each snapshot differs from a fixed underlying n-vertex graph by at most k edges).","pith_extraction_headline":"Any always-connected k-edge-deficient temporal graph admits an exploration schedule of length O(nk log k) computable in polynomial time."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.15833/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T19:31:19.090562Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T19:21:20.045629Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T17:33:48.717938Z","status":"skipped","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T17:21:55.854190Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"61ebaf4513c3654619c5f8f7349a4f0f3abbe511cf611765b097b98c4d5b01f8"},"references":{"count":19,"sample":[{"doi":"","year":2012,"title":"International Journal of Parallel, Emergent and Distributed Systems , volume =","work_id":"8e142643-4834-4d72-9924-481f88432993","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2016,"title":"Internet Mathematics , volume =","work_id":"0dd45d75-67dd-459c-8462-6979bc1a4a84","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2016,"title":"Michail, Othon and Spirakis, Paul G. , title =. Theoretical Computer Science , volume =. 2016 , doi =","work_id":"94410df0-a4b6-4f73-b93e-c30e6b144fa1","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2021,"title":"Journal of Computer and System Sciences , volume =","work_id":"51ec1ef9-3f14-43ed-8f02-633690ac0482","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2019,"title":"and van der Zanden, Tom C","work_id":"67ff67b3-5c16-4cbd-819b-b494e5820fc2","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":19,"snapshot_sha256":"a13bb21c134ebaabbbba16397bf8e74f95145dd06a599e82d2c66c7d1f8cca41","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"d69fe5392c112df6b22687afc75a9afe39e55e9cb78ec02e13c6613c341c6143"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"9c15198f-6325-4730-b1e0-ff0a054cd491"},"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:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T0rhIXzuBWseG9PB5sCyHsTPzgCFpogPdw8gB09zyD/esuGbLOgU4iBJK3V2rIcJ5P7aHzUSn7jI0uXSKMprAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T11:34:19.959503Z"},"content_sha256":"92a96dc684da91530c1ed7bb3632a9c7eabe64ee4d54b72945b8ebcd4b722a5f","schema_version":"1.0","event_id":"sha256:92a96dc684da91530c1ed7bb3632a9c7eabe64ee4d54b72945b8ebcd4b722a5f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SG6M2SEANCM3VY5W5GTQIWIC4R/bundle.json","state_url":"https://pith.science/pith/SG6M2SEANCM3VY5W5GTQIWIC4R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SG6M2SEANCM3VY5W5GTQIWIC4R/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-10T11:34:19Z","links":{"resolver":"https://pith.science/pith/SG6M2SEANCM3VY5W5GTQIWIC4R","bundle":"https://pith.science/pith/SG6M2SEANCM3VY5W5GTQIWIC4R/bundle.json","state":"https://pith.science/pith/SG6M2SEANCM3VY5W5GTQIWIC4R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SG6M2SEANCM3VY5W5GTQIWIC4R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:SG6M2SEANCM3VY5W5GTQIWIC4R","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":"326e9623c9a24d3f75951687cafcc2afdecf61170adf73eef972820471168876","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-15T10:36:41Z","title_canon_sha256":"3d411c71e8d556fc9518e0bd0ecf918aaffb87d7851932319f80d16647a6b619"},"schema_version":"1.0","source":{"id":"2605.15833","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15833","created_at":"2026-05-20T00:01:20Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15833v1","created_at":"2026-05-20T00:01:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15833","created_at":"2026-05-20T00:01:20Z"},{"alias_kind":"pith_short_12","alias_value":"SG6M2SEANCM3","created_at":"2026-05-20T00:01:20Z"},{"alias_kind":"pith_short_16","alias_value":"SG6M2SEANCM3VY5W","created_at":"2026-05-20T00:01:20Z"},{"alias_kind":"pith_short_8","alias_value":"SG6M2SEA","created_at":"2026-05-20T00:01:20Z"}],"graph_snapshots":[{"event_id":"sha256:92a96dc684da91530c1ed7bb3632a9c7eabe64ee4d54b72945b8ebcd4b722a5f","target":"graph","created_at":"2026-05-20T00:01:20Z","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":"any always-connected k-edge-deficient temporal graph admits an exploration schedule of length O(nk log k). Moreover, given such a temporal graph, the corresponding exploration schedule can be computed in polynomial time."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The temporal graph is always-connected (every snapshot is connected) and k-edge-deficient (each snapshot differs from a fixed underlying n-vertex graph by at most k edges)."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Always-connected k-edge-deficient temporal graphs admit exploration schedules of length O(nk log k) computable in polynomial time."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Any always-connected k-edge-deficient temporal graph admits an exploration schedule of length O(nk log k) computable in polynomial time."}],"snapshot_sha256":"239cce5b033bf9280b49cf75969dc2a7fb20785c4ba167681dc40a830484b356"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"d69fe5392c112df6b22687afc75a9afe39e55e9cb78ec02e13c6613c341c6143"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T19:31:19.090562Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T19:21:20.045629Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T17:33:48.717938Z","status":"skipped","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T17:21:55.854190Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.15833/integrity.json","findings":[],"snapshot_sha256":"61ebaf4513c3654619c5f8f7349a4f0f3abbe511cf611765b097b98c4d5b01f8","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the Temporal Exploration problem, where an agent must visit all vertices of a temporal graph while traversing at most one available edge per time step. Unlike static graphs, which can be explored in linear time, temporal constraints can substantially increase exploration time even when every snapshot of the graph is connected.\n  To better understand the source of this complexity, we focus on a near-static setting and consider always-connected $k$-edge-deficient temporal graphs, in which each snapshot is connected and differs from a fixed underlying $n$-vertex graph by at most $k$ edge","authors_text":"Ivan Lahtin, Viktor Zamaraev","cross_cats":["cs.DM","math.CO"],"headline":"Any always-connected k-edge-deficient temporal graph admits an exploration schedule of length O(nk log k) computable in polynomial time.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-15T10:36:41Z","title":"Exploration of $k$-edge-deficient temporal graphs in linear time"},"references":{"count":19,"internal_anchors":0,"resolved_work":19,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"International Journal of Parallel, Emergent and Distributed Systems , volume =","work_id":"8e142643-4834-4d72-9924-481f88432993","year":2012},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Internet Mathematics , volume =","work_id":"0dd45d75-67dd-459c-8462-6979bc1a4a84","year":2016},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Michail, Othon and Spirakis, Paul G. , title =. Theoretical Computer Science , volume =. 2016 , doi =","work_id":"94410df0-a4b6-4f73-b93e-c30e6b144fa1","year":2016},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Journal of Computer and System Sciences , volume =","work_id":"51ec1ef9-3f14-43ed-8f02-633690ac0482","year":2021},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"and van der Zanden, Tom C","work_id":"67ff67b3-5c16-4cbd-819b-b494e5820fc2","year":2019}],"snapshot_sha256":"a13bb21c134ebaabbbba16397bf8e74f95145dd06a599e82d2c66c7d1f8cca41"},"source":{"id":"2605.15833","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T19:15:53.094372Z","id":"9c15198f-6325-4730-b1e0-ff0a054cd491","model_set":{"reader":"grok-4.3"},"one_line_summary":"Always-connected k-edge-deficient temporal graphs admit exploration schedules of length O(nk log k) computable in polynomial time.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Any always-connected k-edge-deficient temporal graph admits an exploration schedule of length O(nk log k) computable in polynomial time.","strongest_claim":"any always-connected k-edge-deficient temporal graph admits an exploration schedule of length O(nk log k). Moreover, given such a temporal graph, the corresponding exploration schedule can be computed in polynomial time.","weakest_assumption":"The temporal graph is always-connected (every snapshot is connected) and k-edge-deficient (each snapshot differs from a fixed underlying n-vertex graph by at most k edges)."}},"verdict_id":"9c15198f-6325-4730-b1e0-ff0a054cd491"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:95a09d019496d8f79ebfb437bae4617e8661c4cc383bc3f9c4fe342075ef8f33","target":"record","created_at":"2026-05-20T00:01:20Z","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":"326e9623c9a24d3f75951687cafcc2afdecf61170adf73eef972820471168876","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-15T10:36:41Z","title_canon_sha256":"3d411c71e8d556fc9518e0bd0ecf918aaffb87d7851932319f80d16647a6b619"},"schema_version":"1.0","source":{"id":"2605.15833","kind":"arxiv","version":1}},"canonical_sha256":"91bccd48806899bae3b6e9a7045902e440aac0c97bc7f509d54bf748c4e5c109","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"91bccd48806899bae3b6e9a7045902e440aac0c97bc7f509d54bf748c4e5c109","first_computed_at":"2026-05-20T00:01:20.837503Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:01:20.837503Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/klr51ZTnGCN8ltZcQR7uacC4kIqf0UpaGl6T8MMe3xPLMxndEJfQ3BzPTlcl9qtzeliWsHmT7NhmRdonBgVAQ==","signature_status":"signed_v1","signed_at":"2026-05-20T00:01:20.838381Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.15833","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:95a09d019496d8f79ebfb437bae4617e8661c4cc383bc3f9c4fe342075ef8f33","sha256:92a96dc684da91530c1ed7bb3632a9c7eabe64ee4d54b72945b8ebcd4b722a5f"],"state_sha256":"58c0a55db97a6e5ab9ab2f8e5a5b85a1b5132f1ead038752fd95aba2f6d08d05"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4kl5yA8u9KFlXNkJx9DcOjDibimZBdiOBbCY5c7h9M7NfBLbj0Gut9jZFXEs407rxopw51DtvQvMPinbX0z7Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T11:34:19.965152Z","bundle_sha256":"4a8bd1facb53057d141749cf2c8c388de99d2857f8ae69e993f1e02ec7c14adb"}}