{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:OHLP35GMLAIDWWVXEKNZT4QNWA","short_pith_number":"pith:OHLP35GM","canonical_record":{"source":{"id":"2112.02040","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-12-03T17:39:41Z","cross_cats_sorted":["cs.DS","math-ph","math.MP"],"title_canon_sha256":"9f9b5bc0a02e76917f5fc2146718e4b042b9e967dbd338440dd925ca67b295b8","abstract_canon_sha256":"70e006f3ea9dcd93a741ce467b581ed988b5cd4a5389793c7bf3a44346914a66"},"schema_version":"1.0"},"canonical_sha256":"71d6fdf4cc58103b5ab7229b99f20db0163f4ca9542440d92b4349b69f161d1b","source":{"kind":"arxiv","id":"2112.02040","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.02040","created_at":"2026-07-05T03:37:35Z"},{"alias_kind":"arxiv_version","alias_value":"2112.02040v1","created_at":"2026-07-05T03:37:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.02040","created_at":"2026-07-05T03:37:35Z"},{"alias_kind":"pith_short_12","alias_value":"OHLP35GMLAID","created_at":"2026-07-05T03:37:35Z"},{"alias_kind":"pith_short_16","alias_value":"OHLP35GMLAIDWWVX","created_at":"2026-07-05T03:37:35Z"},{"alias_kind":"pith_short_8","alias_value":"OHLP35GM","created_at":"2026-07-05T03:37:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:OHLP35GMLAIDWWVXEKNZT4QNWA","target":"record","payload":{"canonical_record":{"source":{"id":"2112.02040","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-12-03T17:39:41Z","cross_cats_sorted":["cs.DS","math-ph","math.MP"],"title_canon_sha256":"9f9b5bc0a02e76917f5fc2146718e4b042b9e967dbd338440dd925ca67b295b8","abstract_canon_sha256":"70e006f3ea9dcd93a741ce467b581ed988b5cd4a5389793c7bf3a44346914a66"},"schema_version":"1.0"},"canonical_sha256":"71d6fdf4cc58103b5ab7229b99f20db0163f4ca9542440d92b4349b69f161d1b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:37:35.188325Z","signature_b64":"pPint3/3OdcbmPD7NSWWdiP+odQgQZJdtsxqyqG5fVXn+IpsE3JIh/20kIbPU4pAm3A31clBhHiuJAvfsqhwBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"71d6fdf4cc58103b5ab7229b99f20db0163f4ca9542440d92b4349b69f161d1b","last_reissued_at":"2026-07-05T03:37:35.187729Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:37:35.187729Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2112.02040","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-07-05T03:37:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kj73gKSJLgY5vP/zoNg8SJ8WFdw/Ryv1rKem7aCymxtfCt6AGIGNdazDgXWDnMevbQ9O3fgQ6wkwjF0fIS0PBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T00:01:06.062005Z"},"content_sha256":"8c5cf6275c326e7b23e56751c769a78cb09ac5563bf59f1865ec0acb7204f67f","schema_version":"1.0","event_id":"sha256:8c5cf6275c326e7b23e56751c769a78cb09ac5563bf59f1865ec0acb7204f67f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:OHLP35GMLAIDWWVXEKNZT4QNWA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Universal Quantum Compilation: An Inverse-free Solovay-Kitaev Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math-ph","math.MP"],"primary_cat":"quant-ph","authors_text":"Adam Bouland, Tudor Giurgica-Tiron","submitted_at":"2021-12-03T17:39:41Z","abstract_excerpt":"The Solovay-Kitaev algorithm is a fundamental result in quantum computation. It gives an algorithm for efficiently compiling arbitrary unitaries using universal gate sets: any unitary can be approximated by short gates sequences, whose length scales merely poly-logarithmically with accuracy. As a consequence, the choice of gate set is typically unimportant in quantum computing. However, the Solovay-Kitaev algorithm requires the gate set to be inverse-closed. It has been a longstanding open question if efficient algorithmic compilation is possible without this condition. In this work, we provid"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.02040","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/2112.02040/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-07-05T03:37:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lTmRV5vQOpABCe2lvFu4vlXDXw8FRyha7DzvC/mDdIuUL3VtLU++GBJAhL4NxVQUy7bInBhJpdFIk7BBPHScAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T00:01:06.062740Z"},"content_sha256":"a6e80340fece06fe9ae77767b9e586c5268352ae509677959adb2f0d8a7c209e","schema_version":"1.0","event_id":"sha256:a6e80340fece06fe9ae77767b9e586c5268352ae509677959adb2f0d8a7c209e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OHLP35GMLAIDWWVXEKNZT4QNWA/bundle.json","state_url":"https://pith.science/pith/OHLP35GMLAIDWWVXEKNZT4QNWA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OHLP35GMLAIDWWVXEKNZT4QNWA/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-16T00:01:06Z","links":{"resolver":"https://pith.science/pith/OHLP35GMLAIDWWVXEKNZT4QNWA","bundle":"https://pith.science/pith/OHLP35GMLAIDWWVXEKNZT4QNWA/bundle.json","state":"https://pith.science/pith/OHLP35GMLAIDWWVXEKNZT4QNWA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OHLP35GMLAIDWWVXEKNZT4QNWA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:OHLP35GMLAIDWWVXEKNZT4QNWA","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":"70e006f3ea9dcd93a741ce467b581ed988b5cd4a5389793c7bf3a44346914a66","cross_cats_sorted":["cs.DS","math-ph","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-12-03T17:39:41Z","title_canon_sha256":"9f9b5bc0a02e76917f5fc2146718e4b042b9e967dbd338440dd925ca67b295b8"},"schema_version":"1.0","source":{"id":"2112.02040","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.02040","created_at":"2026-07-05T03:37:35Z"},{"alias_kind":"arxiv_version","alias_value":"2112.02040v1","created_at":"2026-07-05T03:37:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.02040","created_at":"2026-07-05T03:37:35Z"},{"alias_kind":"pith_short_12","alias_value":"OHLP35GMLAID","created_at":"2026-07-05T03:37:35Z"},{"alias_kind":"pith_short_16","alias_value":"OHLP35GMLAIDWWVX","created_at":"2026-07-05T03:37:35Z"},{"alias_kind":"pith_short_8","alias_value":"OHLP35GM","created_at":"2026-07-05T03:37:35Z"}],"graph_snapshots":[{"event_id":"sha256:a6e80340fece06fe9ae77767b9e586c5268352ae509677959adb2f0d8a7c209e","target":"graph","created_at":"2026-07-05T03:37:35Z","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/2112.02040/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Solovay-Kitaev algorithm is a fundamental result in quantum computation. It gives an algorithm for efficiently compiling arbitrary unitaries using universal gate sets: any unitary can be approximated by short gates sequences, whose length scales merely poly-logarithmically with accuracy. As a consequence, the choice of gate set is typically unimportant in quantum computing. However, the Solovay-Kitaev algorithm requires the gate set to be inverse-closed. It has been a longstanding open question if efficient algorithmic compilation is possible without this condition. In this work, we provid","authors_text":"Adam Bouland, Tudor Giurgica-Tiron","cross_cats":["cs.DS","math-ph","math.MP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-12-03T17:39:41Z","title":"Efficient Universal Quantum Compilation: An Inverse-free Solovay-Kitaev Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.02040","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:8c5cf6275c326e7b23e56751c769a78cb09ac5563bf59f1865ec0acb7204f67f","target":"record","created_at":"2026-07-05T03:37:35Z","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":"70e006f3ea9dcd93a741ce467b581ed988b5cd4a5389793c7bf3a44346914a66","cross_cats_sorted":["cs.DS","math-ph","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-12-03T17:39:41Z","title_canon_sha256":"9f9b5bc0a02e76917f5fc2146718e4b042b9e967dbd338440dd925ca67b295b8"},"schema_version":"1.0","source":{"id":"2112.02040","kind":"arxiv","version":1}},"canonical_sha256":"71d6fdf4cc58103b5ab7229b99f20db0163f4ca9542440d92b4349b69f161d1b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"71d6fdf4cc58103b5ab7229b99f20db0163f4ca9542440d92b4349b69f161d1b","first_computed_at":"2026-07-05T03:37:35.187729Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:37:35.187729Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pPint3/3OdcbmPD7NSWWdiP+odQgQZJdtsxqyqG5fVXn+IpsE3JIh/20kIbPU4pAm3A31clBhHiuJAvfsqhwBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T03:37:35.188325Z","signed_message":"canonical_sha256_bytes"},"source_id":"2112.02040","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8c5cf6275c326e7b23e56751c769a78cb09ac5563bf59f1865ec0acb7204f67f","sha256:a6e80340fece06fe9ae77767b9e586c5268352ae509677959adb2f0d8a7c209e"],"state_sha256":"c96742d0abeb9b155952f180d4ae965f0f51886b04e23fcb88abf960918cd888"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NG3isMzmG5tKYamvsSXYPVE9H3ARWQdO5fH7uuXYXNWf+RWI7NX47+H2xra3NOX9H/gqXN3vUdsBwBe350n0Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T00:01:06.068684Z","bundle_sha256":"1779c0c9033a07e5a2a9dd7179b2bd82d48a3ff403ac74ecad502aca576841bf"}}