{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:LADN3ZC5D5ESTCFVARS6BXXLB7","short_pith_number":"pith:LADN3ZC5","canonical_record":{"source":{"id":"2607.29453","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-07-31T14:15:12Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"66a18e05d61c2f9c7743ef6438d1e955ca09e36bb9acd09f3590790c8d3d560f","abstract_canon_sha256":"66d5bcdf7e9567c374ebabecc084f2dc337965a5629c0361112cd1ab5c6dfb5f"},"schema_version":"1.0"},"canonical_sha256":"5806dde45d1f492988b50465e0deeb0fc1f16f3972125c9b45472cfeadbdbbe6","source":{"kind":"arxiv","id":"2607.29453","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.29453","created_at":"2026-08-03T01:34:36Z"},{"alias_kind":"arxiv_version","alias_value":"2607.29453v1","created_at":"2026-08-03T01:34:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.29453","created_at":"2026-08-03T01:34:36Z"},{"alias_kind":"pith_short_12","alias_value":"LADN3ZC5D5ES","created_at":"2026-08-03T01:34:36Z"},{"alias_kind":"pith_short_16","alias_value":"LADN3ZC5D5ESTCFV","created_at":"2026-08-03T01:34:36Z"},{"alias_kind":"pith_short_8","alias_value":"LADN3ZC5","created_at":"2026-08-03T01:34:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:LADN3ZC5D5ESTCFVARS6BXXLB7","target":"record","payload":{"canonical_record":{"source":{"id":"2607.29453","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-07-31T14:15:12Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"66a18e05d61c2f9c7743ef6438d1e955ca09e36bb9acd09f3590790c8d3d560f","abstract_canon_sha256":"66d5bcdf7e9567c374ebabecc084f2dc337965a5629c0361112cd1ab5c6dfb5f"},"schema_version":"1.0"},"canonical_sha256":"5806dde45d1f492988b50465e0deeb0fc1f16f3972125c9b45472cfeadbdbbe6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-03T01:34:36.565028Z","signature_b64":"40BSSwTZMXyvp0T1XG7GPP2vOOwZwzfbrIXIW+cmwiHsviayh2K3Ro/vzKyPNBOWmRBQolvg3krNO6xinBKdDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5806dde45d1f492988b50465e0deeb0fc1f16f3972125c9b45472cfeadbdbbe6","last_reissued_at":"2026-08-03T01:34:36.563512Z","signature_status":"signed_v1","first_computed_at":"2026-08-03T01:34:36.563512Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.29453","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-08-03T01:34:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xkW7bIpfZmBlGCBwICj2gDpCGdNqZrRgf6vPPV2Es4Nh0ghdRjm4FNhjG56X3Rd5p8MQbWGUXcJB7MZNzL+hDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T02:19:27.606473Z"},"content_sha256":"63767b638b993b95c77e1f2c4f6f0f1949cdfd6e5b933a73e54c3306e774870b","schema_version":"1.0","event_id":"sha256:63767b638b993b95c77e1f2c4f6f0f1949cdfd6e5b933a73e54c3306e774870b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:LADN3ZC5D5ESTCFVARS6BXXLB7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum Algorithms for Modular Factorials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Yann Tal","submitted_at":"2026-07-31T14:15:12Z","abstract_excerpt":"We give a bounded-error quantum algorithm that, given a prime $p$, a divisor $q\\mid(p-1)$, and an integer $0<n<p$, computes $n!\\bmod p$ in expected time $\\widetilde{O}(q^c+\\sqrt{p/q})$ for some absolute constant $c\\ge 1$. When $p-1$ has a divisor of size $q\\approx p^{1/(2c+1)}$, this gives the exponent $c/(2c+1)<1/2$. To our knowledge, this is the first algorithm to break the exponent $1/2$ barrier for modular factorials under such a divisor promise. The main technical ingredient is a quantum algorithm that reconstructs the relevant Jacobi sum exactly in compact algebraic form, with polynomial"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.29453","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.29453/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","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":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-03T01:34:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qzqq5IqCCamYVy225rrJq5zmek1taaOhF6tkNTq1s4PFScEd1DN01ahAYQTmUPplVQ1Em3iIgzij8ty4tpr+Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T02:19:27.606860Z"},"content_sha256":"7297e25504b79748e437b156f26201a1343107725aa64f00dbe59ae4deae43dd","schema_version":"1.0","event_id":"sha256:7297e25504b79748e437b156f26201a1343107725aa64f00dbe59ae4deae43dd"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:LADN3ZC5D5ESTCFVARS6BXXLB7","target":"integrity","payload":{"note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1090/S0273-0979-1989-15750-9 resolves to 'On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal mac'. A reader following the printed text alone cannot reach it.","snippet":"L. Blum, M. Shub, and S. Smale. “On a Theory of Computation and Complexity over the Real Numbers: NP-Completeness, Recursive Functions and Universal Machines”. In:Bulletin of the American Mathematical Society21.1 (1989), pp. 1–46.doi:10.109","arxiv_id":"2607.29453","detector":"doi_compliance","evidence":{"ref_index":11,"verdict_class":"incontrovertible","resolved_title":"On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines","printed_excerpt":"10.1090/s0273-0979-1989-","reconstructed_doi":"10.1090/S0273-0979-1989-15750-9"},"severity":"advisory","ref_index":11,"audited_at":"2026-08-03T06:58:02.073771Z","event_type":"pith.integrity.v1","detected_doi":"10.1090/S0273-0979-1989-15750-9","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"4ad7e4c0e5113f200272cfec367f51b78cac93894f8f35b18931849dc482774e","paper_version":1,"verdict_class":"incontrovertible","resolved_title":"On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines","detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":17571,"payload_sha256":"483b2efbf9f2f59139cf64fa4f0d157707a079d5949737e2663c1d7ecb5c3516","signature_b64":"qvPwiTzspmM7L/APmxwNuUw3nRO2F1qrsWoC/lc/fZcz1GzxS6swaCLKK4r6d5r7Bff9WYN8s1ysOHtZQ4TDCg==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-03T06:58:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ew3sPZsrJux+acczAIjbZP5v+S+gINNtho4w2zRDnK+SJ3NSn4EcFd8N323jpSrSmLYtR2VDmHRABAyaMWLJCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T02:19:27.609178Z"},"content_sha256":"bb739c2830dc56ad6a4aef76e7830d172b348d24fd139b2ee4d9063fcb4e3ae2","schema_version":"1.0","event_id":"sha256:bb739c2830dc56ad6a4aef76e7830d172b348d24fd139b2ee4d9063fcb4e3ae2"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:LADN3ZC5D5ESTCFVARS6BXXLB7","target":"integrity","payload":{"note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1006/jnth.1995.1060 resolves to 'On Jacobi Sums, Multinomial Coefficients, and p-adic Hypergeometric Functions'. A reader following the printed text alone cannot reach it.","snippet":"P. T. Young. “On Jacobi Sums, Multinomial Coefficients, andp-adic Hypergeometric Func- tions”. In:Journal of Number Theory52.1 (1995), pp. 125–144.doi: 10.1006/jnth.1995. 1060","arxiv_id":"2607.29453","detector":"doi_compliance","evidence":{"ref_index":3,"verdict_class":"incontrovertible","resolved_title":"On Jacobi Sums, Multinomial Coefficients, and p-adic Hypergeometric Functions","printed_excerpt":"10.1006/jnth.1995","reconstructed_doi":"10.1006/jnth.1995.1060"},"severity":"advisory","ref_index":3,"audited_at":"2026-08-03T06:58:02.073771Z","event_type":"pith.integrity.v1","detected_doi":"10.1006/jnth.1995.1060","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"d68c3a7533501ff8ea4fe8a76dc62fdd5a6f144d062ae642a9653a13816348c6","paper_version":1,"verdict_class":"incontrovertible","resolved_title":"On Jacobi Sums, Multinomial Coefficients, and p-adic Hypergeometric Functions","detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":17570,"payload_sha256":"c101a3f4f415360bbb79536f18773d5188cf1111589e44afdeb2213f20d29d45","signature_b64":"7YqKuju9TkBGrCtyl02BdCbro2eml0CkVmrn5zlOV9QQBIsYeSNO7ljXxnK7AVc91phZlWw8E8DoUZ4fPznwCw==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-03T06:58:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RHdNx1x7ZgBSXzQ2BwjASyt4yK4wtEpHPrw6FZs/+PM/5qLS5vjwPYEf2yHcZ043A9X+KXXvCdMkoeU740rpCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T02:19:27.609488Z"},"content_sha256":"5b553ddeb605666aa2e93dbfd7faf0f9048231a1871399558d9c889392486279","schema_version":"1.0","event_id":"sha256:5b553ddeb605666aa2e93dbfd7faf0f9048231a1871399558d9c889392486279"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LADN3ZC5D5ESTCFVARS6BXXLB7/bundle.json","state_url":"https://pith.science/pith/LADN3ZC5D5ESTCFVARS6BXXLB7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LADN3ZC5D5ESTCFVARS6BXXLB7/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-08-14T02:19:27Z","links":{"resolver":"https://pith.science/pith/LADN3ZC5D5ESTCFVARS6BXXLB7","bundle":"https://pith.science/pith/LADN3ZC5D5ESTCFVARS6BXXLB7/bundle.json","state":"https://pith.science/pith/LADN3ZC5D5ESTCFVARS6BXXLB7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LADN3ZC5D5ESTCFVARS6BXXLB7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:LADN3ZC5D5ESTCFVARS6BXXLB7","merge_version":"pith-open-graph-merge-v1","event_count":4,"valid_event_count":4,"invalid_event_count":0,"equivocation_count":1,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"66d5bcdf7e9567c374ebabecc084f2dc337965a5629c0361112cd1ab5c6dfb5f","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-07-31T14:15:12Z","title_canon_sha256":"66a18e05d61c2f9c7743ef6438d1e955ca09e36bb9acd09f3590790c8d3d560f"},"schema_version":"1.0","source":{"id":"2607.29453","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.29453","created_at":"2026-08-03T01:34:36Z"},{"alias_kind":"arxiv_version","alias_value":"2607.29453v1","created_at":"2026-08-03T01:34:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.29453","created_at":"2026-08-03T01:34:36Z"},{"alias_kind":"pith_short_12","alias_value":"LADN3ZC5D5ES","created_at":"2026-08-03T01:34:36Z"},{"alias_kind":"pith_short_16","alias_value":"LADN3ZC5D5ESTCFV","created_at":"2026-08-03T01:34:36Z"},{"alias_kind":"pith_short_8","alias_value":"LADN3ZC5","created_at":"2026-08-03T01:34:36Z"}],"graph_snapshots":[{"event_id":"sha256:7297e25504b79748e437b156f26201a1343107725aa64f00dbe59ae4deae43dd","target":"graph","created_at":"2026-08-03T01:34:36Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2607.29453/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We give a bounded-error quantum algorithm that, given a prime $p$, a divisor $q\\mid(p-1)$, and an integer $0<n<p$, computes $n!\\bmod p$ in expected time $\\widetilde{O}(q^c+\\sqrt{p/q})$ for some absolute constant $c\\ge 1$. When $p-1$ has a divisor of size $q\\approx p^{1/(2c+1)}$, this gives the exponent $c/(2c+1)<1/2$. To our knowledge, this is the first algorithm to break the exponent $1/2$ barrier for modular factorials under such a divisor promise. The main technical ingredient is a quantum algorithm that reconstructs the relevant Jacobi sum exactly in compact algebraic form, with polynomial","authors_text":"Yann Tal","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-07-31T14:15:12Z","title":"Quantum Algorithms for Modular Factorials"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.29453","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:63767b638b993b95c77e1f2c4f6f0f1949cdfd6e5b933a73e54c3306e774870b","target":"record","created_at":"2026-08-03T01:34:36Z","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":"66d5bcdf7e9567c374ebabecc084f2dc337965a5629c0361112cd1ab5c6dfb5f","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-07-31T14:15:12Z","title_canon_sha256":"66a18e05d61c2f9c7743ef6438d1e955ca09e36bb9acd09f3590790c8d3d560f"},"schema_version":"1.0","source":{"id":"2607.29453","kind":"arxiv","version":1}},"canonical_sha256":"5806dde45d1f492988b50465e0deeb0fc1f16f3972125c9b45472cfeadbdbbe6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5806dde45d1f492988b50465e0deeb0fc1f16f3972125c9b45472cfeadbdbbe6","first_computed_at":"2026-08-03T01:34:36.563512Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-03T01:34:36.563512Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"40BSSwTZMXyvp0T1XG7GPP2vOOwZwzfbrIXIW+cmwiHsviayh2K3Ro/vzKyPNBOWmRBQolvg3krNO6xinBKdDg==","signature_status":"signed_v1","signed_at":"2026-08-03T01:34:36.565028Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.29453","source_kind":"arxiv","source_version":1}}},"equivocations":[{"signer_id":"pith.science","event_type":"integrity_finding","target":"integrity","event_ids":["sha256:5b553ddeb605666aa2e93dbfd7faf0f9048231a1871399558d9c889392486279","sha256:bb739c2830dc56ad6a4aef76e7830d172b348d24fd139b2ee4d9063fcb4e3ae2"]}],"invalid_events":[],"applied_event_ids":["sha256:63767b638b993b95c77e1f2c4f6f0f1949cdfd6e5b933a73e54c3306e774870b","sha256:7297e25504b79748e437b156f26201a1343107725aa64f00dbe59ae4deae43dd"],"state_sha256":"08b2a0b3a3d67c8915f3c37bb0edba29c525cc2ebfef679dc648c97579ac89bd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QfbBe6f+xXPPasXXUxVmVABhkHqH+WPElFHkwSPAIPHQvnYNS+r5d/eP78+YyBSzAWV1OV2c1IpnkUiwbwmMAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T02:19:27.611280Z","bundle_sha256":"3bab1be65f9ecd879815be2efd10d2cd9ab9f9700f1f3b5646baf7c3b576ff85"}}