{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:GOJUNSBCBRB3GMH3FTTZIYIGRQ","short_pith_number":"pith:GOJUNSBC","canonical_record":{"source":{"id":"2605.15765","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2026-05-15T09:24:50Z","cross_cats_sorted":["cs.DS","cs.RO","math.OC"],"title_canon_sha256":"22e65947f9119ede3f2271b038b34414274ec97ca2f34edc04f9eecdd44b2d6e","abstract_canon_sha256":"e31b62dac648fd944d8d406310c73524a259018906062fe0dfd2aa0e191d6d26"},"schema_version":"1.0"},"canonical_sha256":"339346c8220c43b330fb2ce79461068c2816c6c1b6d02a127f842da41d9bfd25","source":{"kind":"arxiv","id":"2605.15765","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15765","created_at":"2026-05-20T00:01:17Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15765v1","created_at":"2026-05-20T00:01:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15765","created_at":"2026-05-20T00:01:17Z"},{"alias_kind":"pith_short_12","alias_value":"GOJUNSBCBRB3","created_at":"2026-05-20T00:01:17Z"},{"alias_kind":"pith_short_16","alias_value":"GOJUNSBCBRB3GMH3","created_at":"2026-05-20T00:01:17Z"},{"alias_kind":"pith_short_8","alias_value":"GOJUNSBC","created_at":"2026-05-20T00:01:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:GOJUNSBCBRB3GMH3FTTZIYIGRQ","target":"record","payload":{"canonical_record":{"source":{"id":"2605.15765","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2026-05-15T09:24:50Z","cross_cats_sorted":["cs.DS","cs.RO","math.OC"],"title_canon_sha256":"22e65947f9119ede3f2271b038b34414274ec97ca2f34edc04f9eecdd44b2d6e","abstract_canon_sha256":"e31b62dac648fd944d8d406310c73524a259018906062fe0dfd2aa0e191d6d26"},"schema_version":"1.0"},"canonical_sha256":"339346c8220c43b330fb2ce79461068c2816c6c1b6d02a127f842da41d9bfd25","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:01:17.073276Z","signature_b64":"a4J3GgM7M1R2DQQwebeUZM3jrL/LPzzTIpt2RlH9meYL7bZSDLS5lq9WLv0FH8oBBMQAaezDManJabR/pdRnDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"339346c8220c43b330fb2ce79461068c2816c6c1b6d02a127f842da41d9bfd25","last_reissued_at":"2026-05-20T00:01:17.072427Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:01:17.072427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.15765","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:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ei7c2stYRrrM+Lx6EVja6J/Qa1b0CQBR93ZHlT+NF/TGHRHFteMJcv85zm4bb5nQm8p0vimGXTQHqsLZ7qzuAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T23:13:56.248245Z"},"content_sha256":"b9001af46c78c7d8dfeab3a9bea2f9e72bd13bd09936fbbf72e2e25eceaa679e","schema_version":"1.0","event_id":"sha256:b9001af46c78c7d8dfeab3a9bea2f9e72bd13bd09936fbbf72e2e25eceaa679e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:GOJUNSBCBRB3GMH3FTTZIYIGRQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimizing Line Segment Inspection with Limited-Range Drones","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"The drone inspection problem for line segments is strongly NP-hard even with two drones on a straight line.","cross_cats":["cs.DS","cs.RO","math.OC"],"primary_cat":"cs.CG","authors_text":"Alina Kasiuk, Inmaculada Ventura, Jos\\'e-Manuel Higes, Jos\\'e-Miguel D\\'iaz-B\\'a\\~nez","submitted_at":"2026-05-15T09:24:50Z","abstract_excerpt":"Optimization problems with drones are widely studied in a variety of civilian tasks, mainly due to their ability to traverse rough terrains and to carry cameras and other sensors for surveillance tasks. The limited battery life of these aerial robots poses challenges in operational research. In this paper, we address the following optimization problem. We are given a set of line segments (e.g. tubes in a solar plant) to inspect by drones. The objective is to detect broken pipes using artificial intelligence and path planning must be carried out efficiently. On the one hand, the limited capacit"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We are able to prove that this optimization problem is strongly NP-hard even when the segments are positioned on a line and the scenario involves only two drones.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The model assumes that battery limits force periodic returns to a single fixed base station and that the objective of minimizing makespan accurately reflects operational priorities without additional constraints such as wind, obstacles, or variable inspection times.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"The authors prove strong NP-hardness for inspecting line segments on a line with two limited-range drones and propose approximation algorithms that achieve near-optimal makespan in experiments.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"The drone inspection problem for line segments is strongly NP-hard even with two drones on a straight line.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"75f4697f98ea5e38ead1135b1072c9ad49c0d4e4dcad888bba92efafabca813c"},"source":{"id":"2605.15765","kind":"arxiv","version":1},"verdict":{"id":"5038c646-89e6-4bb3-83c3-b62bdc7853c8","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T18:09:37.511489Z","strongest_claim":"We are able to prove that this optimization problem is strongly NP-hard even when the segments are positioned on a line and the scenario involves only two drones.","one_line_summary":"The authors prove strong NP-hardness for inspecting line segments on a line with two limited-range drones and propose approximation algorithms that achieve near-optimal makespan in experiments.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The model assumes that battery limits force periodic returns to a single fixed base station and that the objective of minimizing makespan accurately reflects operational priorities without additional constraints such as wind, obstacles, or variable inspection times.","pith_extraction_headline":"The drone inspection problem for line segments is strongly NP-hard even with two drones on a straight line."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.15765/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T18:31:18.794458Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T18:21:42.034022Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T17:33:48.760201Z","status":"skipped","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T17:21:55.948041Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"198c6d749c7d871adca7a4f6900fa3cae446b4f0547037a954e75f41780f71d0"},"references":{"count":28,"sample":[{"doi":"","year":2023,"title":"Annals of Operations Research , pages=","work_id":"ee8bc016-09d6-4362-91ea-e54fcda5f207","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2022,"title":"Operational Research , volume=","work_id":"95a6411d-eb48-4787-b24d-5e34277aabb3","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2024,"title":"European Journal of Operational Research , volume=","work_id":"192168c8-aabc-482a-9b5f-4a8f67e46700","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2024,"title":"Information Processing Letters , pages=","work_id":"c76146fb-7fd4-47b4-80f4-ab46fe9c41f4","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2022,"title":"Theoretical Computer Science , volume=","work_id":"b256931c-33bc-44c6-b474-8d90579dd3b6","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":28,"snapshot_sha256":"3625ce9a39ffeb360c3469948d614a5648ced4b3b6df4f82b7faefd2e237b7fb","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":"5038c646-89e6-4bb3-83c3-b62bdc7853c8"},"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:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NLK8SO9x4k4vmkxGjj2Qd7QxAZVY9ep6NAG5BbvIjbIzEO/wc4xSKEQWn7D43H+M9VmLarABVQ07l/+H9AItCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T23:13:56.248878Z"},"content_sha256":"6d428159a6f6ac3a3f524db8e28b0bd704cd9e2911888586bf025c3e7bed4898","schema_version":"1.0","event_id":"sha256:6d428159a6f6ac3a3f524db8e28b0bd704cd9e2911888586bf025c3e7bed4898"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GOJUNSBCBRB3GMH3FTTZIYIGRQ/bundle.json","state_url":"https://pith.science/pith/GOJUNSBCBRB3GMH3FTTZIYIGRQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GOJUNSBCBRB3GMH3FTTZIYIGRQ/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-02T23:13:56Z","links":{"resolver":"https://pith.science/pith/GOJUNSBCBRB3GMH3FTTZIYIGRQ","bundle":"https://pith.science/pith/GOJUNSBCBRB3GMH3FTTZIYIGRQ/bundle.json","state":"https://pith.science/pith/GOJUNSBCBRB3GMH3FTTZIYIGRQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GOJUNSBCBRB3GMH3FTTZIYIGRQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:GOJUNSBCBRB3GMH3FTTZIYIGRQ","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":"e31b62dac648fd944d8d406310c73524a259018906062fe0dfd2aa0e191d6d26","cross_cats_sorted":["cs.DS","cs.RO","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2026-05-15T09:24:50Z","title_canon_sha256":"22e65947f9119ede3f2271b038b34414274ec97ca2f34edc04f9eecdd44b2d6e"},"schema_version":"1.0","source":{"id":"2605.15765","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15765","created_at":"2026-05-20T00:01:17Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15765v1","created_at":"2026-05-20T00:01:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15765","created_at":"2026-05-20T00:01:17Z"},{"alias_kind":"pith_short_12","alias_value":"GOJUNSBCBRB3","created_at":"2026-05-20T00:01:17Z"},{"alias_kind":"pith_short_16","alias_value":"GOJUNSBCBRB3GMH3","created_at":"2026-05-20T00:01:17Z"},{"alias_kind":"pith_short_8","alias_value":"GOJUNSBC","created_at":"2026-05-20T00:01:17Z"}],"graph_snapshots":[{"event_id":"sha256:6d428159a6f6ac3a3f524db8e28b0bd704cd9e2911888586bf025c3e7bed4898","target":"graph","created_at":"2026-05-20T00:01:17Z","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":"We are able to prove that this optimization problem is strongly NP-hard even when the segments are positioned on a line and the scenario involves only two drones."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The model assumes that battery limits force periodic returns to a single fixed base station and that the objective of minimizing makespan accurately reflects operational priorities without additional constraints such as wind, obstacles, or variable inspection times."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"The authors prove strong NP-hardness for inspecting line segments on a line with two limited-range drones and propose approximation algorithms that achieve near-optimal makespan in experiments."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"The drone inspection problem for line segments is strongly NP-hard even with two drones on a straight line."}],"snapshot_sha256":"75f4697f98ea5e38ead1135b1072c9ad49c0d4e4dcad888bba92efafabca813c"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T18:31:18.794458Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T18:21:42.034022Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T17:33:48.760201Z","status":"skipped","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T17:21:55.948041Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.15765/integrity.json","findings":[],"snapshot_sha256":"198c6d749c7d871adca7a4f6900fa3cae446b4f0547037a954e75f41780f71d0","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Optimization problems with drones are widely studied in a variety of civilian tasks, mainly due to their ability to traverse rough terrains and to carry cameras and other sensors for surveillance tasks. The limited battery life of these aerial robots poses challenges in operational research. In this paper, we address the following optimization problem. We are given a set of line segments (e.g. tubes in a solar plant) to inspect by drones. The objective is to detect broken pipes using artificial intelligence and path planning must be carried out efficiently. On the one hand, the limited capacit","authors_text":"Alina Kasiuk, Inmaculada Ventura, Jos\\'e-Manuel Higes, Jos\\'e-Miguel D\\'iaz-B\\'a\\~nez","cross_cats":["cs.DS","cs.RO","math.OC"],"headline":"The drone inspection problem for line segments is strongly NP-hard even with two drones on a straight line.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2026-05-15T09:24:50Z","title":"Optimizing Line Segment Inspection with Limited-Range Drones"},"references":{"count":28,"internal_anchors":0,"resolved_work":28,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Annals of Operations Research , pages=","work_id":"ee8bc016-09d6-4362-91ea-e54fcda5f207","year":2023},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Operational Research , volume=","work_id":"95a6411d-eb48-4787-b24d-5e34277aabb3","year":2022},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"European Journal of Operational Research , volume=","work_id":"192168c8-aabc-482a-9b5f-4a8f67e46700","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Information Processing Letters , pages=","work_id":"c76146fb-7fd4-47b4-80f4-ab46fe9c41f4","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Theoretical Computer Science , volume=","work_id":"b256931c-33bc-44c6-b474-8d90579dd3b6","year":2022}],"snapshot_sha256":"3625ce9a39ffeb360c3469948d614a5648ced4b3b6df4f82b7faefd2e237b7fb"},"source":{"id":"2605.15765","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T18:09:37.511489Z","id":"5038c646-89e6-4bb3-83c3-b62bdc7853c8","model_set":{"reader":"grok-4.3"},"one_line_summary":"The authors prove strong NP-hardness for inspecting line segments on a line with two limited-range drones and propose approximation algorithms that achieve near-optimal makespan in experiments.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"The drone inspection problem for line segments is strongly NP-hard even with two drones on a straight line.","strongest_claim":"We are able to prove that this optimization problem is strongly NP-hard even when the segments are positioned on a line and the scenario involves only two drones.","weakest_assumption":"The model assumes that battery limits force periodic returns to a single fixed base station and that the objective of minimizing makespan accurately reflects operational priorities without additional constraints such as wind, obstacles, or variable inspection times."}},"verdict_id":"5038c646-89e6-4bb3-83c3-b62bdc7853c8"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b9001af46c78c7d8dfeab3a9bea2f9e72bd13bd09936fbbf72e2e25eceaa679e","target":"record","created_at":"2026-05-20T00:01:17Z","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":"e31b62dac648fd944d8d406310c73524a259018906062fe0dfd2aa0e191d6d26","cross_cats_sorted":["cs.DS","cs.RO","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2026-05-15T09:24:50Z","title_canon_sha256":"22e65947f9119ede3f2271b038b34414274ec97ca2f34edc04f9eecdd44b2d6e"},"schema_version":"1.0","source":{"id":"2605.15765","kind":"arxiv","version":1}},"canonical_sha256":"339346c8220c43b330fb2ce79461068c2816c6c1b6d02a127f842da41d9bfd25","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"339346c8220c43b330fb2ce79461068c2816c6c1b6d02a127f842da41d9bfd25","first_computed_at":"2026-05-20T00:01:17.072427Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:01:17.072427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"a4J3GgM7M1R2DQQwebeUZM3jrL/LPzzTIpt2RlH9meYL7bZSDLS5lq9WLv0FH8oBBMQAaezDManJabR/pdRnDg==","signature_status":"signed_v1","signed_at":"2026-05-20T00:01:17.073276Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.15765","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b9001af46c78c7d8dfeab3a9bea2f9e72bd13bd09936fbbf72e2e25eceaa679e","sha256:6d428159a6f6ac3a3f524db8e28b0bd704cd9e2911888586bf025c3e7bed4898"],"state_sha256":"e19ce3a309244312742e7f971e04735d3af754be05bac94f48cc085cda97b8f2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DwAFO3QVl0VvTMcLeMeDW1sPHcHcORJN0EMGlZhRc5sRcoeiTIclS8rReUQza3VzgMMdJ/01nG9rT2H0TJthCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T23:13:56.251537Z","bundle_sha256":"b1e79b366d70b16977fe424189c69b79f3e519a424d475955b7648d95df46717"}}