{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:WL6CQYAGAIMG3GGOKSGD2QUHPP","short_pith_number":"pith:WL6CQYAG","canonical_record":{"source":{"id":"1209.4139","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-09-19T02:45:57Z","cross_cats_sorted":[],"title_canon_sha256":"8fe54dea407a926457dc1dda7a0730e7b6e970569f8ecca9501e0eeb7d14f2a5","abstract_canon_sha256":"5c0a3268b3a0f70ce9d59084e6a9bdc57fd004cbf1df604c2f1de19a872327eb"},"schema_version":"1.0"},"canonical_sha256":"b2fc28600602186d98ce548c3d42877bcbfe0dfb36dbeae869737b32f111cb4a","source":{"kind":"arxiv","id":"1209.4139","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.4139","created_at":"2026-07-05T06:02:43Z"},{"alias_kind":"arxiv_version","alias_value":"1209.4139v1","created_at":"2026-07-05T06:02:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.4139","created_at":"2026-07-05T06:02:43Z"},{"alias_kind":"pith_short_12","alias_value":"WL6CQYAGAIMG","created_at":"2026-07-05T06:02:43Z"},{"alias_kind":"pith_short_16","alias_value":"WL6CQYAGAIMG3GGO","created_at":"2026-07-05T06:02:43Z"},{"alias_kind":"pith_short_8","alias_value":"WL6CQYAG","created_at":"2026-07-05T06:02:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:WL6CQYAGAIMG3GGOKSGD2QUHPP","target":"record","payload":{"canonical_record":{"source":{"id":"1209.4139","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-09-19T02:45:57Z","cross_cats_sorted":[],"title_canon_sha256":"8fe54dea407a926457dc1dda7a0730e7b6e970569f8ecca9501e0eeb7d14f2a5","abstract_canon_sha256":"5c0a3268b3a0f70ce9d59084e6a9bdc57fd004cbf1df604c2f1de19a872327eb"},"schema_version":"1.0"},"canonical_sha256":"b2fc28600602186d98ce548c3d42877bcbfe0dfb36dbeae869737b32f111cb4a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:02:43.166447Z","signature_b64":"NgGdDpzENSKartQbfA9M9Lff+8RsVulhuuSuD7mcJdjosTL9IwkLCOZzNevHF49DUGJln5LVanoWJUiLuKyrDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b2fc28600602186d98ce548c3d42877bcbfe0dfb36dbeae869737b32f111cb4a","last_reissued_at":"2026-07-05T06:02:43.166092Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:02:43.166092Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1209.4139","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-05T06:02:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LY++0buuKw7Sw1Ye9gMFyXPSXrW/yc/jLRwLe9zNaEwNB+RngFo5TGaopduCHYcUIS5s7Mj8KjT75tn60pP3BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T22:23:44.056687Z"},"content_sha256":"f14f7fdceb774705e8d9cc31f072f330d94241bf801a4363231e525e1e13b9b1","schema_version":"1.0","event_id":"sha256:f14f7fdceb774705e8d9cc31f072f330d94241bf801a4363231e525e1e13b9b1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:WL6CQYAGAIMG3GGOKSGD2QUHPP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimising the Solovay-Kitaev algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Dominic Horsman, Pham Tien Trung, Rodney Van Meter","submitted_at":"2012-09-19T02:45:57Z","abstract_excerpt":"The Solovay-Kitaev algorithm is the standard method used for approximating arbitrary single-qubit gates for fault-tolerant quantum computation. In this paper we introduce a technique called \"search space expansion\", which modifies the initial stage of the Solovay-Kitaev algorithm, increasing the length of the possible approximating sequences but without requiring an exhaustive search over all possible sequences. We show that our technique, combined with a GNAT geometric tree search outputs gate sequences that are almost an order of magnitude smaller for the same level of accuracy. This therefo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.4139","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/1209.4139/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-05T06:02:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bqRV95AZ/1yjPdRwUMSF4S9CsFtMuzhvMk6fkTpnjANCH5L0MWAlh0j1aHlhTXgKRFmjrMV86qC6zCBKSox6Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T22:23:44.057188Z"},"content_sha256":"a0be8efa0b6d22e59925afdefb7828591729bcc04eb990ecd5570a8fe34dac7f","schema_version":"1.0","event_id":"sha256:a0be8efa0b6d22e59925afdefb7828591729bcc04eb990ecd5570a8fe34dac7f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WL6CQYAGAIMG3GGOKSGD2QUHPP/bundle.json","state_url":"https://pith.science/pith/WL6CQYAGAIMG3GGOKSGD2QUHPP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WL6CQYAGAIMG3GGOKSGD2QUHPP/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-14T22:23:44Z","links":{"resolver":"https://pith.science/pith/WL6CQYAGAIMG3GGOKSGD2QUHPP","bundle":"https://pith.science/pith/WL6CQYAGAIMG3GGOKSGD2QUHPP/bundle.json","state":"https://pith.science/pith/WL6CQYAGAIMG3GGOKSGD2QUHPP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WL6CQYAGAIMG3GGOKSGD2QUHPP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:WL6CQYAGAIMG3GGOKSGD2QUHPP","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":"5c0a3268b3a0f70ce9d59084e6a9bdc57fd004cbf1df604c2f1de19a872327eb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-09-19T02:45:57Z","title_canon_sha256":"8fe54dea407a926457dc1dda7a0730e7b6e970569f8ecca9501e0eeb7d14f2a5"},"schema_version":"1.0","source":{"id":"1209.4139","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.4139","created_at":"2026-07-05T06:02:43Z"},{"alias_kind":"arxiv_version","alias_value":"1209.4139v1","created_at":"2026-07-05T06:02:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.4139","created_at":"2026-07-05T06:02:43Z"},{"alias_kind":"pith_short_12","alias_value":"WL6CQYAGAIMG","created_at":"2026-07-05T06:02:43Z"},{"alias_kind":"pith_short_16","alias_value":"WL6CQYAGAIMG3GGO","created_at":"2026-07-05T06:02:43Z"},{"alias_kind":"pith_short_8","alias_value":"WL6CQYAG","created_at":"2026-07-05T06:02:43Z"}],"graph_snapshots":[{"event_id":"sha256:a0be8efa0b6d22e59925afdefb7828591729bcc04eb990ecd5570a8fe34dac7f","target":"graph","created_at":"2026-07-05T06:02:43Z","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/1209.4139/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Solovay-Kitaev algorithm is the standard method used for approximating arbitrary single-qubit gates for fault-tolerant quantum computation. In this paper we introduce a technique called \"search space expansion\", which modifies the initial stage of the Solovay-Kitaev algorithm, increasing the length of the possible approximating sequences but without requiring an exhaustive search over all possible sequences. We show that our technique, combined with a GNAT geometric tree search outputs gate sequences that are almost an order of magnitude smaller for the same level of accuracy. This therefo","authors_text":"Dominic Horsman, Pham Tien Trung, Rodney Van Meter","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-09-19T02:45:57Z","title":"Optimising the Solovay-Kitaev algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.4139","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:f14f7fdceb774705e8d9cc31f072f330d94241bf801a4363231e525e1e13b9b1","target":"record","created_at":"2026-07-05T06:02:43Z","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":"5c0a3268b3a0f70ce9d59084e6a9bdc57fd004cbf1df604c2f1de19a872327eb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-09-19T02:45:57Z","title_canon_sha256":"8fe54dea407a926457dc1dda7a0730e7b6e970569f8ecca9501e0eeb7d14f2a5"},"schema_version":"1.0","source":{"id":"1209.4139","kind":"arxiv","version":1}},"canonical_sha256":"b2fc28600602186d98ce548c3d42877bcbfe0dfb36dbeae869737b32f111cb4a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b2fc28600602186d98ce548c3d42877bcbfe0dfb36dbeae869737b32f111cb4a","first_computed_at":"2026-07-05T06:02:43.166092Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:02:43.166092Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NgGdDpzENSKartQbfA9M9Lff+8RsVulhuuSuD7mcJdjosTL9IwkLCOZzNevHF49DUGJln5LVanoWJUiLuKyrDg==","signature_status":"signed_v1","signed_at":"2026-07-05T06:02:43.166447Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.4139","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f14f7fdceb774705e8d9cc31f072f330d94241bf801a4363231e525e1e13b9b1","sha256:a0be8efa0b6d22e59925afdefb7828591729bcc04eb990ecd5570a8fe34dac7f"],"state_sha256":"6a8a3ddd3f122a8b5d68c34d9f0c0b3174f2dfe47d68a4e14cf0c63c0b15424d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z1bA4vL4JPGaolma+agnJHUupQ/w/pZQKEk3vuS9EH1ixJ1GBtC5s6GauVALk2OXwuC12jCbQHpZzdI0bsa3Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T22:23:44.063349Z","bundle_sha256":"e01a465e4f7b9a0729e7f5dc49fa2e648b3126db3f5dc0714435ff2607260783"}}