{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:XEM5LDX34M4WNRLIEHBQHPDADT","short_pith_number":"pith:XEM5LDX3","canonical_record":{"source":{"id":"2111.07992","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-11-15T18:53:48Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"9aeed3136e1d352ab52bf4ba45341286f245e436b06bc6811ef60edaf2feecaa","abstract_canon_sha256":"ae24996a0fb32001784784d0c4a899dc18a5f4d72ec29096829f2d1b54eb9b59"},"schema_version":"1.0"},"canonical_sha256":"b919d58efbe33966c56821c303bc601cd2d9fa95f2cf80b57c8a0baf98c224fa","source":{"kind":"arxiv","id":"2111.07992","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2111.07992","created_at":"2026-07-01T14:23:04Z"},{"alias_kind":"arxiv_version","alias_value":"2111.07992v5","created_at":"2026-07-01T14:23:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.07992","created_at":"2026-07-01T14:23:04Z"},{"alias_kind":"pith_short_12","alias_value":"XEM5LDX34M4W","created_at":"2026-07-01T14:23:04Z"},{"alias_kind":"pith_short_16","alias_value":"XEM5LDX34M4WNRLI","created_at":"2026-07-01T14:23:04Z"},{"alias_kind":"pith_short_8","alias_value":"XEM5LDX3","created_at":"2026-07-01T14:23:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:XEM5LDX34M4WNRLIEHBQHPDADT","target":"record","payload":{"canonical_record":{"source":{"id":"2111.07992","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-11-15T18:53:48Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"9aeed3136e1d352ab52bf4ba45341286f245e436b06bc6811ef60edaf2feecaa","abstract_canon_sha256":"ae24996a0fb32001784784d0c4a899dc18a5f4d72ec29096829f2d1b54eb9b59"},"schema_version":"1.0"},"canonical_sha256":"b919d58efbe33966c56821c303bc601cd2d9fa95f2cf80b57c8a0baf98c224fa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-01T14:23:04.605739Z","signature_b64":"bmpz3IsH7OH+a4gsdbmtRSAlaBBrdmXQ05w0g91kveXRv19FSmgVYyFrSw2Hjwi33kfDKatsFfiDQEvyGgJkDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b919d58efbe33966c56821c303bc601cd2d9fa95f2cf80b57c8a0baf98c224fa","last_reissued_at":"2026-07-01T14:23:04.605215Z","signature_status":"signed_v1","first_computed_at":"2026-07-01T14:23:04.605215Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2111.07992","source_version":5,"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-07-01T14:23:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6gnCrjf+K9vQR+TeYPGkl0LI7RaaZfLG9bNfhhSY+GODZ1XeEc6lKgoTJf36H5CiYl4dlZPdFZEjmq2xyxhjAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-10T12:13:55.708265Z"},"content_sha256":"88ce87d07a43eca638ed7db68701ce3a39bb60ab0066b2c661e13204c49ef846","schema_version":"1.0","event_id":"sha256:88ce87d07a43eca638ed7db68701ce3a39bb60ab0066b2c661e13204c49ef846"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:XEM5LDX34M4WNRLIEHBQHPDADT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Query and Depth Upper Bounds for Quantum Unitaries via Grover Search","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Any n-qubit unitary can be implemented approximately in time Õ(2^{n/2}) with oracle queries or exactly in circuit depth Õ(2^{n/2}) with ancillae.","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Gregory Rosenthal","submitted_at":"2021-11-15T18:53:48Z","abstract_excerpt":"We prove that any $n$-qubit unitary can be implemented (i) approximately in time $\\tilde O\\big(2^{n/2}\\big)$ with query access to an appropriate classical oracle, and also (ii) exactly by a circuit of depth $\\tilde O\\big(2^{n/2}\\big)$ with one- and two-qubit gates and $2^{O(n)}$ ancillae. The proofs involve similar reductions to Grover search. The proof of (ii) also involves a linear-depth construction of arbitrary quantum states using one- and two-qubit gates (in fact, this can be improved to constant depth with the addition of fanout and generalized Toffoli gates) which may be of independent"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We prove that any n-qubit unitary can be implemented (i) approximately in time Õ(2^{n/2}) with query access to an appropriate classical oracle, and also (ii) exactly by a circuit of depth Õ(2^{n/2}) with one- and two-qubit gates and 2^{O(n)} ancillae. The proofs involve similar reductions to Grover search.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The existence and query accessibility of an 'appropriate classical oracle' encoding the unitary for part (i), together with the availability of 2^{O(n)} ancilla qubits and the linear-depth arbitrary state preparation subroutine for part (ii); if these modeling assumptions fail or the reductions do not hold, the stated bounds are invalidated. This premise enters directly in the abstract's statement of the two main results.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Any n-qubit unitary can be implemented approximately with Õ(2^{n/2}) oracle queries or exactly with Õ(2^{n/2}) circuit depth via Grover search reductions, with matching lower bounds for certain implementations.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Any n-qubit unitary can be implemented approximately in time Õ(2^{n/2}) with oracle queries or exactly in circuit depth Õ(2^{n/2}) with ancillae.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"64c757847b44b3e58ea3c69f71008bc9232551e4c2f40846a052d79155527a97"},"source":{"id":"2111.07992","kind":"arxiv","version":5},"verdict":{"id":"ae2b4a00-fa69-47e6-991a-58fb7fe4b2b9","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-24T13:23:19.677434Z","strongest_claim":"We prove that any n-qubit unitary can be implemented (i) approximately in time Õ(2^{n/2}) with query access to an appropriate classical oracle, and also (ii) exactly by a circuit of depth Õ(2^{n/2}) with one- and two-qubit gates and 2^{O(n)} ancillae. The proofs involve similar reductions to Grover search.","one_line_summary":"Any n-qubit unitary can be implemented approximately with Õ(2^{n/2}) oracle queries or exactly with Õ(2^{n/2}) circuit depth via Grover search reductions, with matching lower bounds for certain implementations.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The existence and query accessibility of an 'appropriate classical oracle' encoding the unitary for part (i), together with the availability of 2^{O(n)} ancilla qubits and the linear-depth arbitrary state preparation subroutine for part (ii); if these modeling assumptions fail or the reductions do not hold, the stated bounds are invalidated. This premise enters directly in the abstract's statement of the two main results.","pith_extraction_headline":"Any n-qubit unitary can be implemented approximately in time Õ(2^{n/2}) with oracle queries or exactly in circuit depth Õ(2^{n/2}) with ancillae."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2111.07992/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":24,"sample":[{"doi":"","year":2021,"title":"Open problems related to quantum query complexity","work_id":"1c1b055e-cfb6-4172-aeca-fdb99192ddc6","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2016,"title":"The Complexity of Quantum States and Transformations: From Quantum Money to Black Holes","work_id":"d0452c4e-3afd-4f24-9ebc-33a4213cace1","ref_index":2,"cited_arxiv_id":"1607.05256","is_internal_anchor":true},{"doi":"10.4086/toc.2007.v003a007","year":2007,"title":"Quantum versus classical proofs and advice","work_id":"e48d873d-1f2d-49f3-a166-1e3f1cff2717","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1006/jcss.2002.1826","year":2002,"title":"Quantum lower bounds by quantum arguments","work_id":"55a1d840-a21e-45c1-a34e-2ec8ab7f1cf4","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1090/conm/305/05215","year":2002,"title":"Quantum Amplitude Amplification and Estimation","work_id":"c8922d48-1de0-498c-8b54-887d90f4834c","ref_index":5,"cited_arxiv_id":"quant-ph/0005055","is_internal_anchor":true}],"resolved_work":24,"snapshot_sha256":"0d1c057efcf58d861c60399f89c324c6c22e4e7e7761b0df80ab2a88bb3bb371","internal_anchors":7},"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":"ae2b4a00-fa69-47e6-991a-58fb7fe4b2b9"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-01T14:23:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V3kjaY7n3HgJwNQf5YZc8zAYFdUDE9fdU+Y8KEj6GBdbC87fd/n7VKM2NeACKqNCu+aqN4d0b81jf+PIVxqvCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-10T12:13:55.708876Z"},"content_sha256":"e2bb4321abbdc367dd3d4a6668cfc75b5dc6de270a472f467d0e6c2ebb9df643","schema_version":"1.0","event_id":"sha256:e2bb4321abbdc367dd3d4a6668cfc75b5dc6de270a472f467d0e6c2ebb9df643"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XEM5LDX34M4WNRLIEHBQHPDADT/bundle.json","state_url":"https://pith.science/pith/XEM5LDX34M4WNRLIEHBQHPDADT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XEM5LDX34M4WNRLIEHBQHPDADT/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-10T12:13:55Z","links":{"resolver":"https://pith.science/pith/XEM5LDX34M4WNRLIEHBQHPDADT","bundle":"https://pith.science/pith/XEM5LDX34M4WNRLIEHBQHPDADT/bundle.json","state":"https://pith.science/pith/XEM5LDX34M4WNRLIEHBQHPDADT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XEM5LDX34M4WNRLIEHBQHPDADT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:XEM5LDX34M4WNRLIEHBQHPDADT","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":"ae24996a0fb32001784784d0c4a899dc18a5f4d72ec29096829f2d1b54eb9b59","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-11-15T18:53:48Z","title_canon_sha256":"9aeed3136e1d352ab52bf4ba45341286f245e436b06bc6811ef60edaf2feecaa"},"schema_version":"1.0","source":{"id":"2111.07992","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2111.07992","created_at":"2026-07-01T14:23:04Z"},{"alias_kind":"arxiv_version","alias_value":"2111.07992v5","created_at":"2026-07-01T14:23:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.07992","created_at":"2026-07-01T14:23:04Z"},{"alias_kind":"pith_short_12","alias_value":"XEM5LDX34M4W","created_at":"2026-07-01T14:23:04Z"},{"alias_kind":"pith_short_16","alias_value":"XEM5LDX34M4WNRLI","created_at":"2026-07-01T14:23:04Z"},{"alias_kind":"pith_short_8","alias_value":"XEM5LDX3","created_at":"2026-07-01T14:23:04Z"}],"graph_snapshots":[{"event_id":"sha256:e2bb4321abbdc367dd3d4a6668cfc75b5dc6de270a472f467d0e6c2ebb9df643","target":"graph","created_at":"2026-07-01T14:23:04Z","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 any n-qubit unitary can be implemented (i) approximately in time Õ(2^{n/2}) with query access to an appropriate classical oracle, and also (ii) exactly by a circuit of depth Õ(2^{n/2}) with one- and two-qubit gates and 2^{O(n)} ancillae. The proofs involve similar reductions to Grover search."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The existence and query accessibility of an 'appropriate classical oracle' encoding the unitary for part (i), together with the availability of 2^{O(n)} ancilla qubits and the linear-depth arbitrary state preparation subroutine for part (ii); if these modeling assumptions fail or the reductions do not hold, the stated bounds are invalidated. This premise enters directly in the abstract's statement of the two main results."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Any n-qubit unitary can be implemented approximately with Õ(2^{n/2}) oracle queries or exactly with Õ(2^{n/2}) circuit depth via Grover search reductions, with matching lower bounds for certain implementations."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Any n-qubit unitary can be implemented approximately in time Õ(2^{n/2}) with oracle queries or exactly in circuit depth Õ(2^{n/2}) with ancillae."}],"snapshot_sha256":"64c757847b44b3e58ea3c69f71008bc9232551e4c2f40846a052d79155527a97"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2111.07992/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We prove that any $n$-qubit unitary can be implemented (i) approximately in time $\\tilde O\\big(2^{n/2}\\big)$ with query access to an appropriate classical oracle, and also (ii) exactly by a circuit of depth $\\tilde O\\big(2^{n/2}\\big)$ with one- and two-qubit gates and $2^{O(n)}$ ancillae. The proofs involve similar reductions to Grover search. The proof of (ii) also involves a linear-depth construction of arbitrary quantum states using one- and two-qubit gates (in fact, this can be improved to constant depth with the addition of fanout and generalized Toffoli gates) which may be of independent","authors_text":"Gregory Rosenthal","cross_cats":["cs.CC"],"headline":"Any n-qubit unitary can be implemented approximately in time Õ(2^{n/2}) with oracle queries or exactly in circuit depth Õ(2^{n/2}) with ancillae.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-11-15T18:53:48Z","title":"Query and Depth Upper Bounds for Quantum Unitaries via Grover Search"},"references":{"count":24,"internal_anchors":7,"resolved_work":24,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Open problems related to quantum query complexity","work_id":"1c1b055e-cfb6-4172-aeca-fdb99192ddc6","year":2021},{"cited_arxiv_id":"1607.05256","doi":"","is_internal_anchor":true,"ref_index":2,"title":"The Complexity of Quantum States and Transformations: From Quantum Money to Black Holes","work_id":"d0452c4e-3afd-4f24-9ebc-33a4213cace1","year":2016},{"cited_arxiv_id":"","doi":"10.4086/toc.2007.v003a007","is_internal_anchor":false,"ref_index":3,"title":"Quantum versus classical proofs and advice","work_id":"e48d873d-1f2d-49f3-a166-1e3f1cff2717","year":2007},{"cited_arxiv_id":"","doi":"10.1006/jcss.2002.1826","is_internal_anchor":false,"ref_index":4,"title":"Quantum lower bounds by quantum arguments","work_id":"55a1d840-a21e-45c1-a34e-2ec8ab7f1cf4","year":2002},{"cited_arxiv_id":"quant-ph/0005055","doi":"10.1090/conm/305/05215","is_internal_anchor":true,"ref_index":5,"title":"Quantum Amplitude Amplification and Estimation","work_id":"c8922d48-1de0-498c-8b54-887d90f4834c","year":2002}],"snapshot_sha256":"0d1c057efcf58d861c60399f89c324c6c22e4e7e7761b0df80ab2a88bb3bb371"},"source":{"id":"2111.07992","kind":"arxiv","version":5},"verdict":{"created_at":"2026-05-24T13:23:19.677434Z","id":"ae2b4a00-fa69-47e6-991a-58fb7fe4b2b9","model_set":{"reader":"grok-4.3"},"one_line_summary":"Any n-qubit unitary can be implemented approximately with Õ(2^{n/2}) oracle queries or exactly with Õ(2^{n/2}) circuit depth via Grover search reductions, with matching lower bounds for certain implementations.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Any n-qubit unitary can be implemented approximately in time Õ(2^{n/2}) with oracle queries or exactly in circuit depth Õ(2^{n/2}) with ancillae.","strongest_claim":"We prove that any n-qubit unitary can be implemented (i) approximately in time Õ(2^{n/2}) with query access to an appropriate classical oracle, and also (ii) exactly by a circuit of depth Õ(2^{n/2}) with one- and two-qubit gates and 2^{O(n)} ancillae. The proofs involve similar reductions to Grover search.","weakest_assumption":"The existence and query accessibility of an 'appropriate classical oracle' encoding the unitary for part (i), together with the availability of 2^{O(n)} ancilla qubits and the linear-depth arbitrary state preparation subroutine for part (ii); if these modeling assumptions fail or the reductions do not hold, the stated bounds are invalidated. This premise enters directly in the abstract's statement of the two main results."}},"verdict_id":"ae2b4a00-fa69-47e6-991a-58fb7fe4b2b9"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:88ce87d07a43eca638ed7db68701ce3a39bb60ab0066b2c661e13204c49ef846","target":"record","created_at":"2026-07-01T14:23:04Z","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":"ae24996a0fb32001784784d0c4a899dc18a5f4d72ec29096829f2d1b54eb9b59","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-11-15T18:53:48Z","title_canon_sha256":"9aeed3136e1d352ab52bf4ba45341286f245e436b06bc6811ef60edaf2feecaa"},"schema_version":"1.0","source":{"id":"2111.07992","kind":"arxiv","version":5}},"canonical_sha256":"b919d58efbe33966c56821c303bc601cd2d9fa95f2cf80b57c8a0baf98c224fa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b919d58efbe33966c56821c303bc601cd2d9fa95f2cf80b57c8a0baf98c224fa","first_computed_at":"2026-07-01T14:23:04.605215Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-01T14:23:04.605215Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bmpz3IsH7OH+a4gsdbmtRSAlaBBrdmXQ05w0g91kveXRv19FSmgVYyFrSw2Hjwi33kfDKatsFfiDQEvyGgJkDA==","signature_status":"signed_v1","signed_at":"2026-07-01T14:23:04.605739Z","signed_message":"canonical_sha256_bytes"},"source_id":"2111.07992","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:88ce87d07a43eca638ed7db68701ce3a39bb60ab0066b2c661e13204c49ef846","sha256:e2bb4321abbdc367dd3d4a6668cfc75b5dc6de270a472f467d0e6c2ebb9df643"],"state_sha256":"830c01e07dd4b62466863a6252b81382d1672811ad61400730bce74927e730b2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SXs6OvmVbj2suYTG4WgOd9ksnVOhHewLqyNV5oAOK/OKC3fKUwMHNm+5zA6+G73b4RYK+UDFAMawenYuiSv5AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-10T12:13:55.711416Z","bundle_sha256":"6aeb60081e0a843721f674439ee262481e5e30b6d68c89b05f9583ada7536c68"}}