{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:Q5GIG4PTRUUKZ2NI6EYHEQ2NV6","short_pith_number":"pith:Q5GIG4PT","canonical_record":{"source":{"id":"2603.07094","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2026-03-07T08:04:08Z","cross_cats_sorted":["cs.FL","cs.MA"],"title_canon_sha256":"e85579a5a0cb627d83b186a19cba3c3292ea0b0b08c1156a0ed14d9d55324e1c","abstract_canon_sha256":"89e689c6e25de08993e3bee9cfa63ab722ed69d2246e1e557ef21d1b2459c933"},"schema_version":"1.0"},"canonical_sha256":"874c8371f38d28ace9a8f13072434daf91fd0d0ef0611681aded24e5edbae097","source":{"kind":"arxiv","id":"2603.07094","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2603.07094","created_at":"2026-05-18T02:44:30Z"},{"alias_kind":"arxiv_version","alias_value":"2603.07094v2","created_at":"2026-05-18T02:44:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.07094","created_at":"2026-05-18T02:44:30Z"},{"alias_kind":"pith_short_12","alias_value":"Q5GIG4PTRUUK","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"Q5GIG4PTRUUKZ2NI","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"Q5GIG4PT","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:Q5GIG4PTRUUKZ2NI6EYHEQ2NV6","target":"record","payload":{"canonical_record":{"source":{"id":"2603.07094","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2026-03-07T08:04:08Z","cross_cats_sorted":["cs.FL","cs.MA"],"title_canon_sha256":"e85579a5a0cb627d83b186a19cba3c3292ea0b0b08c1156a0ed14d9d55324e1c","abstract_canon_sha256":"89e689c6e25de08993e3bee9cfa63ab722ed69d2246e1e557ef21d1b2459c933"},"schema_version":"1.0"},"canonical_sha256":"874c8371f38d28ace9a8f13072434daf91fd0d0ef0611681aded24e5edbae097","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:30.870867Z","signature_b64":"HdDA/qWZzhr2h4iuqSZNZ9S0lLdCSlEytJID2eQf61dTyOgbpYjJt6ItLiWaYq/c0dYbF5pEOqq9Xd/yUCg7Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"874c8371f38d28ace9a8f13072434daf91fd0d0ef0611681aded24e5edbae097","last_reissued_at":"2026-05-18T02:44:30.870235Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:30.870235Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2603.07094","source_version":2,"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-18T02:44:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LtagimvprcPHXo5rm3YRRyJg0TgqrbrijdDvURIFGOJcN4oI+3oJ+zylKW7K8GCT+3bElQiTV9W+5CGYkhidBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T15:13:13.462215Z"},"content_sha256":"76ac241595719817f9731c9f8c9d25c1eed7236a1911f69da60a9366a60153a7","schema_version":"1.0","event_id":"sha256:76ac241595719817f9731c9f8c9d25c1eed7236a1911f69da60a9366a60153a7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:Q5GIG4PTRUUKZ2NI6EYHEQ2NV6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Randomise Alone, Reach as a Team","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Memoryless strategies suffice for teams to exceed winning probability thresholds in games with private randomness.","cross_cats":["cs.FL","cs.MA"],"primary_cat":"cs.GT","authors_text":"Alipasha Montaseri, Ali Shafiee, K. S. Thejaswini, L\\'eonard Brice, Thomas A. Henzinger","submitted_at":"2026-03-07T08:04:08Z","abstract_excerpt":"We study concurrent graph games where n players cooperate against an opponent to reach a set of target states. Unlike traditional settings, we study distributed randomisation: team players do not share a source of randomness, and their private random sources are hidden from the opponent and from each other.\n  We show that memoryless strategies are sufficient for the threshold problem (deciding whether there is a strategy for the team that ensures winning with probability that exceeds a threshold), a result that not only places the problem in the Existential Theory of the Reals (\\exists\\mathbb{"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We show that memoryless strategies are sufficient for the threshold problem (deciding whether there is a strategy for the team that ensures winning with probability that exceeds a threshold), a result that not only places the problem in the Existential Theory of the Reals (∃R) but also enables the construction of value iteration algorithms.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The model assumes that private random sources are completely hidden from the opponent and from each other, and that the graph game is finite and turn-based; if shared randomness or observable randomness were allowed, the memoryless claim would not necessarily hold.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"In concurrent graph games with distributed private randomness, memoryless strategies decide threshold reachability (NP-hard) and almost-sure reachability is NP-complete; IRATL extends ATL for probability thresholds without shared randomness.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Memoryless strategies suffice for teams to exceed winning probability thresholds in games with private randomness.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"dd98ad1dd42c12e33d2f2829ff30887d3b8adade02114906db44223b66e0057f"},"source":{"id":"2603.07094","kind":"arxiv","version":2},"verdict":{"id":"55f9138b-b89f-4fb8-ba3a-d1254d4a48ac","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T15:46:18.285425Z","strongest_claim":"We show that memoryless strategies are sufficient for the threshold problem (deciding whether there is a strategy for the team that ensures winning with probability that exceeds a threshold), a result that not only places the problem in the Existential Theory of the Reals (∃R) but also enables the construction of value iteration algorithms.","one_line_summary":"In concurrent graph games with distributed private randomness, memoryless strategies decide threshold reachability (NP-hard) and almost-sure reachability is NP-complete; IRATL extends ATL for probability thresholds without shared randomness.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The model assumes that private random sources are completely hidden from the opponent and from each other, and that the graph game is finite and turn-based; if shared randomness or observable randomness were allowed, the memoryless claim would not necessarily hold.","pith_extraction_headline":"Memoryless strategies suffice for teams to exceed winning probability thresholds in games with private randomness."},"references":{"count":56,"sample":[{"doi":"","year":2001,"title":"In: CONCUR 2001 — Concurrency Theory","work_id":"f852c59f-045f-4d32-ad85-27019ec1ffa6","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1145/585265.585270","year":2002,"title":"Henzinger & Orna Kupferman (2002):Alternating-Time Temporal Logic.Journal of the ACM49, pp","work_id":"5612a98f-95fc-4339-a923-a82849125877","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1016/s1474-6670(17)43768-2","year":1996,"title":"Attoui, A.: Multi-agent based method for reactive systems formal specification and validation. IFAC Proceedings Volumes29(2), 1–6 (1996).https://doi.org/ https://doi.org/10.1016/S1474-6670(17)43768-2,","work_id":"e3f33ab9-5673-44ac-8543-e07c318ea02c","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.48550/arxiv.2510.02984","year":2025,"title":"CoRRabs/2510.02984(2025).https://doi.org/10","work_id":"60d5e701-0d1a-4b53-b8b0-e3b9dd24f4ee","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.4230/lipics.fsttcs.2019","year":2019,"title":"In: FSTTCS 2019","work_id":"410e61dd-a39d-4437-974d-528541a31632","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":56,"snapshot_sha256":"2532dab5838251ac483f65a4be1f955fd43c68bdc047b4927ebf4ca60ca9487d","internal_anchors":2},"formal_canon":{"evidence_count":2,"snapshot_sha256":"22efb3b91ac17811b10eb2e140f0887c06dd4ebf38490e3b22feef88c814dd5c"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"55f9138b-b89f-4fb8-ba3a-d1254d4a48ac"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:44:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AlsamIgMCG/LdNtHH196yEiaoSN/OJz5qy1xzRH2214e6uujKg0oU1FKH3jjaCwyP9scTUxYJGewFDyxPhueDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T15:13:13.462893Z"},"content_sha256":"c209510c452370af23f645b23ab65b321aadb56df498be004c29cb26a616fb29","schema_version":"1.0","event_id":"sha256:c209510c452370af23f645b23ab65b321aadb56df498be004c29cb26a616fb29"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q5GIG4PTRUUKZ2NI6EYHEQ2NV6/bundle.json","state_url":"https://pith.science/pith/Q5GIG4PTRUUKZ2NI6EYHEQ2NV6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q5GIG4PTRUUKZ2NI6EYHEQ2NV6/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-02T15:13:13Z","links":{"resolver":"https://pith.science/pith/Q5GIG4PTRUUKZ2NI6EYHEQ2NV6","bundle":"https://pith.science/pith/Q5GIG4PTRUUKZ2NI6EYHEQ2NV6/bundle.json","state":"https://pith.science/pith/Q5GIG4PTRUUKZ2NI6EYHEQ2NV6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q5GIG4PTRUUKZ2NI6EYHEQ2NV6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:Q5GIG4PTRUUKZ2NI6EYHEQ2NV6","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":"89e689c6e25de08993e3bee9cfa63ab722ed69d2246e1e557ef21d1b2459c933","cross_cats_sorted":["cs.FL","cs.MA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2026-03-07T08:04:08Z","title_canon_sha256":"e85579a5a0cb627d83b186a19cba3c3292ea0b0b08c1156a0ed14d9d55324e1c"},"schema_version":"1.0","source":{"id":"2603.07094","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2603.07094","created_at":"2026-05-18T02:44:30Z"},{"alias_kind":"arxiv_version","alias_value":"2603.07094v2","created_at":"2026-05-18T02:44:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.07094","created_at":"2026-05-18T02:44:30Z"},{"alias_kind":"pith_short_12","alias_value":"Q5GIG4PTRUUK","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"Q5GIG4PTRUUKZ2NI","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"Q5GIG4PT","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:c209510c452370af23f645b23ab65b321aadb56df498be004c29cb26a616fb29","target":"graph","created_at":"2026-05-18T02:44:30Z","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 show that memoryless strategies are sufficient for the threshold problem (deciding whether there is a strategy for the team that ensures winning with probability that exceeds a threshold), a result that not only places the problem in the Existential Theory of the Reals (∃R) but also enables the construction of value iteration algorithms."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The model assumes that private random sources are completely hidden from the opponent and from each other, and that the graph game is finite and turn-based; if shared randomness or observable randomness were allowed, the memoryless claim would not necessarily hold."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"In concurrent graph games with distributed private randomness, memoryless strategies decide threshold reachability (NP-hard) and almost-sure reachability is NP-complete; IRATL extends ATL for probability thresholds without shared randomness."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Memoryless strategies suffice for teams to exceed winning probability thresholds in games with private randomness."}],"snapshot_sha256":"dd98ad1dd42c12e33d2f2829ff30887d3b8adade02114906db44223b66e0057f"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"22efb3b91ac17811b10eb2e140f0887c06dd4ebf38490e3b22feef88c814dd5c"},"paper":{"abstract_excerpt":"We study concurrent graph games where n players cooperate against an opponent to reach a set of target states. Unlike traditional settings, we study distributed randomisation: team players do not share a source of randomness, and their private random sources are hidden from the opponent and from each other.\n  We show that memoryless strategies are sufficient for the threshold problem (deciding whether there is a strategy for the team that ensures winning with probability that exceeds a threshold), a result that not only places the problem in the Existential Theory of the Reals (\\exists\\mathbb{","authors_text":"Alipasha Montaseri, Ali Shafiee, K. S. Thejaswini, L\\'eonard Brice, Thomas A. Henzinger","cross_cats":["cs.FL","cs.MA"],"headline":"Memoryless strategies suffice for teams to exceed winning probability thresholds in games with private randomness.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2026-03-07T08:04:08Z","title":"Randomise Alone, Reach as a Team"},"references":{"count":56,"internal_anchors":2,"resolved_work":56,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"In: CONCUR 2001 — Concurrency Theory","work_id":"f852c59f-045f-4d32-ad85-27019ec1ffa6","year":2001},{"cited_arxiv_id":"","doi":"10.1145/585265.585270","is_internal_anchor":false,"ref_index":2,"title":"Henzinger & Orna Kupferman (2002):Alternating-Time Temporal Logic.Journal of the ACM49, pp","work_id":"5612a98f-95fc-4339-a923-a82849125877","year":2002},{"cited_arxiv_id":"","doi":"10.1016/s1474-6670(17)43768-2","is_internal_anchor":false,"ref_index":3,"title":"Attoui, A.: Multi-agent based method for reactive systems formal specification and validation. IFAC Proceedings Volumes29(2), 1–6 (1996).https://doi.org/ https://doi.org/10.1016/S1474-6670(17)43768-2,","work_id":"e3f33ab9-5673-44ac-8543-e07c318ea02c","year":1996},{"cited_arxiv_id":"","doi":"10.48550/arxiv.2510.02984","is_internal_anchor":false,"ref_index":4,"title":"CoRRabs/2510.02984(2025).https://doi.org/10","work_id":"60d5e701-0d1a-4b53-b8b0-e3b9dd24f4ee","year":2025},{"cited_arxiv_id":"","doi":"10.4230/lipics.fsttcs.2019","is_internal_anchor":false,"ref_index":5,"title":"In: FSTTCS 2019","work_id":"410e61dd-a39d-4437-974d-528541a31632","year":2019}],"snapshot_sha256":"2532dab5838251ac483f65a4be1f955fd43c68bdc047b4927ebf4ca60ca9487d"},"source":{"id":"2603.07094","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-15T15:46:18.285425Z","id":"55f9138b-b89f-4fb8-ba3a-d1254d4a48ac","model_set":{"reader":"grok-4.3"},"one_line_summary":"In concurrent graph games with distributed private randomness, memoryless strategies decide threshold reachability (NP-hard) and almost-sure reachability is NP-complete; IRATL extends ATL for probability thresholds without shared randomness.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Memoryless strategies suffice for teams to exceed winning probability thresholds in games with private randomness.","strongest_claim":"We show that memoryless strategies are sufficient for the threshold problem (deciding whether there is a strategy for the team that ensures winning with probability that exceeds a threshold), a result that not only places the problem in the Existential Theory of the Reals (∃R) but also enables the construction of value iteration algorithms.","weakest_assumption":"The model assumes that private random sources are completely hidden from the opponent and from each other, and that the graph game is finite and turn-based; if shared randomness or observable randomness were allowed, the memoryless claim would not necessarily hold."}},"verdict_id":"55f9138b-b89f-4fb8-ba3a-d1254d4a48ac"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:76ac241595719817f9731c9f8c9d25c1eed7236a1911f69da60a9366a60153a7","target":"record","created_at":"2026-05-18T02:44:30Z","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":"89e689c6e25de08993e3bee9cfa63ab722ed69d2246e1e557ef21d1b2459c933","cross_cats_sorted":["cs.FL","cs.MA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2026-03-07T08:04:08Z","title_canon_sha256":"e85579a5a0cb627d83b186a19cba3c3292ea0b0b08c1156a0ed14d9d55324e1c"},"schema_version":"1.0","source":{"id":"2603.07094","kind":"arxiv","version":2}},"canonical_sha256":"874c8371f38d28ace9a8f13072434daf91fd0d0ef0611681aded24e5edbae097","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"874c8371f38d28ace9a8f13072434daf91fd0d0ef0611681aded24e5edbae097","first_computed_at":"2026-05-18T02:44:30.870235Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:30.870235Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HdDA/qWZzhr2h4iuqSZNZ9S0lLdCSlEytJID2eQf61dTyOgbpYjJt6ItLiWaYq/c0dYbF5pEOqq9Xd/yUCg7Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:30.870867Z","signed_message":"canonical_sha256_bytes"},"source_id":"2603.07094","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:76ac241595719817f9731c9f8c9d25c1eed7236a1911f69da60a9366a60153a7","sha256:c209510c452370af23f645b23ab65b321aadb56df498be004c29cb26a616fb29"],"state_sha256":"62c6a24a68b2080c17492059da9991b0c931f9ce5b731820dc8ddc0e0067a173"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z2zlvqWsEwiGW/quNYXn3X5v0kXUlBG9mw6aIfNQ6YnVvoU+BzKX9GFVrQt2c7IHFrrNdSoLIQwZVyPZC0eVAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T15:13:13.466685Z","bundle_sha256":"ebd1317d9da04799e4d7d35954ec0b918a424219c55c046cfae433bfd624a31d"}}