{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:M4ZDLLJI4VN5AM56STJNVBMBS2","short_pith_number":"pith:M4ZDLLJI","canonical_record":{"source":{"id":"1106.2190","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-06-11T00:52:01Z","cross_cats_sorted":[],"title_canon_sha256":"67935b3aa1f64f6cc38e841c571bb62ed66164d9e71df628b29d8ad950485b0f","abstract_canon_sha256":"2bc2e05de259cf2072dcce652637c331467c3398e397fc26eaff43afcf5c67b2"},"schema_version":"1.0"},"canonical_sha256":"673235ad28e55bd033be94d2da8581969a7921134efa51350392e803746c7123","source":{"kind":"arxiv","id":"1106.2190","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.2190","created_at":"2026-05-18T03:28:17Z"},{"alias_kind":"arxiv_version","alias_value":"1106.2190v2","created_at":"2026-05-18T03:28:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.2190","created_at":"2026-05-18T03:28:17Z"},{"alias_kind":"pith_short_12","alias_value":"M4ZDLLJI4VN5","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"M4ZDLLJI4VN5AM56","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"M4ZDLLJI","created_at":"2026-05-18T12:26:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:M4ZDLLJI4VN5AM56STJNVBMBS2","target":"record","payload":{"canonical_record":{"source":{"id":"1106.2190","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-06-11T00:52:01Z","cross_cats_sorted":[],"title_canon_sha256":"67935b3aa1f64f6cc38e841c571bb62ed66164d9e71df628b29d8ad950485b0f","abstract_canon_sha256":"2bc2e05de259cf2072dcce652637c331467c3398e397fc26eaff43afcf5c67b2"},"schema_version":"1.0"},"canonical_sha256":"673235ad28e55bd033be94d2da8581969a7921134efa51350392e803746c7123","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:28:17.748190Z","signature_b64":"tE3udsk9tqwMEG5NqXRr1KSSfUWD7uur3TugfjOpKuisp6EpN76MfYUUKu4lWacPlWmfmSDOqOfPiMDQuZdUBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"673235ad28e55bd033be94d2da8581969a7921134efa51350392e803746c7123","last_reissued_at":"2026-05-18T03:28:17.747708Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:28:17.747708Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1106.2190","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-18T03:28:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ey6DrT7trysd+85IwS7adAff7ljezeP3EGyhfMlWnhOZ3iMQ51mCTDL81Fr9YlI4Cj+IldBzEP5G9D500uoYBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T13:11:20.169503Z"},"content_sha256":"2ea9f80e4c75886c4a1480cf6b57ae2ce31c3b9d56bedf7cb8dfd9720834cb4e","schema_version":"1.0","event_id":"sha256:2ea9f80e4c75886c4a1480cf6b57ae2ce31c3b9d56bedf7cb8dfd9720834cb4e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:M4ZDLLJI4VN5AM56STJNVBMBS2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fault-tolerant ancilla preparation and noise threshold lower bounds for the 23-qubit Golay code","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Adam Paetznick, Ben W. Reichardt","submitted_at":"2011-06-11T00:52:01Z","abstract_excerpt":"In fault-tolerant quantum computing schemes, the overhead is often dominated by the cost of preparing codewords reliably. This cost generally increases quadratically with the block size of the underlying quantum error-correcting code. In consequence, large codes that are otherwise very efficient have found limited fault-tolerance applications. Fault-tolerant preparation circuits therefore are an important target for optimization.\n  We study the Golay code, a 23-qubit quantum error-correcting code that protects the logical qubit to a distance of seven. In simulations, even using a naive ancilla"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.2190","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-05-18T03:28:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jprfD5WHX3ZtfRfB9uwOzAeIQ/9cbxcWvYvnxCJRxqDsB7cllKj3vB8AepLZBHulBoyZ/EzO/HQWnUCYMehMDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T13:11:20.169850Z"},"content_sha256":"7f0a1090a9f7b41c8986f6176fc7c881fba83600f87c90f1e3960b90985ee99b","schema_version":"1.0","event_id":"sha256:7f0a1090a9f7b41c8986f6176fc7c881fba83600f87c90f1e3960b90985ee99b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M4ZDLLJI4VN5AM56STJNVBMBS2/bundle.json","state_url":"https://pith.science/pith/M4ZDLLJI4VN5AM56STJNVBMBS2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M4ZDLLJI4VN5AM56STJNVBMBS2/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-05-20T13:11:20Z","links":{"resolver":"https://pith.science/pith/M4ZDLLJI4VN5AM56STJNVBMBS2","bundle":"https://pith.science/pith/M4ZDLLJI4VN5AM56STJNVBMBS2/bundle.json","state":"https://pith.science/pith/M4ZDLLJI4VN5AM56STJNVBMBS2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M4ZDLLJI4VN5AM56STJNVBMBS2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:M4ZDLLJI4VN5AM56STJNVBMBS2","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":"2bc2e05de259cf2072dcce652637c331467c3398e397fc26eaff43afcf5c67b2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-06-11T00:52:01Z","title_canon_sha256":"67935b3aa1f64f6cc38e841c571bb62ed66164d9e71df628b29d8ad950485b0f"},"schema_version":"1.0","source":{"id":"1106.2190","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.2190","created_at":"2026-05-18T03:28:17Z"},{"alias_kind":"arxiv_version","alias_value":"1106.2190v2","created_at":"2026-05-18T03:28:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.2190","created_at":"2026-05-18T03:28:17Z"},{"alias_kind":"pith_short_12","alias_value":"M4ZDLLJI4VN5","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"M4ZDLLJI4VN5AM56","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"M4ZDLLJI","created_at":"2026-05-18T12:26:34Z"}],"graph_snapshots":[{"event_id":"sha256:7f0a1090a9f7b41c8986f6176fc7c881fba83600f87c90f1e3960b90985ee99b","target":"graph","created_at":"2026-05-18T03:28:17Z","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"},"paper":{"abstract_excerpt":"In fault-tolerant quantum computing schemes, the overhead is often dominated by the cost of preparing codewords reliably. This cost generally increases quadratically with the block size of the underlying quantum error-correcting code. In consequence, large codes that are otherwise very efficient have found limited fault-tolerance applications. Fault-tolerant preparation circuits therefore are an important target for optimization.\n  We study the Golay code, a 23-qubit quantum error-correcting code that protects the logical qubit to a distance of seven. In simulations, even using a naive ancilla","authors_text":"Adam Paetznick, Ben W. Reichardt","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-06-11T00:52:01Z","title":"Fault-tolerant ancilla preparation and noise threshold lower bounds for the 23-qubit Golay code"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.2190","kind":"arxiv","version":2},"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:2ea9f80e4c75886c4a1480cf6b57ae2ce31c3b9d56bedf7cb8dfd9720834cb4e","target":"record","created_at":"2026-05-18T03:28:17Z","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":"2bc2e05de259cf2072dcce652637c331467c3398e397fc26eaff43afcf5c67b2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-06-11T00:52:01Z","title_canon_sha256":"67935b3aa1f64f6cc38e841c571bb62ed66164d9e71df628b29d8ad950485b0f"},"schema_version":"1.0","source":{"id":"1106.2190","kind":"arxiv","version":2}},"canonical_sha256":"673235ad28e55bd033be94d2da8581969a7921134efa51350392e803746c7123","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"673235ad28e55bd033be94d2da8581969a7921134efa51350392e803746c7123","first_computed_at":"2026-05-18T03:28:17.747708Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:28:17.747708Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tE3udsk9tqwMEG5NqXRr1KSSfUWD7uur3TugfjOpKuisp6EpN76MfYUUKu4lWacPlWmfmSDOqOfPiMDQuZdUBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:28:17.748190Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.2190","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2ea9f80e4c75886c4a1480cf6b57ae2ce31c3b9d56bedf7cb8dfd9720834cb4e","sha256:7f0a1090a9f7b41c8986f6176fc7c881fba83600f87c90f1e3960b90985ee99b"],"state_sha256":"b02b63023ef5b9e99cc78ad00188bb616d78377f69a876822258fa667dcd7dfa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1DRgruuG7y1NY2kjVA1oOeER9B/2BJiwcrrn4pCicEdmd3GJqQuwopbAbn3dgygECQgq52YPc89IrTsxOzhRCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T13:11:20.172057Z","bundle_sha256":"04eaa069fed969e09fdf5ca97fbf76a46f9e63c640e531aea2b79b076c6e5a75"}}