{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:GGWLA2XCY3BUPSXI2CXPN6CGKP","short_pith_number":"pith:GGWLA2XC","canonical_record":{"source":{"id":"2605.13900","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2026-05-12T16:57:24Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"4a3924843c076074726e4819eb47533a7c9c4136a43a6c550f7ad08390dfa34b","abstract_canon_sha256":"b5311d1a7aae2939dba6ab5e28f7696ce983686074c3b0195adfc82df2cafa71"},"schema_version":"1.0"},"canonical_sha256":"31acb06ae2c6c347cae8d0aef6f84653e89a0fb34799d5972545c29a8a898e1f","source":{"kind":"arxiv","id":"2605.13900","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13900","created_at":"2026-05-17T23:39:18Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13900v1","created_at":"2026-05-17T23:39:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13900","created_at":"2026-05-17T23:39:18Z"},{"alias_kind":"pith_short_12","alias_value":"GGWLA2XCY3BU","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"GGWLA2XCY3BUPSXI","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"GGWLA2XC","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:GGWLA2XCY3BUPSXI2CXPN6CGKP","target":"record","payload":{"canonical_record":{"source":{"id":"2605.13900","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2026-05-12T16:57:24Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"4a3924843c076074726e4819eb47533a7c9c4136a43a6c550f7ad08390dfa34b","abstract_canon_sha256":"b5311d1a7aae2939dba6ab5e28f7696ce983686074c3b0195adfc82df2cafa71"},"schema_version":"1.0"},"canonical_sha256":"31acb06ae2c6c347cae8d0aef6f84653e89a0fb34799d5972545c29a8a898e1f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:18.944443Z","signature_b64":"7FcPRmcUY3X9IBXTjzd5vgknkzoSyPJ3Hakl65h57KXk7YPKSKzITJSsttzBG5SXwxN2QUBN1apuHaqAXJiHCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"31acb06ae2c6c347cae8d0aef6f84653e89a0fb34799d5972545c29a8a898e1f","last_reissued_at":"2026-05-17T23:39:18.943744Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:18.943744Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.13900","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-17T23:39:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vtyujen4FVpAvBXhWBHULwdyb4jLqj39CXoFULaUOA4vfxOHKMDC56vxLstAl8lRgMVD7yHAePZVanWoVmC6Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T04:29:56.730475Z"},"content_sha256":"1f5acff142a8a622294c595d0812b6d5ee3c3278adf132bb208a351c4c0d3b82","schema_version":"1.0","event_id":"sha256:1f5acff142a8a622294c595d0812b6d5ee3c3278adf132bb208a351c4c0d3b82"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:GGWLA2XCY3BUPSXI2CXPN6CGKP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Ready from Day 1: Population-Aware Coordination for Large-Scale Constrained Multi-Agent Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Population-aware learned maps let planners coordinate large multi-agent systems across changing compositions without retraining.","cross_cats":["cs.LG"],"primary_cat":"cs.MA","authors_text":"Alvaro Maggiar, Angel Wang, Carson Eisenach, Dean Foster, Dominique Perrault-Joncas","submitted_at":"2026-05-12T16:57:24Z","abstract_excerpt":"In large-scale multi-agent systems with shared resource constraints, an upstream planner must iteratively evaluate candidate resource plans -- assessing feasibility, aggregate response, and marginal cost -- before committing to one. Lagrangian relaxation separates local decisions through a broadcast cost signal, but the planner still needs the cost-to-utilization response map to explore plan space, and this map depends on population composition that changes across planning cycles. We propose \\emph{population-aware coordination interfaces}: learned primal and dual maps, conditioned on compact p"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"In a supply-chain capacity-control case study, population-aware interfaces reduce forecast error by 16--19% and capacity violations by 20--51% relative to population-unaware baselines under composition shift; 20K-agent cohorts support accurate coordination of 500K-agent populations; and simulator-trained primal maps achieve 11.1% MAPE on real observations versus 13--24% for baselines.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That compact population summaries encode sufficient response-relevant structure for the learned primal and dual maps to remain reliable across evolving populations without per-cycle retraining.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Population-conditioned learned primal and dual maps support reliable coordination of large multi-agent systems under composition shifts without per-cycle retraining, cutting forecast error 16-19% and violations 20-51% in supply-chain tests.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Population-aware learned maps let planners coordinate large multi-agent systems across changing compositions without retraining.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"3f0a69b4635a59c515f04539b7111512c134118a22b0b5752b6b22c79388f12e"},"source":{"id":"2605.13900","kind":"arxiv","version":1},"verdict":{"id":"7955b3a3-4bbf-4317-b95e-a51862f8a10f","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T04:58:48.008522Z","strongest_claim":"In a supply-chain capacity-control case study, population-aware interfaces reduce forecast error by 16--19% and capacity violations by 20--51% relative to population-unaware baselines under composition shift; 20K-agent cohorts support accurate coordination of 500K-agent populations; and simulator-trained primal maps achieve 11.1% MAPE on real observations versus 13--24% for baselines.","one_line_summary":"Population-conditioned learned primal and dual maps support reliable coordination of large multi-agent systems under composition shifts without per-cycle retraining, cutting forecast error 16-19% and violations 20-51% in supply-chain tests.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That compact population summaries encode sufficient response-relevant structure for the learned primal and dual maps to remain reliable across evolving populations without per-cycle retraining.","pith_extraction_headline":"Population-aware learned maps let planners coordinate large multi-agent systems across changing compositions without retraining."},"references":{"count":45,"sample":[{"doi":"","year":2003,"title":"CACHON, G. P. (2003). Supply chain coordination with contracts. InHandbooks in Operations Research and Management Science, vol. 11. Elsevier, 227–339","work_id":"ee151e89-05c7-4c24-a4b9-abfb2bef5d4d","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1999,"title":"FEDERGRUEN, A. and ZIPKIN, P. H. (1999). Coordination mechanisms for a distribution system with one supplier and multiple retailers.Management science451493–1507","work_id":"84747aec-ba7e-47a5-917e-e8e9e08d00d7","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2011,"title":"BOYD, S., PARIKH, N., CHU, E., PELEATO, B. and ECKSTEIN, J. (2011). Distributed opti- mization and statistical learning via the alternating direction method of multipliers.Foundations and Trends in Ma","work_id":"16f5a3ce-3379-4759-9ca9-63d6f32bd3a9","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1981,"title":"FISHER, M. L. (1981). The lagrangian relaxation method for solving integer programming problems.Management science271–18","work_id":"eb40f41a-6d11-485d-9104-4de30a80e625","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2017,"title":"LOWE, R., WU, Y., TAMAR, A., HARB, J., ABBEEL, P. and MORDATCH, I. (2017). Multi- agent actor-critic for mixed cooperative-competitive environments. InAdvances in Neural Information Processing Systems","work_id":"3ad30ad7-ff6e-452c-a00f-db72c9598866","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":45,"snapshot_sha256":"c2e1daaa13517e08411150ee243bb35454a45f9793a23cee8a244fe696a21009","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":"7955b3a3-4bbf-4317-b95e-a51862f8a10f"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:39:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lYfCA06daR/I2lf2cuwxaJ0Ot2twopdiV/79n7WE5mtsiUg3ule9kKfeevVVjVhaQvMbTemHMYngW1iFgT18AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T04:29:56.731189Z"},"content_sha256":"50475a714fa78fba65275129018ea02fc99ff577f72b0a147eaf9c5f9140b182","schema_version":"1.0","event_id":"sha256:50475a714fa78fba65275129018ea02fc99ff577f72b0a147eaf9c5f9140b182"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GGWLA2XCY3BUPSXI2CXPN6CGKP/bundle.json","state_url":"https://pith.science/pith/GGWLA2XCY3BUPSXI2CXPN6CGKP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GGWLA2XCY3BUPSXI2CXPN6CGKP/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-05-26T04:29:56Z","links":{"resolver":"https://pith.science/pith/GGWLA2XCY3BUPSXI2CXPN6CGKP","bundle":"https://pith.science/pith/GGWLA2XCY3BUPSXI2CXPN6CGKP/bundle.json","state":"https://pith.science/pith/GGWLA2XCY3BUPSXI2CXPN6CGKP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GGWLA2XCY3BUPSXI2CXPN6CGKP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:GGWLA2XCY3BUPSXI2CXPN6CGKP","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":"b5311d1a7aae2939dba6ab5e28f7696ce983686074c3b0195adfc82df2cafa71","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2026-05-12T16:57:24Z","title_canon_sha256":"4a3924843c076074726e4819eb47533a7c9c4136a43a6c550f7ad08390dfa34b"},"schema_version":"1.0","source":{"id":"2605.13900","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13900","created_at":"2026-05-17T23:39:18Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13900v1","created_at":"2026-05-17T23:39:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13900","created_at":"2026-05-17T23:39:18Z"},{"alias_kind":"pith_short_12","alias_value":"GGWLA2XCY3BU","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"GGWLA2XCY3BUPSXI","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"GGWLA2XC","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:50475a714fa78fba65275129018ea02fc99ff577f72b0a147eaf9c5f9140b182","target":"graph","created_at":"2026-05-17T23:39:18Z","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":"In a supply-chain capacity-control case study, population-aware interfaces reduce forecast error by 16--19% and capacity violations by 20--51% relative to population-unaware baselines under composition shift; 20K-agent cohorts support accurate coordination of 500K-agent populations; and simulator-trained primal maps achieve 11.1% MAPE on real observations versus 13--24% for baselines."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That compact population summaries encode sufficient response-relevant structure for the learned primal and dual maps to remain reliable across evolving populations without per-cycle retraining."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Population-conditioned learned primal and dual maps support reliable coordination of large multi-agent systems under composition shifts without per-cycle retraining, cutting forecast error 16-19% and violations 20-51% in supply-chain tests."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Population-aware learned maps let planners coordinate large multi-agent systems across changing compositions without retraining."}],"snapshot_sha256":"3f0a69b4635a59c515f04539b7111512c134118a22b0b5752b6b22c79388f12e"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"In large-scale multi-agent systems with shared resource constraints, an upstream planner must iteratively evaluate candidate resource plans -- assessing feasibility, aggregate response, and marginal cost -- before committing to one. Lagrangian relaxation separates local decisions through a broadcast cost signal, but the planner still needs the cost-to-utilization response map to explore plan space, and this map depends on population composition that changes across planning cycles. We propose \\emph{population-aware coordination interfaces}: learned primal and dual maps, conditioned on compact p","authors_text":"Alvaro Maggiar, Angel Wang, Carson Eisenach, Dean Foster, Dominique Perrault-Joncas","cross_cats":["cs.LG"],"headline":"Population-aware learned maps let planners coordinate large multi-agent systems across changing compositions without retraining.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2026-05-12T16:57:24Z","title":"Ready from Day 1: Population-Aware Coordination for Large-Scale Constrained Multi-Agent Systems"},"references":{"count":45,"internal_anchors":0,"resolved_work":45,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"CACHON, G. P. (2003). Supply chain coordination with contracts. InHandbooks in Operations Research and Management Science, vol. 11. Elsevier, 227–339","work_id":"ee151e89-05c7-4c24-a4b9-abfb2bef5d4d","year":2003},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"FEDERGRUEN, A. and ZIPKIN, P. H. (1999). Coordination mechanisms for a distribution system with one supplier and multiple retailers.Management science451493–1507","work_id":"84747aec-ba7e-47a5-917e-e8e9e08d00d7","year":1999},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"BOYD, S., PARIKH, N., CHU, E., PELEATO, B. and ECKSTEIN, J. (2011). Distributed opti- mization and statistical learning via the alternating direction method of multipliers.Foundations and Trends in Ma","work_id":"16f5a3ce-3379-4759-9ca9-63d6f32bd3a9","year":2011},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"FISHER, M. L. (1981). The lagrangian relaxation method for solving integer programming problems.Management science271–18","work_id":"eb40f41a-6d11-485d-9104-4de30a80e625","year":1981},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"LOWE, R., WU, Y., TAMAR, A., HARB, J., ABBEEL, P. and MORDATCH, I. (2017). Multi- agent actor-critic for mixed cooperative-competitive environments. InAdvances in Neural Information Processing Systems","work_id":"3ad30ad7-ff6e-452c-a00f-db72c9598866","year":2017}],"snapshot_sha256":"c2e1daaa13517e08411150ee243bb35454a45f9793a23cee8a244fe696a21009"},"source":{"id":"2605.13900","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-15T04:58:48.008522Z","id":"7955b3a3-4bbf-4317-b95e-a51862f8a10f","model_set":{"reader":"grok-4.3"},"one_line_summary":"Population-conditioned learned primal and dual maps support reliable coordination of large multi-agent systems under composition shifts without per-cycle retraining, cutting forecast error 16-19% and violations 20-51% in supply-chain tests.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Population-aware learned maps let planners coordinate large multi-agent systems across changing compositions without retraining.","strongest_claim":"In a supply-chain capacity-control case study, population-aware interfaces reduce forecast error by 16--19% and capacity violations by 20--51% relative to population-unaware baselines under composition shift; 20K-agent cohorts support accurate coordination of 500K-agent populations; and simulator-trained primal maps achieve 11.1% MAPE on real observations versus 13--24% for baselines.","weakest_assumption":"That compact population summaries encode sufficient response-relevant structure for the learned primal and dual maps to remain reliable across evolving populations without per-cycle retraining."}},"verdict_id":"7955b3a3-4bbf-4317-b95e-a51862f8a10f"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:1f5acff142a8a622294c595d0812b6d5ee3c3278adf132bb208a351c4c0d3b82","target":"record","created_at":"2026-05-17T23:39:18Z","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":"b5311d1a7aae2939dba6ab5e28f7696ce983686074c3b0195adfc82df2cafa71","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2026-05-12T16:57:24Z","title_canon_sha256":"4a3924843c076074726e4819eb47533a7c9c4136a43a6c550f7ad08390dfa34b"},"schema_version":"1.0","source":{"id":"2605.13900","kind":"arxiv","version":1}},"canonical_sha256":"31acb06ae2c6c347cae8d0aef6f84653e89a0fb34799d5972545c29a8a898e1f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"31acb06ae2c6c347cae8d0aef6f84653e89a0fb34799d5972545c29a8a898e1f","first_computed_at":"2026-05-17T23:39:18.943744Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:18.943744Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7FcPRmcUY3X9IBXTjzd5vgknkzoSyPJ3Hakl65h57KXk7YPKSKzITJSsttzBG5SXwxN2QUBN1apuHaqAXJiHCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:18.944443Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.13900","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1f5acff142a8a622294c595d0812b6d5ee3c3278adf132bb208a351c4c0d3b82","sha256:50475a714fa78fba65275129018ea02fc99ff577f72b0a147eaf9c5f9140b182"],"state_sha256":"ecc9d1139a08b2f9ce2912ccb9e668ed96f2e175faf5ca8e893e6ed7253c4ab7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jSDCTcIJhSiD7tosQ1nmkp43vHh9ZUfeMnk8aSwdQQRIlWLDYJi0bwJusix+EzqQtR9PaYoVSmhvLQyrEYR8Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T04:29:56.734563Z","bundle_sha256":"f14c26118da4f106cc4e3f301e57c1e06cbe9cb66f800a2c49c6ad1425cde61a"}}