{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:FCS5YOBVIZDJ5AWLQEA23Y53MJ","short_pith_number":"pith:FCS5YOBV","canonical_record":{"source":{"id":"2605.05455","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-06T21:24:33Z","cross_cats_sorted":[],"title_canon_sha256":"e3a017adfdb9808ccffdd3e2cb40733140f443c68f089db29defc80050b4828c","abstract_canon_sha256":"1e939c4317cf7c456ad401797366869d2d06593b3951efde6dfab7483df2822d"},"schema_version":"1.0"},"canonical_sha256":"28a5dc383546469e82cb8101ade3bb62720cc3b9e6c63cc2490d3bb0cfaae4c6","source":{"kind":"arxiv","id":"2605.05455","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.05455","created_at":"2026-05-25T02:02:16Z"},{"alias_kind":"arxiv_version","alias_value":"2605.05455v3","created_at":"2026-05-25T02:02:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.05455","created_at":"2026-05-25T02:02:16Z"},{"alias_kind":"pith_short_12","alias_value":"FCS5YOBVIZDJ","created_at":"2026-05-25T02:02:16Z"},{"alias_kind":"pith_short_16","alias_value":"FCS5YOBVIZDJ5AWL","created_at":"2026-05-25T02:02:16Z"},{"alias_kind":"pith_short_8","alias_value":"FCS5YOBV","created_at":"2026-05-25T02:02:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:FCS5YOBVIZDJ5AWLQEA23Y53MJ","target":"record","payload":{"canonical_record":{"source":{"id":"2605.05455","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-06T21:24:33Z","cross_cats_sorted":[],"title_canon_sha256":"e3a017adfdb9808ccffdd3e2cb40733140f443c68f089db29defc80050b4828c","abstract_canon_sha256":"1e939c4317cf7c456ad401797366869d2d06593b3951efde6dfab7483df2822d"},"schema_version":"1.0"},"canonical_sha256":"28a5dc383546469e82cb8101ade3bb62720cc3b9e6c63cc2490d3bb0cfaae4c6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-25T02:02:16.352073Z","signature_b64":"xhn49qIqQhUwMSKgvWzSihWGp+Hn76oiDOMWHnCyAfGD+2fSUFOI3xzbIvRSJolxa0h8PQ/kn7lYrxcdjyyJAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28a5dc383546469e82cb8101ade3bb62720cc3b9e6c63cc2490d3bb0cfaae4c6","last_reissued_at":"2026-05-25T02:02:16.351541Z","signature_status":"signed_v1","first_computed_at":"2026-05-25T02:02:16.351541Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.05455","source_version":3,"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-25T02:02:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u3IxbTt4EWZOLzlPbRw7B5aq586jhi2H2I5aOAcfsUp4e1HkgTWEBpv5TbjQBVA3cgv+YsNID2usbru3angtAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T08:24:34.233751Z"},"content_sha256":"0ba71009be3b50aa2d714236253f4d19d1a0feaa91e7e0de6134deac1ad94182","schema_version":"1.0","event_id":"sha256:0ba71009be3b50aa2d714236253f4d19d1a0feaa91e7e0de6134deac1ad94182"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:FCS5YOBVIZDJ5AWLQEA23Y53MJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Thresholds for Tic-Tac-Toe on Finite Affine Spaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"For fixed n and q, affine Tic-Tac-Toe on F_q^m has a finite threshold T(n,q) above which the first player always wins.","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alessandro Giannoni, Javier Lobillo-Olmedo, Luca Bastioni","submitted_at":"2026-05-06T21:24:33Z","abstract_excerpt":"We introduce an affine version of Tic-Tac-Toe played on the finite affine space $\\mathbb{F}_q^m$. Two players alternately claim points, and the first player to occupy all points of an affine subspace of dimension $n$ wins. We call this the $(m,n)_q$-game. For fixed $n$ and $q$, we study how the outcome depends on the ambient dimension $m$.\n  Using strategy stealing and a blocking-set interpretation, we show that every $(m,n)_q$-game is either a first-player win or a draw, and that the property of being a first-player win is monotone in $m$. This yields a threshold $T(n,q)$: the game is a draw "},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Using strategy stealing and a blocking-set interpretation, we show that every (m,n)_q-game is either a first-player win or a draw, and that the property of being a first-player win is monotone in m. This yields a threshold T(n,q): the game is a draw for m<T(n,q) and a first-player win for m≥T(n,q). We prove that this threshold is finite by applying the affine/vector-space Ramsey theorem of Graham, Leeb and Rothschild, and we obtain general lower bounds from the Erdős-Selfridge criterion for Maker-Breaker games. In the binary case, we give a direct Fourier-analytic argument, combined with an inductive lifting method, which shows that T(n,2)≤2^{n+1}.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The monotonicity of first-player wins in m and the direct applicability of the Graham-Leeb-Rothschild affine Ramsey theorem to guarantee a finite threshold without needing explicit Ramsey numbers for the game-specific coloring.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Affine Tic-Tac-Toe on F_q^m has a finite threshold T(n,q) separating draws from first-player wins, with T(n,2) at most 2^{n+1} and exact values for several small cases.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"For fixed n and q, affine Tic-Tac-Toe on F_q^m has a finite threshold T(n,q) above which the first player always wins.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"9058bd69bcbb87461ff7e51348eb305167e791fa81ddd843dce5e61c45af112a"},"source":{"id":"2605.05455","kind":"arxiv","version":3},"verdict":{"id":"7e33f614-abea-42d0-986b-0b502c785943","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-12T02:33:05.839915Z","strongest_claim":"Using strategy stealing and a blocking-set interpretation, we show that every (m,n)_q-game is either a first-player win or a draw, and that the property of being a first-player win is monotone in m. This yields a threshold T(n,q): the game is a draw for m<T(n,q) and a first-player win for m≥T(n,q). We prove that this threshold is finite by applying the affine/vector-space Ramsey theorem of Graham, Leeb and Rothschild, and we obtain general lower bounds from the Erdős-Selfridge criterion for Maker-Breaker games. In the binary case, we give a direct Fourier-analytic argument, combined with an inductive lifting method, which shows that T(n,2)≤2^{n+1}.","one_line_summary":"Affine Tic-Tac-Toe on F_q^m has a finite threshold T(n,q) separating draws from first-player wins, with T(n,2) at most 2^{n+1} and exact values for several small cases.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The monotonicity of first-player wins in m and the direct applicability of the Graham-Leeb-Rothschild affine Ramsey theorem to guarantee a finite threshold without needing explicit Ramsey numbers for the game-specific coloring.","pith_extraction_headline":"For fixed n and q, affine Tic-Tac-Toe on F_q^m has a finite threshold T(n,q) above which the first player always wins."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.05455/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-20T09:41:11.904342Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-19T20:31:19.660608Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T13:33:55.281283Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"3687a38e5bb04ca6fccca4ee4215917fdd1ebed03b3e91129dd231d85cc51b41"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":1,"snapshot_sha256":"4dbd2ccc499d032a5a8d62380a32a8331f54c5e0d738472f371c01b3bde8d17b"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"7e33f614-abea-42d0-986b-0b502c785943"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-25T02:02:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tFlailYm4G3XO5BGZDJStQkqJZKOdaL7hvOmYH5yDtPO6bZRBudHaJxAl45pp5DOAhBpoIaSO0s3izJYWYTHDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T08:24:34.234488Z"},"content_sha256":"3a4e2e1da1fe58c69d59038975ae6919712397621284b4f96b94b7761165fff8","schema_version":"1.0","event_id":"sha256:3a4e2e1da1fe58c69d59038975ae6919712397621284b4f96b94b7761165fff8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FCS5YOBVIZDJ5AWLQEA23Y53MJ/bundle.json","state_url":"https://pith.science/pith/FCS5YOBVIZDJ5AWLQEA23Y53MJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FCS5YOBVIZDJ5AWLQEA23Y53MJ/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-07-01T08:24:34Z","links":{"resolver":"https://pith.science/pith/FCS5YOBVIZDJ5AWLQEA23Y53MJ","bundle":"https://pith.science/pith/FCS5YOBVIZDJ5AWLQEA23Y53MJ/bundle.json","state":"https://pith.science/pith/FCS5YOBVIZDJ5AWLQEA23Y53MJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FCS5YOBVIZDJ5AWLQEA23Y53MJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:FCS5YOBVIZDJ5AWLQEA23Y53MJ","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":"1e939c4317cf7c456ad401797366869d2d06593b3951efde6dfab7483df2822d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-06T21:24:33Z","title_canon_sha256":"e3a017adfdb9808ccffdd3e2cb40733140f443c68f089db29defc80050b4828c"},"schema_version":"1.0","source":{"id":"2605.05455","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.05455","created_at":"2026-05-25T02:02:16Z"},{"alias_kind":"arxiv_version","alias_value":"2605.05455v3","created_at":"2026-05-25T02:02:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.05455","created_at":"2026-05-25T02:02:16Z"},{"alias_kind":"pith_short_12","alias_value":"FCS5YOBVIZDJ","created_at":"2026-05-25T02:02:16Z"},{"alias_kind":"pith_short_16","alias_value":"FCS5YOBVIZDJ5AWL","created_at":"2026-05-25T02:02:16Z"},{"alias_kind":"pith_short_8","alias_value":"FCS5YOBV","created_at":"2026-05-25T02:02:16Z"}],"graph_snapshots":[{"event_id":"sha256:3a4e2e1da1fe58c69d59038975ae6919712397621284b4f96b94b7761165fff8","target":"graph","created_at":"2026-05-25T02:02:16Z","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":"Using strategy stealing and a blocking-set interpretation, we show that every (m,n)_q-game is either a first-player win or a draw, and that the property of being a first-player win is monotone in m. This yields a threshold T(n,q): the game is a draw for m<T(n,q) and a first-player win for m≥T(n,q). We prove that this threshold is finite by applying the affine/vector-space Ramsey theorem of Graham, Leeb and Rothschild, and we obtain general lower bounds from the Erdős-Selfridge criterion for Maker-Breaker games. In the binary case, we give a direct Fourier-analytic argument, combined with an inductive lifting method, which shows that T(n,2)≤2^{n+1}."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The monotonicity of first-player wins in m and the direct applicability of the Graham-Leeb-Rothschild affine Ramsey theorem to guarantee a finite threshold without needing explicit Ramsey numbers for the game-specific coloring."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Affine Tic-Tac-Toe on F_q^m has a finite threshold T(n,q) separating draws from first-player wins, with T(n,2) at most 2^{n+1} and exact values for several small cases."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"For fixed n and q, affine Tic-Tac-Toe on F_q^m has a finite threshold T(n,q) above which the first player always wins."}],"snapshot_sha256":"9058bd69bcbb87461ff7e51348eb305167e791fa81ddd843dce5e61c45af112a"},"formal_canon":{"evidence_count":1,"snapshot_sha256":"4dbd2ccc499d032a5a8d62380a32a8331f54c5e0d738472f371c01b3bde8d17b"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-20T09:41:11.904342Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T20:31:19.660608Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T13:33:55.281283Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.05455/integrity.json","findings":[],"snapshot_sha256":"3687a38e5bb04ca6fccca4ee4215917fdd1ebed03b3e91129dd231d85cc51b41","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We introduce an affine version of Tic-Tac-Toe played on the finite affine space $\\mathbb{F}_q^m$. Two players alternately claim points, and the first player to occupy all points of an affine subspace of dimension $n$ wins. We call this the $(m,n)_q$-game. For fixed $n$ and $q$, we study how the outcome depends on the ambient dimension $m$.\n  Using strategy stealing and a blocking-set interpretation, we show that every $(m,n)_q$-game is either a first-player win or a draw, and that the property of being a first-player win is monotone in $m$. This yields a threshold $T(n,q)$: the game is a draw ","authors_text":"Alessandro Giannoni, Javier Lobillo-Olmedo, Luca Bastioni","cross_cats":[],"headline":"For fixed n and q, affine Tic-Tac-Toe on F_q^m has a finite threshold T(n,q) above which the first player always wins.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-06T21:24:33Z","title":"Thresholds for Tic-Tac-Toe on Finite Affine Spaces"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.05455","kind":"arxiv","version":3},"verdict":{"created_at":"2026-05-12T02:33:05.839915Z","id":"7e33f614-abea-42d0-986b-0b502c785943","model_set":{"reader":"grok-4.3"},"one_line_summary":"Affine Tic-Tac-Toe on F_q^m has a finite threshold T(n,q) separating draws from first-player wins, with T(n,2) at most 2^{n+1} and exact values for several small cases.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"For fixed n and q, affine Tic-Tac-Toe on F_q^m has a finite threshold T(n,q) above which the first player always wins.","strongest_claim":"Using strategy stealing and a blocking-set interpretation, we show that every (m,n)_q-game is either a first-player win or a draw, and that the property of being a first-player win is monotone in m. This yields a threshold T(n,q): the game is a draw for m<T(n,q) and a first-player win for m≥T(n,q). We prove that this threshold is finite by applying the affine/vector-space Ramsey theorem of Graham, Leeb and Rothschild, and we obtain general lower bounds from the Erdős-Selfridge criterion for Maker-Breaker games. In the binary case, we give a direct Fourier-analytic argument, combined with an inductive lifting method, which shows that T(n,2)≤2^{n+1}.","weakest_assumption":"The monotonicity of first-player wins in m and the direct applicability of the Graham-Leeb-Rothschild affine Ramsey theorem to guarantee a finite threshold without needing explicit Ramsey numbers for the game-specific coloring."}},"verdict_id":"7e33f614-abea-42d0-986b-0b502c785943"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:0ba71009be3b50aa2d714236253f4d19d1a0feaa91e7e0de6134deac1ad94182","target":"record","created_at":"2026-05-25T02:02:16Z","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":"1e939c4317cf7c456ad401797366869d2d06593b3951efde6dfab7483df2822d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-06T21:24:33Z","title_canon_sha256":"e3a017adfdb9808ccffdd3e2cb40733140f443c68f089db29defc80050b4828c"},"schema_version":"1.0","source":{"id":"2605.05455","kind":"arxiv","version":3}},"canonical_sha256":"28a5dc383546469e82cb8101ade3bb62720cc3b9e6c63cc2490d3bb0cfaae4c6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"28a5dc383546469e82cb8101ade3bb62720cc3b9e6c63cc2490d3bb0cfaae4c6","first_computed_at":"2026-05-25T02:02:16.351541Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-25T02:02:16.351541Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xhn49qIqQhUwMSKgvWzSihWGp+Hn76oiDOMWHnCyAfGD+2fSUFOI3xzbIvRSJolxa0h8PQ/kn7lYrxcdjyyJAw==","signature_status":"signed_v1","signed_at":"2026-05-25T02:02:16.352073Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.05455","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0ba71009be3b50aa2d714236253f4d19d1a0feaa91e7e0de6134deac1ad94182","sha256:3a4e2e1da1fe58c69d59038975ae6919712397621284b4f96b94b7761165fff8"],"state_sha256":"55d6be3053b27c7a8c338ca7e7ff905590aa599487572e15efb725a59d3d27cc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I8YhbzluleReMhL/eBnVJkD1cL5QOp5YJlsbs+e8wCESo1Cccdy3M1yGvzpfSK8F0ztqzzY8lTSpc+Y+mUo9AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T08:24:34.237974Z","bundle_sha256":"b37d8838a1f4a45f9bcc9f1e00d885563e99a9a2eb42bc19b997c55404a364d4"}}