{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:KLYAGOWICO2URWK4DUPAUKUFLO","short_pith_number":"pith:KLYAGOWI","canonical_record":{"source":{"id":"2605.13107","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2026-05-13T07:16:45Z","cross_cats_sorted":[],"title_canon_sha256":"fdf58c5943cd26098741f0a64ac4d38fd4163225b2d81c47a4771647ec886b8f","abstract_canon_sha256":"62aebf8a2693549cf670d84be66f2ce4a8746c55f16a21dfec11f93b3da3ce73"},"schema_version":"1.0"},"canonical_sha256":"52f0033ac813b548d95c1d1e0a2a855b94b64df52d6bc3f9f798e776f00514dc","source":{"kind":"arxiv","id":"2605.13107","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13107","created_at":"2026-05-18T03:08:58Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13107v1","created_at":"2026-05-18T03:08:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13107","created_at":"2026-05-18T03:08:58Z"},{"alias_kind":"pith_short_12","alias_value":"KLYAGOWICO2U","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"KLYAGOWICO2URWK4","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"KLYAGOWI","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:KLYAGOWICO2URWK4DUPAUKUFLO","target":"record","payload":{"canonical_record":{"source":{"id":"2605.13107","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2026-05-13T07:16:45Z","cross_cats_sorted":[],"title_canon_sha256":"fdf58c5943cd26098741f0a64ac4d38fd4163225b2d81c47a4771647ec886b8f","abstract_canon_sha256":"62aebf8a2693549cf670d84be66f2ce4a8746c55f16a21dfec11f93b3da3ce73"},"schema_version":"1.0"},"canonical_sha256":"52f0033ac813b548d95c1d1e0a2a855b94b64df52d6bc3f9f798e776f00514dc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:08:58.152443Z","signature_b64":"ZwiJ/BCzkzhQlz29fJGeISqmv/IlvkU0fNW2bqNYKv5bu7wlDRaoIXz/KRD0Cl/NhpZGauRUQnGqT1zFzbgdAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52f0033ac813b548d95c1d1e0a2a855b94b64df52d6bc3f9f798e776f00514dc","last_reissued_at":"2026-05-18T03:08:58.151883Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:08:58.151883Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.13107","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-18T03:08:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H7cD3fRN6Bs4xWUDVxE4MGQfnD3+ffK1ieW9WGpCk77ENtI7J4vbEuFL6GrUdaBhaGSRtxY1uE7r/0/ZkFyxDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:43:28.468586Z"},"content_sha256":"918b51a4cc32d76442d55962bef72b41271baab8ca54b31e8096b1f6aace4547","schema_version":"1.0","event_id":"sha256:918b51a4cc32d76442d55962bef72b41271baab8ca54b31e8096b1f6aace4547"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:KLYAGOWICO2URWK4DUPAUKUFLO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Discrepancy and Fisher information","license":"http://creativecommons.org/licenses/by/4.0/","headline":"An online algorithm keeps a symmetric random walk inside any convex body by discarding steps whose expected count is bounded by a Fisher-information quantity.","cross_cats":[],"primary_cat":"math.PR","authors_text":"Gleb Smirnov, Roman Vershynin","submitted_at":"2026-05-13T07:16:45Z","abstract_excerpt":"We give an online algorithm that keeps a symmetric random walk inside a convex body by discarding some of its steps. The expected number of discarded steps is controlled by a Fisher-information-type quantity associated with the body. For the cube, this gives a dimension-free bound: a walk with unit Euclidean steps can be kept bounded in all coordinates while discarding only a small constant fraction of the steps on average."},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We give an online algorithm that keeps a symmetric random walk inside a convex body by discarding some of its steps. The expected number of discarded steps is controlled by a Fisher-information-type quantity associated with the body. For the cube, this gives a dimension-free bound: a walk with unit Euclidean steps can be kept bounded in all coordinates while discarding only a small constant fraction of the steps on average.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The body is convex and the walk is a symmetric random walk with unit Euclidean steps; the Fisher-information-type quantity is well-defined and finite for the body.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"An online algorithm controls a symmetric random walk inside convex bodies by discarding steps whose expected number is bounded by a Fisher-information quantity, giving dimension-free bounds for the cube.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"An online algorithm keeps a symmetric random walk inside any convex body by discarding steps whose expected count is bounded by a Fisher-information quantity.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"31eb691c2426596b39d1e7fe262c5035eababfbf0c5e14fc487577fa228efdeb"},"source":{"id":"2605.13107","kind":"arxiv","version":1},"verdict":{"id":"c33d7ea7-e0d5-4c79-a129-492d623c79c6","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T18:50:11.154451Z","strongest_claim":"We give an online algorithm that keeps a symmetric random walk inside a convex body by discarding some of its steps. The expected number of discarded steps is controlled by a Fisher-information-type quantity associated with the body. For the cube, this gives a dimension-free bound: a walk with unit Euclidean steps can be kept bounded in all coordinates while discarding only a small constant fraction of the steps on average.","one_line_summary":"An online algorithm controls a symmetric random walk inside convex bodies by discarding steps whose expected number is bounded by a Fisher-information quantity, giving dimension-free bounds for the cube.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The body is convex and the walk is a symmetric random walk with unit Euclidean steps; the Fisher-information-type quantity is well-defined and finite for the body.","pith_extraction_headline":"An online algorithm keeps a symmetric random walk inside any convex body by discarding steps whose expected count is bounded by a Fisher-information quantity."},"references":{"count":12,"sample":[{"doi":"","year":2021,"title":"R. Alweiss, Y. Liu, and M. Sawhney. Discrepancy minimization via a self-balancing walk. InSTOC 2021, pages 14–20, 2021","work_id":"0ec4eca2-bc9c-4734-a316-e5156cfe5183","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1998,"title":"W. Banaszczyk. Balancing vectors and gaussian measures ofn-dimensional convex bodies. Rand. Struct. Alg., 12(4):351–360, 1998","work_id":"ffa00d5e-c7d7-43ea-ace9-9aab9fea58a5","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2022,"title":"A. Bandeira, A. Maillard, and N. Zhivotovskiy. A remark on Kashin’s discrepancy argument and partial coloring in the Koml´ os conjecture.Portugaliae Mathematica, 79(3):311–316, 2022","work_id":"a4a0641b-9b81-4308-a61f-508d6bd589bb","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2021,"title":"N. Bansal, H. Jiang, R. Meka, S. Singla, and M. Sinha. Online discrepancy minimization for stochastic arrivals. InSODA 2021, pages 2842–2861, 2021","work_id":"51f011a7-c194-46af-9632-a94985f1ecdf","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2020,"title":"N. Bansal, H. Jiang, S. Singla, and M. Sinha. Online vector balancing and geometric discrepancy. In STOC 2020, pages 1139–1152, 2020","work_id":"978826ca-556b-4e52-912c-97bf9473c7e4","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":12,"snapshot_sha256":"ffa614a9be4b746dbbe825c99450a4c31a351f7dd5635a035db89f24ff8f6709","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":"c33d7ea7-e0d5-4c79-a129-492d623c79c6"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:08:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zxSz0gMm84CP2CFxZUAWUqZT1E3Utceli2wm3xlSADVGGrGfhwzvG25LdGb0lztfkRhNsT0hBJlZFAIz5cvnAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:43:28.469957Z"},"content_sha256":"461d027491551c42dbdc82d1263054639bb077eed658dd77496e42aec7352c07","schema_version":"1.0","event_id":"sha256:461d027491551c42dbdc82d1263054639bb077eed658dd77496e42aec7352c07"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KLYAGOWICO2URWK4DUPAUKUFLO/bundle.json","state_url":"https://pith.science/pith/KLYAGOWICO2URWK4DUPAUKUFLO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KLYAGOWICO2URWK4DUPAUKUFLO/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-31T23:43:28Z","links":{"resolver":"https://pith.science/pith/KLYAGOWICO2URWK4DUPAUKUFLO","bundle":"https://pith.science/pith/KLYAGOWICO2URWK4DUPAUKUFLO/bundle.json","state":"https://pith.science/pith/KLYAGOWICO2URWK4DUPAUKUFLO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KLYAGOWICO2URWK4DUPAUKUFLO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:KLYAGOWICO2URWK4DUPAUKUFLO","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":"62aebf8a2693549cf670d84be66f2ce4a8746c55f16a21dfec11f93b3da3ce73","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2026-05-13T07:16:45Z","title_canon_sha256":"fdf58c5943cd26098741f0a64ac4d38fd4163225b2d81c47a4771647ec886b8f"},"schema_version":"1.0","source":{"id":"2605.13107","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13107","created_at":"2026-05-18T03:08:58Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13107v1","created_at":"2026-05-18T03:08:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13107","created_at":"2026-05-18T03:08:58Z"},{"alias_kind":"pith_short_12","alias_value":"KLYAGOWICO2U","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"KLYAGOWICO2URWK4","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"KLYAGOWI","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:461d027491551c42dbdc82d1263054639bb077eed658dd77496e42aec7352c07","target":"graph","created_at":"2026-05-18T03:08:58Z","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 give an online algorithm that keeps a symmetric random walk inside a convex body by discarding some of its steps. The expected number of discarded steps is controlled by a Fisher-information-type quantity associated with the body. For the cube, this gives a dimension-free bound: a walk with unit Euclidean steps can be kept bounded in all coordinates while discarding only a small constant fraction of the steps on average."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The body is convex and the walk is a symmetric random walk with unit Euclidean steps; the Fisher-information-type quantity is well-defined and finite for the body."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"An online algorithm controls a symmetric random walk inside convex bodies by discarding steps whose expected number is bounded by a Fisher-information quantity, giving dimension-free bounds for the cube."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"An online algorithm keeps a symmetric random walk inside any convex body by discarding steps whose expected count is bounded by a Fisher-information quantity."}],"snapshot_sha256":"31eb691c2426596b39d1e7fe262c5035eababfbf0c5e14fc487577fa228efdeb"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We give an online algorithm that keeps a symmetric random walk inside a convex body by discarding some of its steps. The expected number of discarded steps is controlled by a Fisher-information-type quantity associated with the body. For the cube, this gives a dimension-free bound: a walk with unit Euclidean steps can be kept bounded in all coordinates while discarding only a small constant fraction of the steps on average.","authors_text":"Gleb Smirnov, Roman Vershynin","cross_cats":[],"headline":"An online algorithm keeps a symmetric random walk inside any convex body by discarding steps whose expected count is bounded by a Fisher-information quantity.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2026-05-13T07:16:45Z","title":"Discrepancy and Fisher information"},"references":{"count":12,"internal_anchors":0,"resolved_work":12,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"R. Alweiss, Y. Liu, and M. Sawhney. Discrepancy minimization via a self-balancing walk. InSTOC 2021, pages 14–20, 2021","work_id":"0ec4eca2-bc9c-4734-a316-e5156cfe5183","year":2021},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"W. Banaszczyk. Balancing vectors and gaussian measures ofn-dimensional convex bodies. Rand. Struct. Alg., 12(4):351–360, 1998","work_id":"ffa00d5e-c7d7-43ea-ace9-9aab9fea58a5","year":1998},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"A. Bandeira, A. Maillard, and N. Zhivotovskiy. A remark on Kashin’s discrepancy argument and partial coloring in the Koml´ os conjecture.Portugaliae Mathematica, 79(3):311–316, 2022","work_id":"a4a0641b-9b81-4308-a61f-508d6bd589bb","year":2022},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"N. Bansal, H. Jiang, R. Meka, S. Singla, and M. Sinha. Online discrepancy minimization for stochastic arrivals. InSODA 2021, pages 2842–2861, 2021","work_id":"51f011a7-c194-46af-9632-a94985f1ecdf","year":2021},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"N. Bansal, H. Jiang, S. Singla, and M. Sinha. Online vector balancing and geometric discrepancy. In STOC 2020, pages 1139–1152, 2020","work_id":"978826ca-556b-4e52-912c-97bf9473c7e4","year":2020}],"snapshot_sha256":"ffa614a9be4b746dbbe825c99450a4c31a351f7dd5635a035db89f24ff8f6709"},"source":{"id":"2605.13107","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T18:50:11.154451Z","id":"c33d7ea7-e0d5-4c79-a129-492d623c79c6","model_set":{"reader":"grok-4.3"},"one_line_summary":"An online algorithm controls a symmetric random walk inside convex bodies by discarding steps whose expected number is bounded by a Fisher-information quantity, giving dimension-free bounds for the cube.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"An online algorithm keeps a symmetric random walk inside any convex body by discarding steps whose expected count is bounded by a Fisher-information quantity.","strongest_claim":"We give an online algorithm that keeps a symmetric random walk inside a convex body by discarding some of its steps. The expected number of discarded steps is controlled by a Fisher-information-type quantity associated with the body. For the cube, this gives a dimension-free bound: a walk with unit Euclidean steps can be kept bounded in all coordinates while discarding only a small constant fraction of the steps on average.","weakest_assumption":"The body is convex and the walk is a symmetric random walk with unit Euclidean steps; the Fisher-information-type quantity is well-defined and finite for the body."}},"verdict_id":"c33d7ea7-e0d5-4c79-a129-492d623c79c6"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:918b51a4cc32d76442d55962bef72b41271baab8ca54b31e8096b1f6aace4547","target":"record","created_at":"2026-05-18T03:08:58Z","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":"62aebf8a2693549cf670d84be66f2ce4a8746c55f16a21dfec11f93b3da3ce73","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2026-05-13T07:16:45Z","title_canon_sha256":"fdf58c5943cd26098741f0a64ac4d38fd4163225b2d81c47a4771647ec886b8f"},"schema_version":"1.0","source":{"id":"2605.13107","kind":"arxiv","version":1}},"canonical_sha256":"52f0033ac813b548d95c1d1e0a2a855b94b64df52d6bc3f9f798e776f00514dc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"52f0033ac813b548d95c1d1e0a2a855b94b64df52d6bc3f9f798e776f00514dc","first_computed_at":"2026-05-18T03:08:58.151883Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:08:58.151883Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZwiJ/BCzkzhQlz29fJGeISqmv/IlvkU0fNW2bqNYKv5bu7wlDRaoIXz/KRD0Cl/NhpZGauRUQnGqT1zFzbgdAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:08:58.152443Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.13107","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:918b51a4cc32d76442d55962bef72b41271baab8ca54b31e8096b1f6aace4547","sha256:461d027491551c42dbdc82d1263054639bb077eed658dd77496e42aec7352c07"],"state_sha256":"c9a1d41dfaddb05c2b9112efca018d1bb387e770e73b22b9e42fbf9ae403b477"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uairREALUnJcUYjXVqVm83fqHCuyxVzHI2zjrySkK91vZhEV/F4x0ir4WWfXy+LqlL7ORE5hAPIYw9O4xvlCBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T23:43:28.475151Z","bundle_sha256":"93ddeb9d10c388d26feb931a60e57933ade1f7ea3b1f0e8145a16f2eac722289"}}