{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:6LZLU2XMHTME4T5CG6BSP5NCBX","short_pith_number":"pith:6LZLU2XM","canonical_record":{"source":{"id":"2604.13475","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-04-15T04:57:17Z","cross_cats_sorted":[],"title_canon_sha256":"d5cd8e11caaf515e888ab0778fb8f7a9458830384b3ea223752d73ddaf79ea5c","abstract_canon_sha256":"02e0a94618cd11de0235affdd3990979e76e0f458a0bbed4b2c9529b355aeeac"},"schema_version":"1.0"},"canonical_sha256":"f2f2ba6aec3cd84e4fa2378327f5a20dcc3bceadb0adb12570eef9b868e0015d","source":{"kind":"arxiv","id":"2604.13475","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.13475","created_at":"2026-06-19T16:10:37Z"},{"alias_kind":"arxiv_version","alias_value":"2604.13475v1","created_at":"2026-06-19T16:10:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.13475","created_at":"2026-06-19T16:10:37Z"},{"alias_kind":"pith_short_12","alias_value":"6LZLU2XMHTME","created_at":"2026-06-19T16:10:37Z"},{"alias_kind":"pith_short_16","alias_value":"6LZLU2XMHTME4T5C","created_at":"2026-06-19T16:10:37Z"},{"alias_kind":"pith_short_8","alias_value":"6LZLU2XM","created_at":"2026-06-19T16:10:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:6LZLU2XMHTME4T5CG6BSP5NCBX","target":"record","payload":{"canonical_record":{"source":{"id":"2604.13475","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-04-15T04:57:17Z","cross_cats_sorted":[],"title_canon_sha256":"d5cd8e11caaf515e888ab0778fb8f7a9458830384b3ea223752d73ddaf79ea5c","abstract_canon_sha256":"02e0a94618cd11de0235affdd3990979e76e0f458a0bbed4b2c9529b355aeeac"},"schema_version":"1.0"},"canonical_sha256":"f2f2ba6aec3cd84e4fa2378327f5a20dcc3bceadb0adb12570eef9b868e0015d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:10:37.402872Z","signature_b64":"Dy/+LKTGm5LXWvoBiV4x0z5r7ucYGv47bg1Ord7jbhMVBjpKvSVbnOGojdlYADZkgGv+3i9pziUIdJLArkfXCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f2f2ba6aec3cd84e4fa2378327f5a20dcc3bceadb0adb12570eef9b868e0015d","last_reissued_at":"2026-06-19T16:10:37.402511Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:10:37.402511Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2604.13475","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-06-19T16:10:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OweRuUIOPd+fINOs3ol7cdT2+71iPvzyHy6wWhaLHnHu+j7T4QIhCHfelnVJYr6sUY2JPq/DbnBbNHvBsyHbCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T21:52:54.780242Z"},"content_sha256":"47d854b3a45eb13e58faf55024d694893b49848a1fc84eb1dff3a8778d187f9f","schema_version":"1.0","event_id":"sha256:47d854b3a45eb13e58faf55024d694893b49848a1fc84eb1dff3a8778d187f9f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:6LZLU2XMHTME4T5CG6BSP5NCBX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Erd\\H{o}s-Ko-Rado theorem for binary codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Every maximum 3-wise intersecting family of binary words is a star.","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chi Hoi Yip, Shamil Asgarli","submitted_at":"2026-04-15T04:57:17Z","abstract_excerpt":"We study intersecting families of words from the Erd\\H{o}s-Ko-Rado perspective. When the alphabet size is $2$, a maximum intersecting family is not necessarily a star. However, we prove that every maximum $3$-wise intersecting family is a star. We also present a new proof of the known result for alphabets of size at least $3$: maximum intersecting families of words are exactly the stars."},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We prove that every maximum 3-wise intersecting family is a star. We also present a new proof of the known result for alphabets of size at least 3: maximum intersecting families of words are exactly the stars.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The results hold for sufficiently large word length n (implicit in EKR-type statements); the paper does not specify the exact threshold in the abstract, so the precise range of n for which the statements are claimed is not visible from the provided text.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"For binary words, every maximum 3-wise intersecting family is a star; for alphabets of size at least 3, maximum intersecting families of words are exactly the stars.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Every maximum 3-wise intersecting family of binary words is a star.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"6b4775340a40f01bd2d0fda241f6775c71625b9cb9752cb2e5bed6178788f70d"},"source":{"id":"2604.13475","kind":"arxiv","version":1},"verdict":{"id":"eff9b3c5-8d48-4fe5-acb4-742d633d1964","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-10T13:35:59.971028Z","strongest_claim":"We prove that every maximum 3-wise intersecting family is a star. We also present a new proof of the known result for alphabets of size at least 3: maximum intersecting families of words are exactly the stars.","one_line_summary":"For binary words, every maximum 3-wise intersecting family is a star; for alphabets of size at least 3, maximum intersecting families of words are exactly the stars.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The results hold for sufficiently large word length n (implicit in EKR-type statements); the paper does not specify the exact threshold in the abstract, so the precise range of n for which the statements are claimed is not visible from the provided text.","pith_extraction_headline":"Every maximum 3-wise intersecting family of binary words is a star."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.13475/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":9,"sample":[{"doi":"","year":1986,"title":"K. Engel and P. Frankl. An Erd ¨os-Ko-Rado theorem for integer sequences of given rank.European J. Combin., 7(3):215–220, 1986","work_id":"ee2c770f-4245-4e6c-93b7-80124335d444","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1961,"title":"P. Erd ˝os, C. Ko, and R. Rado. Intersection theorems for systems of finite sets.Quart. J. Math. Oxford Ser. (2), 12:313–320, 1961","work_id":"cfaec8ff-9901-4f55-9bd9-155e11d0b09b","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1980,"title":"P. Frankl and Z. F ¨uredi. The Erd¨os-Ko-Rado theorem for integer sequences.SIAM J. Algebraic Discrete Methods, 1(4):376–381, 1980","work_id":"d3eb43ab-6479-4006-a1f3-3773bb978486","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1999,"title":"P. Frankl and N. Tokushige. The Erd ˝os–Ko–Rado theorem for integer sequences.Combinatorica, 19(1):55–63, 1999","work_id":"875249e7-a211-40ac-ac69-d62aceb61d5e","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2016,"title":"C. Godsil and K. Meagher.Erd ˝os-Ko-Rado theorems: algebraic approaches, volume 149 ofCambridge Studies in Advanced Mathematics. Cambridge University Press, Cambridge, 2016","work_id":"c123477d-9bc3-4e62-83cc-eeb3062da033","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":9,"snapshot_sha256":"c86ca4f4945f0db8c7d55c19471086bfa70306eca5b24b2835b53f03df70ab75","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":"eff9b3c5-8d48-4fe5-acb4-742d633d1964"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-19T16:10:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gv3tHJnPm2GwziICNwE+LggSJQtRd7v1DTOWrxtoacrOvzWU1n4tshQ7XUozCHPmmaqdkH7WRwu5VhcV1Vg0Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T21:52:54.780990Z"},"content_sha256":"b53e8ac24d1bca360f27d9d8c1b13a9ac783154de43e18e83854e6d263fb3050","schema_version":"1.0","event_id":"sha256:b53e8ac24d1bca360f27d9d8c1b13a9ac783154de43e18e83854e6d263fb3050"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6LZLU2XMHTME4T5CG6BSP5NCBX/bundle.json","state_url":"https://pith.science/pith/6LZLU2XMHTME4T5CG6BSP5NCBX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6LZLU2XMHTME4T5CG6BSP5NCBX/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-22T21:52:54Z","links":{"resolver":"https://pith.science/pith/6LZLU2XMHTME4T5CG6BSP5NCBX","bundle":"https://pith.science/pith/6LZLU2XMHTME4T5CG6BSP5NCBX/bundle.json","state":"https://pith.science/pith/6LZLU2XMHTME4T5CG6BSP5NCBX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6LZLU2XMHTME4T5CG6BSP5NCBX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:6LZLU2XMHTME4T5CG6BSP5NCBX","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":"02e0a94618cd11de0235affdd3990979e76e0f458a0bbed4b2c9529b355aeeac","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-04-15T04:57:17Z","title_canon_sha256":"d5cd8e11caaf515e888ab0778fb8f7a9458830384b3ea223752d73ddaf79ea5c"},"schema_version":"1.0","source":{"id":"2604.13475","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.13475","created_at":"2026-06-19T16:10:37Z"},{"alias_kind":"arxiv_version","alias_value":"2604.13475v1","created_at":"2026-06-19T16:10:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.13475","created_at":"2026-06-19T16:10:37Z"},{"alias_kind":"pith_short_12","alias_value":"6LZLU2XMHTME","created_at":"2026-06-19T16:10:37Z"},{"alias_kind":"pith_short_16","alias_value":"6LZLU2XMHTME4T5C","created_at":"2026-06-19T16:10:37Z"},{"alias_kind":"pith_short_8","alias_value":"6LZLU2XM","created_at":"2026-06-19T16:10:37Z"}],"graph_snapshots":[{"event_id":"sha256:b53e8ac24d1bca360f27d9d8c1b13a9ac783154de43e18e83854e6d263fb3050","target":"graph","created_at":"2026-06-19T16:10:37Z","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 prove that every maximum 3-wise intersecting family is a star. We also present a new proof of the known result for alphabets of size at least 3: maximum intersecting families of words are exactly the stars."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The results hold for sufficiently large word length n (implicit in EKR-type statements); the paper does not specify the exact threshold in the abstract, so the precise range of n for which the statements are claimed is not visible from the provided text."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"For binary words, every maximum 3-wise intersecting family is a star; for alphabets of size at least 3, maximum intersecting families of words are exactly the stars."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Every maximum 3-wise intersecting family of binary words is a star."}],"snapshot_sha256":"6b4775340a40f01bd2d0fda241f6775c71625b9cb9752cb2e5bed6178788f70d"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2604.13475/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study intersecting families of words from the Erd\\H{o}s-Ko-Rado perspective. When the alphabet size is $2$, a maximum intersecting family is not necessarily a star. However, we prove that every maximum $3$-wise intersecting family is a star. We also present a new proof of the known result for alphabets of size at least $3$: maximum intersecting families of words are exactly the stars.","authors_text":"Chi Hoi Yip, Shamil Asgarli","cross_cats":[],"headline":"Every maximum 3-wise intersecting family of binary words is a star.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-04-15T04:57:17Z","title":"An Erd\\H{o}s-Ko-Rado theorem for binary codes"},"references":{"count":9,"internal_anchors":0,"resolved_work":9,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"K. Engel and P. Frankl. An Erd ¨os-Ko-Rado theorem for integer sequences of given rank.European J. Combin., 7(3):215–220, 1986","work_id":"ee2c770f-4245-4e6c-93b7-80124335d444","year":1986},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"P. Erd ˝os, C. Ko, and R. Rado. Intersection theorems for systems of finite sets.Quart. J. Math. Oxford Ser. (2), 12:313–320, 1961","work_id":"cfaec8ff-9901-4f55-9bd9-155e11d0b09b","year":1961},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"P. Frankl and Z. F ¨uredi. The Erd¨os-Ko-Rado theorem for integer sequences.SIAM J. Algebraic Discrete Methods, 1(4):376–381, 1980","work_id":"d3eb43ab-6479-4006-a1f3-3773bb978486","year":1980},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"P. Frankl and N. Tokushige. The Erd ˝os–Ko–Rado theorem for integer sequences.Combinatorica, 19(1):55–63, 1999","work_id":"875249e7-a211-40ac-ac69-d62aceb61d5e","year":1999},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"C. Godsil and K. Meagher.Erd ˝os-Ko-Rado theorems: algebraic approaches, volume 149 ofCambridge Studies in Advanced Mathematics. Cambridge University Press, Cambridge, 2016","work_id":"c123477d-9bc3-4e62-83cc-eeb3062da033","year":2016}],"snapshot_sha256":"c86ca4f4945f0db8c7d55c19471086bfa70306eca5b24b2835b53f03df70ab75"},"source":{"id":"2604.13475","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-10T13:35:59.971028Z","id":"eff9b3c5-8d48-4fe5-acb4-742d633d1964","model_set":{"reader":"grok-4.3"},"one_line_summary":"For binary words, every maximum 3-wise intersecting family is a star; for alphabets of size at least 3, maximum intersecting families of words are exactly the stars.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Every maximum 3-wise intersecting family of binary words is a star.","strongest_claim":"We prove that every maximum 3-wise intersecting family is a star. We also present a new proof of the known result for alphabets of size at least 3: maximum intersecting families of words are exactly the stars.","weakest_assumption":"The results hold for sufficiently large word length n (implicit in EKR-type statements); the paper does not specify the exact threshold in the abstract, so the precise range of n for which the statements are claimed is not visible from the provided text."}},"verdict_id":"eff9b3c5-8d48-4fe5-acb4-742d633d1964"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:47d854b3a45eb13e58faf55024d694893b49848a1fc84eb1dff3a8778d187f9f","target":"record","created_at":"2026-06-19T16:10:37Z","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":"02e0a94618cd11de0235affdd3990979e76e0f458a0bbed4b2c9529b355aeeac","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-04-15T04:57:17Z","title_canon_sha256":"d5cd8e11caaf515e888ab0778fb8f7a9458830384b3ea223752d73ddaf79ea5c"},"schema_version":"1.0","source":{"id":"2604.13475","kind":"arxiv","version":1}},"canonical_sha256":"f2f2ba6aec3cd84e4fa2378327f5a20dcc3bceadb0adb12570eef9b868e0015d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f2f2ba6aec3cd84e4fa2378327f5a20dcc3bceadb0adb12570eef9b868e0015d","first_computed_at":"2026-06-19T16:10:37.402511Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-19T16:10:37.402511Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Dy/+LKTGm5LXWvoBiV4x0z5r7ucYGv47bg1Ord7jbhMVBjpKvSVbnOGojdlYADZkgGv+3i9pziUIdJLArkfXCA==","signature_status":"signed_v1","signed_at":"2026-06-19T16:10:37.402872Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.13475","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:47d854b3a45eb13e58faf55024d694893b49848a1fc84eb1dff3a8778d187f9f","sha256:b53e8ac24d1bca360f27d9d8c1b13a9ac783154de43e18e83854e6d263fb3050"],"state_sha256":"963031b4a57802da1925fe893d7fb1f58cf24de555d1bad09884fa95985abba9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZdHxYuL60go71QjyMe09/O+BhyYpIofmh2NCXNUR8VilcuEB7rOuavdO7049/UuYn0fAa6h0hsajDFh7ejaMCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T21:52:54.783695Z","bundle_sha256":"39fe0406abb1a343552ecd8abc7063d5b49f6d1a5c185739c18f8f252f6fa15a"}}