{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:7RGT5VORVERLDTV3ENGI64ZB3Q","short_pith_number":"pith:7RGT5VOR","canonical_record":{"source":{"id":"2605.16791","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-16T03:50:42Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"d9cd7e20748abb22f550005a8fb7e3b33e1d038052a71dcd9f69cf588267b95d","abstract_canon_sha256":"3c322c05cd5fc5f7d61fd267a441b864f6a35771f111b798883fba4f14652cdb"},"schema_version":"1.0"},"canonical_sha256":"fc4d3ed5d1a922b1cebb234c8f7321dc2c9f0a96909947da40daf2f0d3f34bd4","source":{"kind":"arxiv","id":"2605.16791","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16791","created_at":"2026-05-20T00:03:22Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16791v1","created_at":"2026-05-20T00:03:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16791","created_at":"2026-05-20T00:03:22Z"},{"alias_kind":"pith_short_12","alias_value":"7RGT5VORVERL","created_at":"2026-05-20T00:03:22Z"},{"alias_kind":"pith_short_16","alias_value":"7RGT5VORVERLDTV3","created_at":"2026-05-20T00:03:22Z"},{"alias_kind":"pith_short_8","alias_value":"7RGT5VOR","created_at":"2026-05-20T00:03:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:7RGT5VORVERLDTV3ENGI64ZB3Q","target":"record","payload":{"canonical_record":{"source":{"id":"2605.16791","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-16T03:50:42Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"d9cd7e20748abb22f550005a8fb7e3b33e1d038052a71dcd9f69cf588267b95d","abstract_canon_sha256":"3c322c05cd5fc5f7d61fd267a441b864f6a35771f111b798883fba4f14652cdb"},"schema_version":"1.0"},"canonical_sha256":"fc4d3ed5d1a922b1cebb234c8f7321dc2c9f0a96909947da40daf2f0d3f34bd4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:03:22.258684Z","signature_b64":"K6xT81T1RgyC3KGTQlD/bdJWwXHEEhTYJAEi3sUIk65a/VFu8HDQLWgicDyT8pygfPupTwV22d0EXEf4/bSOBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc4d3ed5d1a922b1cebb234c8f7321dc2c9f0a96909947da40daf2f0d3f34bd4","last_reissued_at":"2026-05-20T00:03:22.257767Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:03:22.257767Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.16791","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:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NvTTnfeUiOyj52wlmgH+If4d5N2o/wFPdb/w+bIcmHw9lnqLF+vLSTz5BkpBIUaG0nZVuAhIIzGlxy5igy9/Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T22:55:43.282765Z"},"content_sha256":"87427ff7a3f10a331f5e7d14e7278e7ce25935026b3a51778d9c1f34ab19717a","schema_version":"1.0","event_id":"sha256:87427ff7a3f10a331f5e7d14e7278e7ce25935026b3a51778d9c1f34ab19717a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:7RGT5VORVERLDTV3ENGI64ZB3Q","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Parallel Algorithms for EF1 Allocations","license":"http://creativecommons.org/licenses/by/4.0/","headline":"New parallel algorithms compute EF1 allocations in NC for any constant number of agents while cutting depth and work for two agents.","cross_cats":["cs.GT"],"primary_cat":"cs.DS","authors_text":"D Ellis Hershkowitz, Gregory Kehne, Kishen N Gowda, Richard Z Huang","submitted_at":"2026-05-16T03:50:42Z","abstract_excerpt":"Allocating $m$ indivisible goods among $n$ agents is a fundamental task in fair division. Recent work of Garg and Psomas [AAMAS 2025] initiated the study of parallel algorithms for envy-free up to one good (EF1) allocations, giving NC algorithms for $2$ and $3$ agents. They also showed CC-hardness results for simulating the classic Round Robin algorithm for EF1 allocations, even when each agent values at most $3$ goods and each good is valued by at most $3$ agents.\n  We strengthen these results. For the case of $2$ agents, we quadratically improve the depth from $O(\\log ^ 2 m) $ to $O(\\log m)$"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We significantly generalize beyond 3 agents by giving NC algorithms for any constant number of agents. We also give randomized algorithms with depth Õ(m/n) and polynomial work.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The input valuations allow efficient parallel access and comparison operations in the PRAM or similar model without hidden logarithmic overheads that would invalidate the claimed depth bounds (implicit in the parallel algorithm constructions described in the abstract).","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"NC algorithms for EF1 with any constant number of agents, O(log m) depth for two agents, and RNC for EFk allocations up to k approximately sqrt(m).","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"New parallel algorithms compute EF1 allocations in NC for any constant number of agents while cutting depth and work for two agents.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"16c22d4e7061c74deba10a84ab9b814932a432dec0cd5d51fc37c8bf4641f8d8"},"source":{"id":"2605.16791","kind":"arxiv","version":1},"verdict":{"id":"601bb1bf-b78f-41c3-be4b-5bc0de0598ae","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T19:40:56.516186Z","strongest_claim":"We significantly generalize beyond 3 agents by giving NC algorithms for any constant number of agents. We also give randomized algorithms with depth Õ(m/n) and polynomial work.","one_line_summary":"NC algorithms for EF1 with any constant number of agents, O(log m) depth for two agents, and RNC for EFk allocations up to k approximately sqrt(m).","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The input valuations allow efficient parallel access and comparison operations in the PRAM or similar model without hidden logarithmic overheads that would invalidate the claimed depth bounds (implicit in the parallel algorithm constructions described in the abstract).","pith_extraction_headline":"New parallel algorithms compute EF1 allocations in NC for any constant number of agents while cutting depth and work for two agents."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.16791/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T20:01:19.062142Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T19:50:54.775146Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T19:01:56.294718Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T18:33:26.430641Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"ebae7f728e79dfe178005914ab3962bd2af83e71628c15f041efc6ab344e2bb7"},"references":{"count":55,"sample":[{"doi":"","year":null,"title":"Fairly Allocating Goods in Parallel , author=","work_id":"30cb347d-a7d6-4691-973d-9decc407e03d","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"A sublinear parallel algorithm for stable matching , volume =","work_id":"f5612a84-a232-4209-98ca-547d44a161ad","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2020,"title":"2020 , issue_date =","work_id":"84277e96-e4af-4c77-88ff-6eb09587ccb9","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Best of both worlds: Ex-ante and ex-post fairness in resource allocation , author=","work_id":"c0e21c38-679b-4646-be07-48468785a764","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"and Fineman, Jeremy T","work_id":"3cc41928-1406-4d0e-927b-347a0e70ebb2","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":55,"snapshot_sha256":"d384ed3ede43266f5a904086730be69cf94d4e08f9827a937032ae7e660a9a78","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":"601bb1bf-b78f-41c3-be4b-5bc0de0598ae"},"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:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x/EqD3+kq2JymhWCtd6yPVJdu0XI+9JrGjqb3nPE6W3dIUmRNuIwfkcqKcsXruGV7Y4eamjCNdVcqaEVXe8yAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T22:55:43.283594Z"},"content_sha256":"33c41abdaf6a1bdc19a274b25fd63e04b102cde842a10bcfea11e4b89fbfcecc","schema_version":"1.0","event_id":"sha256:33c41abdaf6a1bdc19a274b25fd63e04b102cde842a10bcfea11e4b89fbfcecc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7RGT5VORVERLDTV3ENGI64ZB3Q/bundle.json","state_url":"https://pith.science/pith/7RGT5VORVERLDTV3ENGI64ZB3Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7RGT5VORVERLDTV3ENGI64ZB3Q/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-10T22:55:43Z","links":{"resolver":"https://pith.science/pith/7RGT5VORVERLDTV3ENGI64ZB3Q","bundle":"https://pith.science/pith/7RGT5VORVERLDTV3ENGI64ZB3Q/bundle.json","state":"https://pith.science/pith/7RGT5VORVERLDTV3ENGI64ZB3Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7RGT5VORVERLDTV3ENGI64ZB3Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:7RGT5VORVERLDTV3ENGI64ZB3Q","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":"3c322c05cd5fc5f7d61fd267a441b864f6a35771f111b798883fba4f14652cdb","cross_cats_sorted":["cs.GT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-16T03:50:42Z","title_canon_sha256":"d9cd7e20748abb22f550005a8fb7e3b33e1d038052a71dcd9f69cf588267b95d"},"schema_version":"1.0","source":{"id":"2605.16791","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16791","created_at":"2026-05-20T00:03:22Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16791v1","created_at":"2026-05-20T00:03:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16791","created_at":"2026-05-20T00:03:22Z"},{"alias_kind":"pith_short_12","alias_value":"7RGT5VORVERL","created_at":"2026-05-20T00:03:22Z"},{"alias_kind":"pith_short_16","alias_value":"7RGT5VORVERLDTV3","created_at":"2026-05-20T00:03:22Z"},{"alias_kind":"pith_short_8","alias_value":"7RGT5VOR","created_at":"2026-05-20T00:03:22Z"}],"graph_snapshots":[{"event_id":"sha256:33c41abdaf6a1bdc19a274b25fd63e04b102cde842a10bcfea11e4b89fbfcecc","target":"graph","created_at":"2026-05-20T00:03:22Z","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 significantly generalize beyond 3 agents by giving NC algorithms for any constant number of agents. We also give randomized algorithms with depth Õ(m/n) and polynomial work."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The input valuations allow efficient parallel access and comparison operations in the PRAM or similar model without hidden logarithmic overheads that would invalidate the claimed depth bounds (implicit in the parallel algorithm constructions described in the abstract)."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"NC algorithms for EF1 with any constant number of agents, O(log m) depth for two agents, and RNC for EFk allocations up to k approximately sqrt(m)."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"New parallel algorithms compute EF1 allocations in NC for any constant number of agents while cutting depth and work for two agents."}],"snapshot_sha256":"16c22d4e7061c74deba10a84ab9b814932a432dec0cd5d51fc37c8bf4641f8d8"},"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-19T20:01:19.062142Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T19:50:54.775146Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T19:01:56.294718Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T18:33:26.430641Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.16791/integrity.json","findings":[],"snapshot_sha256":"ebae7f728e79dfe178005914ab3962bd2af83e71628c15f041efc6ab344e2bb7","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Allocating $m$ indivisible goods among $n$ agents is a fundamental task in fair division. Recent work of Garg and Psomas [AAMAS 2025] initiated the study of parallel algorithms for envy-free up to one good (EF1) allocations, giving NC algorithms for $2$ and $3$ agents. They also showed CC-hardness results for simulating the classic Round Robin algorithm for EF1 allocations, even when each agent values at most $3$ goods and each good is valued by at most $3$ agents.\n  We strengthen these results. For the case of $2$ agents, we quadratically improve the depth from $O(\\log ^ 2 m) $ to $O(\\log m)$","authors_text":"D Ellis Hershkowitz, Gregory Kehne, Kishen N Gowda, Richard Z Huang","cross_cats":["cs.GT"],"headline":"New parallel algorithms compute EF1 allocations in NC for any constant number of agents while cutting depth and work for two agents.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-16T03:50:42Z","title":"Improved Parallel Algorithms for EF1 Allocations"},"references":{"count":55,"internal_anchors":0,"resolved_work":55,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Fairly Allocating Goods in Parallel , author=","work_id":"30cb347d-a7d6-4691-973d-9decc407e03d","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"A sublinear parallel algorithm for stable matching , volume =","work_id":"f5612a84-a232-4209-98ca-547d44a161ad","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"2020 , issue_date =","work_id":"84277e96-e4af-4c77-88ff-6eb09587ccb9","year":2020},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Best of both worlds: Ex-ante and ex-post fairness in resource allocation , author=","work_id":"c0e21c38-679b-4646-be07-48468785a764","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"and Fineman, Jeremy T","work_id":"3cc41928-1406-4d0e-927b-347a0e70ebb2","year":null}],"snapshot_sha256":"d384ed3ede43266f5a904086730be69cf94d4e08f9827a937032ae7e660a9a78"},"source":{"id":"2605.16791","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T19:40:56.516186Z","id":"601bb1bf-b78f-41c3-be4b-5bc0de0598ae","model_set":{"reader":"grok-4.3"},"one_line_summary":"NC algorithms for EF1 with any constant number of agents, O(log m) depth for two agents, and RNC for EFk allocations up to k approximately sqrt(m).","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"New parallel algorithms compute EF1 allocations in NC for any constant number of agents while cutting depth and work for two agents.","strongest_claim":"We significantly generalize beyond 3 agents by giving NC algorithms for any constant number of agents. We also give randomized algorithms with depth Õ(m/n) and polynomial work.","weakest_assumption":"The input valuations allow efficient parallel access and comparison operations in the PRAM or similar model without hidden logarithmic overheads that would invalidate the claimed depth bounds (implicit in the parallel algorithm constructions described in the abstract)."}},"verdict_id":"601bb1bf-b78f-41c3-be4b-5bc0de0598ae"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:87427ff7a3f10a331f5e7d14e7278e7ce25935026b3a51778d9c1f34ab19717a","target":"record","created_at":"2026-05-20T00:03:22Z","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":"3c322c05cd5fc5f7d61fd267a441b864f6a35771f111b798883fba4f14652cdb","cross_cats_sorted":["cs.GT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-16T03:50:42Z","title_canon_sha256":"d9cd7e20748abb22f550005a8fb7e3b33e1d038052a71dcd9f69cf588267b95d"},"schema_version":"1.0","source":{"id":"2605.16791","kind":"arxiv","version":1}},"canonical_sha256":"fc4d3ed5d1a922b1cebb234c8f7321dc2c9f0a96909947da40daf2f0d3f34bd4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fc4d3ed5d1a922b1cebb234c8f7321dc2c9f0a96909947da40daf2f0d3f34bd4","first_computed_at":"2026-05-20T00:03:22.257767Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:03:22.257767Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"K6xT81T1RgyC3KGTQlD/bdJWwXHEEhTYJAEi3sUIk65a/VFu8HDQLWgicDyT8pygfPupTwV22d0EXEf4/bSOBg==","signature_status":"signed_v1","signed_at":"2026-05-20T00:03:22.258684Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.16791","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:87427ff7a3f10a331f5e7d14e7278e7ce25935026b3a51778d9c1f34ab19717a","sha256:33c41abdaf6a1bdc19a274b25fd63e04b102cde842a10bcfea11e4b89fbfcecc"],"state_sha256":"8b6ddb57eff9d74c4a623c9bc755acb21addcbc75eee3e929171abdc84bd6136"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MUEVXmWvzCA5D8DARcHWTVZ/riBtLcbnML6PeDuVj10fVoiAt2IJlSHt0FbQHxK4eY8UQ8MRUeD+36C8jsvKAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T22:55:43.286480Z","bundle_sha256":"de21f07d4399901cbc2701ce797a1d866a0c091b39a01df46f0db850b7d77b62"}}