{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:7XWV4CMHKQGMLN6SR7G5PNDPHK","short_pith_number":"pith:7XWV4CMH","canonical_record":{"source":{"id":"2605.16855","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2026-05-16T07:39:21Z","cross_cats_sorted":[],"title_canon_sha256":"dd59827bf16cdc4d9cc99c678200a4ab47cad0cc5cb09e9f547d353192c433e8","abstract_canon_sha256":"5afb98b75f4f09a538662960312f7eeadda91bd43b0e88cc8a8d9bd4e62ef717"},"schema_version":"1.0"},"canonical_sha256":"fded5e0987540cc5b7d28fcdd7b46f3a9c31fb26f9bdf147846b86905503db38","source":{"kind":"arxiv","id":"2605.16855","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16855","created_at":"2026-05-20T00:03:26Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16855v1","created_at":"2026-05-20T00:03:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16855","created_at":"2026-05-20T00:03:26Z"},{"alias_kind":"pith_short_12","alias_value":"7XWV4CMHKQGM","created_at":"2026-05-20T00:03:26Z"},{"alias_kind":"pith_short_16","alias_value":"7XWV4CMHKQGMLN6S","created_at":"2026-05-20T00:03:26Z"},{"alias_kind":"pith_short_8","alias_value":"7XWV4CMH","created_at":"2026-05-20T00:03:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:7XWV4CMHKQGMLN6SR7G5PNDPHK","target":"record","payload":{"canonical_record":{"source":{"id":"2605.16855","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2026-05-16T07:39:21Z","cross_cats_sorted":[],"title_canon_sha256":"dd59827bf16cdc4d9cc99c678200a4ab47cad0cc5cb09e9f547d353192c433e8","abstract_canon_sha256":"5afb98b75f4f09a538662960312f7eeadda91bd43b0e88cc8a8d9bd4e62ef717"},"schema_version":"1.0"},"canonical_sha256":"fded5e0987540cc5b7d28fcdd7b46f3a9c31fb26f9bdf147846b86905503db38","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:03:26.434352Z","signature_b64":"z8/CorQXubyCuGB/RTXAW3CBYtEksZIPSE5HUpr9zWJTHu3j992E2pCvZJ3jh4VObOFnd3/QcPaC7YLwF7atDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fded5e0987540cc5b7d28fcdd7b46f3a9c31fb26f9bdf147846b86905503db38","last_reissued_at":"2026-05-20T00:03:26.433422Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:03:26.433422Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.16855","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:03:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dhJw3qbmKqvpApIpWLhkVvswFsnztFHQWwXKqSGFwNBe7iQlPS+ATi+iVYCAa5/qzwJ27LJZE87VhryFOMYWAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T11:23:05.785505Z"},"content_sha256":"f3d5f4865e8007da742ebe0c3897177088ca12554141279c2408d178a9063e24","schema_version":"1.0","event_id":"sha256:f3d5f4865e8007da742ebe0c3897177088ca12554141279c2408d178a9063e24"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:7XWV4CMHKQGMLN6SR7G5PNDPHK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lifelong LaCAM with Local Guidance for Lifelong MAPF","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"A receding-horizon LaCAM with local guidance lifted from one-shot MAPF achieves higher task throughput in lifelong multi-agent pathfinding.","cross_cats":[],"primary_cat":"cs.MA","authors_text":"Keisuke Okumura, Tomoki Arita","submitted_at":"2026-05-16T07:39:21Z","abstract_excerpt":"Local guidance has recently proven to be a powerful driver of empirical performance in real-time, suboptimal multi-agent pathfinding (MAPF), improving the scalable configuration-based solver LaCAM. By injecting informative spatiotemporal cues around each agent, local guidance mitigates congestion, reduces waiting, and remains scalable enough even with tight time budgets, yielding state-of-the-art performance for one-shot MAPF. This study asks whether the same benefits can be lifted to the lifelong setting (LMAPF), where tasks arrive continuously and improvements in per-step plans can increase "},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Our method scales effectively, maintains high throughput even in compact, dense environments, and surpasses existing planners, thereby pushing the frontier of real-time, lifelong MAPF.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The assumption that local guidance cues developed for one-shot MAPF can be directly lifted to the lifelong setting via receding-horizon windows and warm-starting without introducing new congestion or throughput loss over long horizons.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"LLLG extends LaCAM with local guidance to lifelong MAPF using windowed planning and warm-starts, claiming higher throughput than prior planners in dense environments.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A receding-horizon LaCAM with local guidance lifted from one-shot MAPF achieves higher task throughput in lifelong multi-agent pathfinding.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"2ee6b86343af66964760ddc10ac199d5f1cb4bb68112982cab7cdb2030721b8c"},"source":{"id":"2605.16855","kind":"arxiv","version":1},"verdict":{"id":"21172b3d-8e96-4261-964a-06511da3f972","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T19:23:12.756414Z","strongest_claim":"Our method scales effectively, maintains high throughput even in compact, dense environments, and surpasses existing planners, thereby pushing the frontier of real-time, lifelong MAPF.","one_line_summary":"LLLG extends LaCAM with local guidance to lifelong MAPF using windowed planning and warm-starts, claiming higher throughput than prior planners in dense environments.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The assumption that local guidance cues developed for one-shot MAPF can be directly lifted to the lifelong setting via receding-horizon windows and warm-starting without introducing new congestion or throughput loss over long horizons.","pith_extraction_headline":"A receding-horizon LaCAM with local guidance lifted from one-shot MAPF achieves higher task throughput in lifelong multi-agent pathfinding."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.16855/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T19:31:18.979787Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T19:31:00.353625Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T18:41:56.310222Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T18:33:26.384821Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"c2cfce1b708e106b3103ebbabebd9affc1c3b2c9f193d79233ff3270b7f1bb90"},"references":{"count":47,"sample":[{"doi":"","year":null,"title":"Algorithmica , year =","work_id":"6aa5466e-d725-44dc-b9d7-894ba53ec9b6","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Cooperative Pathfinding , author =","work_id":"ddc0733d-a5e4-4c97-a8ce-eef374ec498e","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Fast and Memory-Efficient Multi-Agent Pathfinding. , author =","work_id":"723fc84a-0281-4013-ba10-57c25eebbb22","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"SIPP: Safe interval path planning for dynamic environments , author =","work_id":"a13c365d-6c62-46b9-b01e-454e89935a93","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Structure and Intractability of Optimal Multi-Robot Path Planning on Graphs. , author =","work_id":"61ab1698-3424-4ae1-b8a4-1d1f5b35e72f","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":47,"snapshot_sha256":"d218dd6d0e3d0eaa92376b33da80b1929f457b7d05adad02ff23da4d919371dd","internal_anchors":0},"formal_canon":{"evidence_count":1,"snapshot_sha256":"d5d06ec78ba03bb64a90a365fc2ab7d72ce707d4c5b3947447771fb2ec8fbd53"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"21172b3d-8e96-4261-964a-06511da3f972"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:03:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lCLPOjrdIAj7ZP/JObsb9J32KVf2MlS649wJtykKDI2W7Gd3e+A5PSx5/1g+S6CrbxTXT9wToJyD21kLJvLRBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T11:23:05.786079Z"},"content_sha256":"e08664afb7e05bd59dadeeeec8311e746f4678748096c6b8cfcab824a511edf9","schema_version":"1.0","event_id":"sha256:e08664afb7e05bd59dadeeeec8311e746f4678748096c6b8cfcab824a511edf9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7XWV4CMHKQGMLN6SR7G5PNDPHK/bundle.json","state_url":"https://pith.science/pith/7XWV4CMHKQGMLN6SR7G5PNDPHK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7XWV4CMHKQGMLN6SR7G5PNDPHK/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-11T11:23:05Z","links":{"resolver":"https://pith.science/pith/7XWV4CMHKQGMLN6SR7G5PNDPHK","bundle":"https://pith.science/pith/7XWV4CMHKQGMLN6SR7G5PNDPHK/bundle.json","state":"https://pith.science/pith/7XWV4CMHKQGMLN6SR7G5PNDPHK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7XWV4CMHKQGMLN6SR7G5PNDPHK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:7XWV4CMHKQGMLN6SR7G5PNDPHK","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":"5afb98b75f4f09a538662960312f7eeadda91bd43b0e88cc8a8d9bd4e62ef717","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2026-05-16T07:39:21Z","title_canon_sha256":"dd59827bf16cdc4d9cc99c678200a4ab47cad0cc5cb09e9f547d353192c433e8"},"schema_version":"1.0","source":{"id":"2605.16855","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16855","created_at":"2026-05-20T00:03:26Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16855v1","created_at":"2026-05-20T00:03:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16855","created_at":"2026-05-20T00:03:26Z"},{"alias_kind":"pith_short_12","alias_value":"7XWV4CMHKQGM","created_at":"2026-05-20T00:03:26Z"},{"alias_kind":"pith_short_16","alias_value":"7XWV4CMHKQGMLN6S","created_at":"2026-05-20T00:03:26Z"},{"alias_kind":"pith_short_8","alias_value":"7XWV4CMH","created_at":"2026-05-20T00:03:26Z"}],"graph_snapshots":[{"event_id":"sha256:e08664afb7e05bd59dadeeeec8311e746f4678748096c6b8cfcab824a511edf9","target":"graph","created_at":"2026-05-20T00:03:26Z","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 method scales effectively, maintains high throughput even in compact, dense environments, and surpasses existing planners, thereby pushing the frontier of real-time, lifelong MAPF."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The assumption that local guidance cues developed for one-shot MAPF can be directly lifted to the lifelong setting via receding-horizon windows and warm-starting without introducing new congestion or throughput loss over long horizons."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"LLLG extends LaCAM with local guidance to lifelong MAPF using windowed planning and warm-starts, claiming higher throughput than prior planners in dense environments."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A receding-horizon LaCAM with local guidance lifted from one-shot MAPF achieves higher task throughput in lifelong multi-agent pathfinding."}],"snapshot_sha256":"2ee6b86343af66964760ddc10ac199d5f1cb4bb68112982cab7cdb2030721b8c"},"formal_canon":{"evidence_count":1,"snapshot_sha256":"d5d06ec78ba03bb64a90a365fc2ab7d72ce707d4c5b3947447771fb2ec8fbd53"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T19:31:18.979787Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T19:31:00.353625Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T18:41:56.310222Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T18:33:26.384821Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.16855/integrity.json","findings":[],"snapshot_sha256":"c2cfce1b708e106b3103ebbabebd9affc1c3b2c9f193d79233ff3270b7f1bb90","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Local guidance has recently proven to be a powerful driver of empirical performance in real-time, suboptimal multi-agent pathfinding (MAPF), improving the scalable configuration-based solver LaCAM. By injecting informative spatiotemporal cues around each agent, local guidance mitigates congestion, reduces waiting, and remains scalable enough even with tight time budgets, yielding state-of-the-art performance for one-shot MAPF. This study asks whether the same benefits can be lifted to the lifelong setting (LMAPF), where tasks arrive continuously and improvements in per-step plans can increase ","authors_text":"Keisuke Okumura, Tomoki Arita","cross_cats":[],"headline":"A receding-horizon LaCAM with local guidance lifted from one-shot MAPF achieves higher task throughput in lifelong multi-agent pathfinding.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2026-05-16T07:39:21Z","title":"Lifelong LaCAM with Local Guidance for Lifelong MAPF"},"references":{"count":47,"internal_anchors":0,"resolved_work":47,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Algorithmica , year =","work_id":"6aa5466e-d725-44dc-b9d7-894ba53ec9b6","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Cooperative Pathfinding , author =","work_id":"ddc0733d-a5e4-4c97-a8ce-eef374ec498e","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Fast and Memory-Efficient Multi-Agent Pathfinding. , author =","work_id":"723fc84a-0281-4013-ba10-57c25eebbb22","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"SIPP: Safe interval path planning for dynamic environments , author =","work_id":"a13c365d-6c62-46b9-b01e-454e89935a93","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Structure and Intractability of Optimal Multi-Robot Path Planning on Graphs. , author =","work_id":"61ab1698-3424-4ae1-b8a4-1d1f5b35e72f","year":null}],"snapshot_sha256":"d218dd6d0e3d0eaa92376b33da80b1929f457b7d05adad02ff23da4d919371dd"},"source":{"id":"2605.16855","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T19:23:12.756414Z","id":"21172b3d-8e96-4261-964a-06511da3f972","model_set":{"reader":"grok-4.3"},"one_line_summary":"LLLG extends LaCAM with local guidance to lifelong MAPF using windowed planning and warm-starts, claiming higher throughput than prior planners in dense environments.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A receding-horizon LaCAM with local guidance lifted from one-shot MAPF achieves higher task throughput in lifelong multi-agent pathfinding.","strongest_claim":"Our method scales effectively, maintains high throughput even in compact, dense environments, and surpasses existing planners, thereby pushing the frontier of real-time, lifelong MAPF.","weakest_assumption":"The assumption that local guidance cues developed for one-shot MAPF can be directly lifted to the lifelong setting via receding-horizon windows and warm-starting without introducing new congestion or throughput loss over long horizons."}},"verdict_id":"21172b3d-8e96-4261-964a-06511da3f972"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f3d5f4865e8007da742ebe0c3897177088ca12554141279c2408d178a9063e24","target":"record","created_at":"2026-05-20T00:03:26Z","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":"5afb98b75f4f09a538662960312f7eeadda91bd43b0e88cc8a8d9bd4e62ef717","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2026-05-16T07:39:21Z","title_canon_sha256":"dd59827bf16cdc4d9cc99c678200a4ab47cad0cc5cb09e9f547d353192c433e8"},"schema_version":"1.0","source":{"id":"2605.16855","kind":"arxiv","version":1}},"canonical_sha256":"fded5e0987540cc5b7d28fcdd7b46f3a9c31fb26f9bdf147846b86905503db38","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fded5e0987540cc5b7d28fcdd7b46f3a9c31fb26f9bdf147846b86905503db38","first_computed_at":"2026-05-20T00:03:26.433422Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:03:26.433422Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"z8/CorQXubyCuGB/RTXAW3CBYtEksZIPSE5HUpr9zWJTHu3j992E2pCvZJ3jh4VObOFnd3/QcPaC7YLwF7atDw==","signature_status":"signed_v1","signed_at":"2026-05-20T00:03:26.434352Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.16855","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f3d5f4865e8007da742ebe0c3897177088ca12554141279c2408d178a9063e24","sha256:e08664afb7e05bd59dadeeeec8311e746f4678748096c6b8cfcab824a511edf9"],"state_sha256":"0508e0589a2424d21f36b30b4641ba99ac7fb39400ef4a3e5ff0c6c283e5e127"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H+EHHbwuB0Wi03K/QecgHrtzKdSHDQN/3ID2FA4sQncrGxAlyK8YCqwj9AfA0ghGC8OpQifFAl+zxexgST90CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T11:23:05.788692Z","bundle_sha256":"ef8b0c46e262ebf982199f2a4b53bf5a164b2c89e1e4d8fac505327377cd0ce3"}}