{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:CPXEMLP7RAPF2EJXMK7X2NCX66","short_pith_number":"pith:CPXEMLP7","canonical_record":{"source":{"id":"2511.01736","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2025-11-03T16:48:13Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"2ec4124015c2752c57091d2ce2a433f7c9323c646252ddb35d62afe9bb3e1075","abstract_canon_sha256":"b331f4f30579294a0db6ab4a090ab04fbc5a9e7d4cd4250ed085e67cc9c72d92"},"schema_version":"1.0"},"canonical_sha256":"13ee462dff881e5d113762bf7d3457f78c7efd8b544c28e0813ba6e4a8e8deb7","source":{"kind":"arxiv","id":"2511.01736","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2511.01736","created_at":"2026-05-18T02:44:33Z"},{"alias_kind":"arxiv_version","alias_value":"2511.01736v2","created_at":"2026-05-18T02:44:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.01736","created_at":"2026-05-18T02:44:33Z"},{"alias_kind":"pith_short_12","alias_value":"CPXEMLP7RAPF","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"CPXEMLP7RAPF2EJX","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"CPXEMLP7","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:CPXEMLP7RAPF2EJXMK7X2NCX66","target":"record","payload":{"canonical_record":{"source":{"id":"2511.01736","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2025-11-03T16:48:13Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"2ec4124015c2752c57091d2ce2a433f7c9323c646252ddb35d62afe9bb3e1075","abstract_canon_sha256":"b331f4f30579294a0db6ab4a090ab04fbc5a9e7d4cd4250ed085e67cc9c72d92"},"schema_version":"1.0"},"canonical_sha256":"13ee462dff881e5d113762bf7d3457f78c7efd8b544c28e0813ba6e4a8e8deb7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:33.018511Z","signature_b64":"m5D8gChZH2n3VL+ljtlE8o738XhF3I3LxRtF07NfhpjN525+NIHC/Rxd5D9rS93+NiAAF6Am+TKEd+TbFt+vCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"13ee462dff881e5d113762bf7d3457f78c7efd8b544c28e0813ba6e4a8e8deb7","last_reissued_at":"2026-05-18T02:44:33.018031Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:33.018031Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2511.01736","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:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4dnTEQ/jvMQm8VVphTwBx1seBJifO1y0CQC7Tf+VyAKVcX91owZ+BI6dUKRu5dvz/QdIXrdF6fEI3XJXbQVlCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-16T07:10:22.772776Z"},"content_sha256":"aa7beac4880b74fa0479a6448fa319adea23c9e9e9097a20c36aeb06d9fcfa49","schema_version":"1.0","event_id":"sha256:aa7beac4880b74fa0479a6448fa319adea23c9e9e9097a20c36aeb06d9fcfa49"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:CPXEMLP7RAPF2EJXMK7X2NCX66","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cobble: Compiling Block Encodings for Quantum Computational Linear Algebra","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Cobble lets developers write high-level expressions for block encodings that compile automatically to correct and efficient quantum circuits.","cross_cats":["quant-ph"],"primary_cat":"cs.PL","authors_text":"Charles Yuan","submitted_at":"2025-11-03T16:48:13Z","abstract_excerpt":"Quantum algorithms for computational linear algebra promise up to exponential speedups for applications such as simulation and regression, making them prime candidates for hardware realization. But these algorithms execute in a model that cannot efficiently store matrices in memory like a classical algorithm does, instead requiring developers to implement complex expressions for matrix arithmetic in terms of correct and efficient quantum circuits. Among the challenges for the developer is navigating a cost model in which conventional optimizations for linear algebra, such as subexpression reus"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Cobble enables developers to express and manipulate the quantum representations of matrices, known as block encodings, using high-level notation that automatically compiles to correct quantum circuits, with analyses and optimizations that reduce overhead and generate efficient circuits using state-of-the-art techniques such as the quantum singular value transformation, showing 2.6x-25.4x speedups on benchmarks.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the high-level notation and automatic compilation process in Cobble can produce circuits that are both semantically correct and measurably more efficient than hand-written implementations across the evaluated application domains without hidden correctness or performance issues.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Cobble is a domain-specific language for quantum block encodings that compiles high-level matrix expressions to optimized circuits using analyses and quantum singular value transformation, achieving 2.6x-25.4x speedups over unoptimized baselines on benchmarks.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Cobble lets developers write high-level expressions for block encodings that compile automatically to correct and efficient quantum circuits.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"49aaccb39b54f2404383b740e9c1846eaae2efd8bd46c070484faa2ddddce06e"},"source":{"id":"2511.01736","kind":"arxiv","version":2},"verdict":{"id":"59626706-b5fb-4ff1-ab22-e7187d0d7870","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-18T01:49:38.213842Z","strongest_claim":"Cobble enables developers to express and manipulate the quantum representations of matrices, known as block encodings, using high-level notation that automatically compiles to correct quantum circuits, with analyses and optimizations that reduce overhead and generate efficient circuits using state-of-the-art techniques such as the quantum singular value transformation, showing 2.6x-25.4x speedups on benchmarks.","one_line_summary":"Cobble is a domain-specific language for quantum block encodings that compiles high-level matrix expressions to optimized circuits using analyses and quantum singular value transformation, achieving 2.6x-25.4x speedups over unoptimized baselines on benchmarks.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the high-level notation and automatic compilation process in Cobble can produce circuits that are both semantically correct and measurably more efficient than hand-written implementations across the evaluated application domains without hidden correctness or performance issues.","pith_extraction_headline":"Cobble lets developers write high-level expressions for block encodings that compile automatically to correct and efficient quantum circuits."},"references":{"count":68,"sample":[{"doi":"10.48550/arxiv.1605.08695","year":null,"title":"Murray, Benoit Steiner, Paul Tucker, Vijay Vasudevan, Pete Warden, Martin Wicke, Yuan Yu, and Xiaoqiang Zheng","work_id":"53ef73a0-9b26-4048-8b67-96b9bd61a1d1","ref_index":1,"cited_arxiv_id":"1605.08695","is_internal_anchor":true},{"doi":"10.48550/arxiv.2404.12603","year":null,"title":"arXiv:2404.12603 [quant-ph] doi:10.48550/arXiv.2404.12603 Matthew Amy, Dmitri Maslov, and Michele Mosca","work_id":"f500e414-b99c-4200-9d02-ba9032a20ba7","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1109/tcad.2014.2341953","year":2014,"title":"doi:10.1109/TCAD.2014.2341953 E","work_id":"93a365ce-af16-4b36-bfe5-997e1b8cc48b","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1109/superc.1990.129995","year":1990,"title":"InACM/IEEE Conference on Supercomputing","work_id":"ef89b20d-4989-416c-b740-2a8ed4a69b36","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1145/3480935","year":2022,"title":"Available: https://doi.org/10.1145/3480935","work_id":"06ab11ec-6a0d-408b-aa44-d067eeb3d68c","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":68,"snapshot_sha256":"ec19685d9544f8119444a77974265369fe48484397135179c0f113c7ac63263e","internal_anchors":6},"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":"59626706-b5fb-4ff1-ab22-e7187d0d7870"},"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:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UxVes3+ZWfpKoz8cf6C24uHXfO1bytQqbPbo+8xBIIOOeKeU7ZTunkTKAWes4cE/JwGsfe7dWEqfK2IuCv/vBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-16T07:10:22.773285Z"},"content_sha256":"fbf46529238291ba94e9fbc0dfec874bd642e583a387765433468cc4cf052ccc","schema_version":"1.0","event_id":"sha256:fbf46529238291ba94e9fbc0dfec874bd642e583a387765433468cc4cf052ccc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CPXEMLP7RAPF2EJXMK7X2NCX66/bundle.json","state_url":"https://pith.science/pith/CPXEMLP7RAPF2EJXMK7X2NCX66/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CPXEMLP7RAPF2EJXMK7X2NCX66/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-16T07:10:22Z","links":{"resolver":"https://pith.science/pith/CPXEMLP7RAPF2EJXMK7X2NCX66","bundle":"https://pith.science/pith/CPXEMLP7RAPF2EJXMK7X2NCX66/bundle.json","state":"https://pith.science/pith/CPXEMLP7RAPF2EJXMK7X2NCX66/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CPXEMLP7RAPF2EJXMK7X2NCX66/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:CPXEMLP7RAPF2EJXMK7X2NCX66","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":"b331f4f30579294a0db6ab4a090ab04fbc5a9e7d4cd4250ed085e67cc9c72d92","cross_cats_sorted":["quant-ph"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2025-11-03T16:48:13Z","title_canon_sha256":"2ec4124015c2752c57091d2ce2a433f7c9323c646252ddb35d62afe9bb3e1075"},"schema_version":"1.0","source":{"id":"2511.01736","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2511.01736","created_at":"2026-05-18T02:44:33Z"},{"alias_kind":"arxiv_version","alias_value":"2511.01736v2","created_at":"2026-05-18T02:44:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.01736","created_at":"2026-05-18T02:44:33Z"},{"alias_kind":"pith_short_12","alias_value":"CPXEMLP7RAPF","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"CPXEMLP7RAPF2EJX","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"CPXEMLP7","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:fbf46529238291ba94e9fbc0dfec874bd642e583a387765433468cc4cf052ccc","target":"graph","created_at":"2026-05-18T02:44:33Z","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":"Cobble enables developers to express and manipulate the quantum representations of matrices, known as block encodings, using high-level notation that automatically compiles to correct quantum circuits, with analyses and optimizations that reduce overhead and generate efficient circuits using state-of-the-art techniques such as the quantum singular value transformation, showing 2.6x-25.4x speedups on benchmarks."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the high-level notation and automatic compilation process in Cobble can produce circuits that are both semantically correct and measurably more efficient than hand-written implementations across the evaluated application domains without hidden correctness or performance issues."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Cobble is a domain-specific language for quantum block encodings that compiles high-level matrix expressions to optimized circuits using analyses and quantum singular value transformation, achieving 2.6x-25.4x speedups over unoptimized baselines on benchmarks."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Cobble lets developers write high-level expressions for block encodings that compile automatically to correct and efficient quantum circuits."}],"snapshot_sha256":"49aaccb39b54f2404383b740e9c1846eaae2efd8bd46c070484faa2ddddce06e"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Quantum algorithms for computational linear algebra promise up to exponential speedups for applications such as simulation and regression, making them prime candidates for hardware realization. But these algorithms execute in a model that cannot efficiently store matrices in memory like a classical algorithm does, instead requiring developers to implement complex expressions for matrix arithmetic in terms of correct and efficient quantum circuits. Among the challenges for the developer is navigating a cost model in which conventional optimizations for linear algebra, such as subexpression reus","authors_text":"Charles Yuan","cross_cats":["quant-ph"],"headline":"Cobble lets developers write high-level expressions for block encodings that compile automatically to correct and efficient quantum circuits.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2025-11-03T16:48:13Z","title":"Cobble: Compiling Block Encodings for Quantum Computational Linear Algebra"},"references":{"count":68,"internal_anchors":6,"resolved_work":68,"sample":[{"cited_arxiv_id":"1605.08695","doi":"10.48550/arxiv.1605.08695","is_internal_anchor":true,"ref_index":1,"title":"Murray, Benoit Steiner, Paul Tucker, Vijay Vasudevan, Pete Warden, Martin Wicke, Yuan Yu, and Xiaoqiang Zheng","work_id":"53ef73a0-9b26-4048-8b67-96b9bd61a1d1","year":null},{"cited_arxiv_id":"","doi":"10.48550/arxiv.2404.12603","is_internal_anchor":false,"ref_index":2,"title":"arXiv:2404.12603 [quant-ph] doi:10.48550/arXiv.2404.12603 Matthew Amy, Dmitri Maslov, and Michele Mosca","work_id":"f500e414-b99c-4200-9d02-ba9032a20ba7","year":null},{"cited_arxiv_id":"","doi":"10.1109/tcad.2014.2341953","is_internal_anchor":false,"ref_index":3,"title":"doi:10.1109/TCAD.2014.2341953 E","work_id":"93a365ce-af16-4b36-bfe5-997e1b8cc48b","year":2014},{"cited_arxiv_id":"","doi":"10.1109/superc.1990.129995","is_internal_anchor":false,"ref_index":4,"title":"InACM/IEEE Conference on Supercomputing","work_id":"ef89b20d-4989-416c-b740-2a8ed4a69b36","year":1990},{"cited_arxiv_id":"","doi":"10.1145/3480935","is_internal_anchor":false,"ref_index":5,"title":"Available: https://doi.org/10.1145/3480935","work_id":"06ab11ec-6a0d-408b-aa44-d067eeb3d68c","year":2022}],"snapshot_sha256":"ec19685d9544f8119444a77974265369fe48484397135179c0f113c7ac63263e"},"source":{"id":"2511.01736","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-18T01:49:38.213842Z","id":"59626706-b5fb-4ff1-ab22-e7187d0d7870","model_set":{"reader":"grok-4.3"},"one_line_summary":"Cobble is a domain-specific language for quantum block encodings that compiles high-level matrix expressions to optimized circuits using analyses and quantum singular value transformation, achieving 2.6x-25.4x speedups over unoptimized baselines on benchmarks.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Cobble lets developers write high-level expressions for block encodings that compile automatically to correct and efficient quantum circuits.","strongest_claim":"Cobble enables developers to express and manipulate the quantum representations of matrices, known as block encodings, using high-level notation that automatically compiles to correct quantum circuits, with analyses and optimizations that reduce overhead and generate efficient circuits using state-of-the-art techniques such as the quantum singular value transformation, showing 2.6x-25.4x speedups on benchmarks.","weakest_assumption":"That the high-level notation and automatic compilation process in Cobble can produce circuits that are both semantically correct and measurably more efficient than hand-written implementations across the evaluated application domains without hidden correctness or performance issues."}},"verdict_id":"59626706-b5fb-4ff1-ab22-e7187d0d7870"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:aa7beac4880b74fa0479a6448fa319adea23c9e9e9097a20c36aeb06d9fcfa49","target":"record","created_at":"2026-05-18T02:44:33Z","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":"b331f4f30579294a0db6ab4a090ab04fbc5a9e7d4cd4250ed085e67cc9c72d92","cross_cats_sorted":["quant-ph"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2025-11-03T16:48:13Z","title_canon_sha256":"2ec4124015c2752c57091d2ce2a433f7c9323c646252ddb35d62afe9bb3e1075"},"schema_version":"1.0","source":{"id":"2511.01736","kind":"arxiv","version":2}},"canonical_sha256":"13ee462dff881e5d113762bf7d3457f78c7efd8b544c28e0813ba6e4a8e8deb7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"13ee462dff881e5d113762bf7d3457f78c7efd8b544c28e0813ba6e4a8e8deb7","first_computed_at":"2026-05-18T02:44:33.018031Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:33.018031Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"m5D8gChZH2n3VL+ljtlE8o738XhF3I3LxRtF07NfhpjN525+NIHC/Rxd5D9rS93+NiAAF6Am+TKEd+TbFt+vCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:33.018511Z","signed_message":"canonical_sha256_bytes"},"source_id":"2511.01736","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aa7beac4880b74fa0479a6448fa319adea23c9e9e9097a20c36aeb06d9fcfa49","sha256:fbf46529238291ba94e9fbc0dfec874bd642e583a387765433468cc4cf052ccc"],"state_sha256":"5a2ee776260eede624c86c4d60c64e386a066a225b154db9329227252314328c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"paDy6dCdfxaa89crqyqJLBB7I136dGfZucAMxeuHbClc/WcpCOEqlzY317fMQro320NmC2aHKOUa0dA5hfwcBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-16T07:10:22.776106Z","bundle_sha256":"fe40118e32b2130f27cf28a5ca854d1b3d3571013d6ac641185d841313fcde0d"}}