{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2005:KOYUNJROCLO3RBBNYXEZYNVILU","short_pith_number":"pith:KOYUNJRO","canonical_record":{"source":{"id":"quant-ph/0504218","kind":"arxiv","version":3},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2005-04-28T20:12:44Z","cross_cats_sorted":[],"title_canon_sha256":"5bea61ef4d65e413ec08cf4e0e030b49d9e7073662c998aa5331ac85f51c81b5","abstract_canon_sha256":"5a9f2e581de05a68e9e25086087dad7bd1aa41b3b69ee69b2995ee17f8b894c6"},"schema_version":"1.0"},"canonical_sha256":"53b146a62e12ddb8842dc5c99c36a85d17cf443777e161b02f0cd74872f3817d","source":{"kind":"arxiv","id":"quant-ph/0504218","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0504218","created_at":"2026-07-04T14:50:19Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0504218v3","created_at":"2026-07-04T14:50:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0504218","created_at":"2026-07-04T14:50:19Z"},{"alias_kind":"pith_short_12","alias_value":"KOYUNJROCLO3","created_at":"2026-07-04T14:50:19Z"},{"alias_kind":"pith_short_16","alias_value":"KOYUNJROCLO3RBBN","created_at":"2026-07-04T14:50:19Z"},{"alias_kind":"pith_short_8","alias_value":"KOYUNJRO","created_at":"2026-07-04T14:50:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2005:KOYUNJROCLO3RBBNYXEZYNVILU","target":"record","payload":{"canonical_record":{"source":{"id":"quant-ph/0504218","kind":"arxiv","version":3},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2005-04-28T20:12:44Z","cross_cats_sorted":[],"title_canon_sha256":"5bea61ef4d65e413ec08cf4e0e030b49d9e7073662c998aa5331ac85f51c81b5","abstract_canon_sha256":"5a9f2e581de05a68e9e25086087dad7bd1aa41b3b69ee69b2995ee17f8b894c6"},"schema_version":"1.0"},"canonical_sha256":"53b146a62e12ddb8842dc5c99c36a85d17cf443777e161b02f0cd74872f3817d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:50:19.005577Z","signature_b64":"/upYTmi9Y9/jlJ8cETgpVSr9cB4/fRC+qFfORvvumI23dlIxzEsjV06qCzGYe3BRrbiLeTJjlOtfp7mospgWAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"53b146a62e12ddb8842dc5c99c36a85d17cf443777e161b02f0cd74872f3817d","last_reissued_at":"2026-07-04T14:50:19.005199Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:50:19.005199Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"quant-ph/0504218","source_version":3,"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-04T14:50:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kbp6EtdsnWiDl11tHkBIpbpp+wpPplUyz7aFxth02OCtKaLL/mU+7xfJPIySjVkZZ8i2CaCYDKvNMAReNR6PDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T18:56:48.103106Z"},"content_sha256":"9ede208167cc1cb0d964c36f876d7f90f91afd152064507e2b38907ade9f5f31","schema_version":"1.0","event_id":"sha256:9ede208167cc1cb0d964c36f876d7f90f91afd152064507e2b38907ade9f5f31"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2005:KOYUNJROCLO3RBBNYXEZYNVILU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum accuracy threshold for concatenated distance-3 codes","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Daniel Gottesman, John Preskill, Panos Aliferis","submitted_at":"2005-04-28T20:12:44Z","abstract_excerpt":"We prove a new version of the quantum threshold theorem that applies to concatenation of a quantum code that corrects only one error, and we use this theorem to derive a rigorous lower bound on the quantum accuracy threshold epsilon_0. Our proof also applies to concatenation of higher-distance codes, and to noise models that allow faults to be correlated in space and in time. The proof uses new criteria for assessing the accuracy of fault-tolerant circuits, which are particularly conducive to the inductive analysis of recursive simulations. Our lower bound on the threshold, epsilon_0 > 2.73 \\t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0504218","kind":"arxiv","version":3},"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/quant-ph/0504218/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-04T14:50:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vx//MWDCfr+qPdeMyBUwp736/nXVQcGPnpxn70i8WTfXYoyi75640T2nTsrnFca0qTLknr/cqqvT3H4m5mGRDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T18:56:48.103608Z"},"content_sha256":"204a091762bf02536cb6b143c140ae5d584922e4f513a73672260085a9910fb6","schema_version":"1.0","event_id":"sha256:204a091762bf02536cb6b143c140ae5d584922e4f513a73672260085a9910fb6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KOYUNJROCLO3RBBNYXEZYNVILU/bundle.json","state_url":"https://pith.science/pith/KOYUNJROCLO3RBBNYXEZYNVILU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KOYUNJROCLO3RBBNYXEZYNVILU/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-03T18:56:48Z","links":{"resolver":"https://pith.science/pith/KOYUNJROCLO3RBBNYXEZYNVILU","bundle":"https://pith.science/pith/KOYUNJROCLO3RBBNYXEZYNVILU/bundle.json","state":"https://pith.science/pith/KOYUNJROCLO3RBBNYXEZYNVILU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KOYUNJROCLO3RBBNYXEZYNVILU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2005:KOYUNJROCLO3RBBNYXEZYNVILU","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":"5a9f2e581de05a68e9e25086087dad7bd1aa41b3b69ee69b2995ee17f8b894c6","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2005-04-28T20:12:44Z","title_canon_sha256":"5bea61ef4d65e413ec08cf4e0e030b49d9e7073662c998aa5331ac85f51c81b5"},"schema_version":"1.0","source":{"id":"quant-ph/0504218","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0504218","created_at":"2026-07-04T14:50:19Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0504218v3","created_at":"2026-07-04T14:50:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0504218","created_at":"2026-07-04T14:50:19Z"},{"alias_kind":"pith_short_12","alias_value":"KOYUNJROCLO3","created_at":"2026-07-04T14:50:19Z"},{"alias_kind":"pith_short_16","alias_value":"KOYUNJROCLO3RBBN","created_at":"2026-07-04T14:50:19Z"},{"alias_kind":"pith_short_8","alias_value":"KOYUNJRO","created_at":"2026-07-04T14:50:19Z"}],"graph_snapshots":[{"event_id":"sha256:204a091762bf02536cb6b143c140ae5d584922e4f513a73672260085a9910fb6","target":"graph","created_at":"2026-07-04T14:50:19Z","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/quant-ph/0504218/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We prove a new version of the quantum threshold theorem that applies to concatenation of a quantum code that corrects only one error, and we use this theorem to derive a rigorous lower bound on the quantum accuracy threshold epsilon_0. Our proof also applies to concatenation of higher-distance codes, and to noise models that allow faults to be correlated in space and in time. The proof uses new criteria for assessing the accuracy of fault-tolerant circuits, which are particularly conducive to the inductive analysis of recursive simulations. Our lower bound on the threshold, epsilon_0 > 2.73 \\t","authors_text":"Daniel Gottesman, John Preskill, Panos Aliferis","cross_cats":[],"headline":"","license":"","primary_cat":"quant-ph","submitted_at":"2005-04-28T20:12:44Z","title":"Quantum accuracy threshold for concatenated distance-3 codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0504218","kind":"arxiv","version":3},"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:9ede208167cc1cb0d964c36f876d7f90f91afd152064507e2b38907ade9f5f31","target":"record","created_at":"2026-07-04T14:50:19Z","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":"5a9f2e581de05a68e9e25086087dad7bd1aa41b3b69ee69b2995ee17f8b894c6","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2005-04-28T20:12:44Z","title_canon_sha256":"5bea61ef4d65e413ec08cf4e0e030b49d9e7073662c998aa5331ac85f51c81b5"},"schema_version":"1.0","source":{"id":"quant-ph/0504218","kind":"arxiv","version":3}},"canonical_sha256":"53b146a62e12ddb8842dc5c99c36a85d17cf443777e161b02f0cd74872f3817d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"53b146a62e12ddb8842dc5c99c36a85d17cf443777e161b02f0cd74872f3817d","first_computed_at":"2026-07-04T14:50:19.005199Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:50:19.005199Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/upYTmi9Y9/jlJ8cETgpVSr9cB4/fRC+qFfORvvumI23dlIxzEsjV06qCzGYe3BRrbiLeTJjlOtfp7mospgWAQ==","signature_status":"signed_v1","signed_at":"2026-07-04T14:50:19.005577Z","signed_message":"canonical_sha256_bytes"},"source_id":"quant-ph/0504218","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9ede208167cc1cb0d964c36f876d7f90f91afd152064507e2b38907ade9f5f31","sha256:204a091762bf02536cb6b143c140ae5d584922e4f513a73672260085a9910fb6"],"state_sha256":"c81da742675d246e3d4ad492c58921b45f1e3abbe5aac17acef217b1fcff3f78"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0LDTIGXKH38CLbYrtA+k6jqSdrvG6+v2tFpBCLCAgIsSaRrNr7SfhorfCg9dxTTQdHWgwQeNlNHh9CHAzuKKCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T18:56:48.108436Z","bundle_sha256":"a8bcf3853001962088e94bead0c3a2d4a693ba94de9dd425538af3a51f0797c2"}}