{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1999:6CFWGOK5Y6OO3SHWW54EVNGCZR","short_pith_number":"pith:6CFWGOK5","schema_version":"1.0","canonical_sha256":"f08b63395dc79cedc8f6b7784ab4c2cc5c01430fc3b7b4bde7f30f6d0d99d615","source":{"kind":"arxiv","id":"quant-ph/9906129","version":1},"attestation_state":"computed","paper":{"title":"Fault-Tolerant Quantum Computation With Constant Error Rate","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Dorit Aharonov, Michael Ben-Or","submitted_at":"1999-06-30T15:06:18Z","abstract_excerpt":"This paper proves the threshold result, which asserts that quantum computation can be made robust against errors and inaccuracies, when the error rate, $\\eta$, is smaller than a constant threshold, $\\eta_c$. The result holds for a very general, not necessarily probabilistic noise model, for quantum particles with any number of states, and is also generalized to one dimensional quantum computers with only nearest neighbor interactions. No measurements, or classical operations, are required during the quantum computation. The proceeding version was very succinct, and here we fill all the missing"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"quant-ph/9906129","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"1999-06-30T15:06:18Z","cross_cats_sorted":[],"title_canon_sha256":"90e11a6ea2930f2b4c3bfcf39ae522b76399de53ee9868e11b52423d5b4f72f0","abstract_canon_sha256":"6fadcb69f823f771c99055306e0ceaa220c5371e079b03f7402bee43bd2fbd3a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:47:27.041311Z","signature_b64":"swgIAin4fgQp6FHwcolY3nF+L877gc3pRCQDgTreb6lMLiWSgKiggbLsCJTY9EWkXK1Ys6Cx7n6/V7EDgj8YAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f08b63395dc79cedc8f6b7784ab4c2cc5c01430fc3b7b4bde7f30f6d0d99d615","last_reissued_at":"2026-07-04T14:47:27.040954Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:47:27.040954Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fault-Tolerant Quantum Computation With Constant Error Rate","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Dorit Aharonov, Michael Ben-Or","submitted_at":"1999-06-30T15:06:18Z","abstract_excerpt":"This paper proves the threshold result, which asserts that quantum computation can be made robust against errors and inaccuracies, when the error rate, $\\eta$, is smaller than a constant threshold, $\\eta_c$. The result holds for a very general, not necessarily probabilistic noise model, for quantum particles with any number of states, and is also generalized to one dimensional quantum computers with only nearest neighbor interactions. No measurements, or classical operations, are required during the quantum computation. The proceeding version was very succinct, and here we fill all the missing"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/9906129","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/quant-ph/9906129/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/9906129","created_at":"2026-07-04T14:47:27.041010+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/9906129v1","created_at":"2026-07-04T14:47:27.041010+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/9906129","created_at":"2026-07-04T14:47:27.041010+00:00"},{"alias_kind":"pith_short_12","alias_value":"6CFWGOK5Y6OO","created_at":"2026-07-04T14:47:27.041010+00:00"},{"alias_kind":"pith_short_16","alias_value":"6CFWGOK5Y6OO3SHW","created_at":"2026-07-04T14:47:27.041010+00:00"},{"alias_kind":"pith_short_8","alias_value":"6CFWGOK5","created_at":"2026-07-04T14:47:27.041010+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":8,"internal_anchor_count":8,"sample":[{"citing_arxiv_id":"2606.26090","citing_title":"Fast mixing of all-to-all quantum systems at high temperatures","ref_index":59,"is_internal_anchor":true},{"citing_arxiv_id":"2606.17709","citing_title":"Optimizing bias-tailored quantum error correction beyond code-capacity noise","ref_index":6,"is_internal_anchor":true},{"citing_arxiv_id":"2606.04070","citing_title":"Quantum circuit partition as a maze: emerging percolation transition via path finding","ref_index":37,"is_internal_anchor":true},{"citing_arxiv_id":"2605.28536","citing_title":"Trapped-Ion Multiqubit Gates are Compatible with Scalable Quantum Error Correction","ref_index":10,"is_internal_anchor":true},{"citing_arxiv_id":"2605.21898","citing_title":"Concatenating Algebraic Codes over High-Rate Quantum LDPC Codes","ref_index":1,"is_internal_anchor":true},{"citing_arxiv_id":"2601.15945","citing_title":"Renormalization Treatment of IR and UV Cutoffs in Waveguide QED and Implications to Numerical Model Simulation","ref_index":12,"is_internal_anchor":true},{"citing_arxiv_id":"2605.20346","citing_title":"Forced Gap Post-Selection for Quantum LDPC Codes and their Operations","ref_index":2,"is_internal_anchor":true},{"citing_arxiv_id":"2602.20238","citing_title":"Proof of a finite threshold for the union-find decoder","ref_index":10,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6CFWGOK5Y6OO3SHWW54EVNGCZR","json":"https://pith.science/pith/6CFWGOK5Y6OO3SHWW54EVNGCZR.json","graph_json":"https://pith.science/api/pith-number/6CFWGOK5Y6OO3SHWW54EVNGCZR/graph.json","events_json":"https://pith.science/api/pith-number/6CFWGOK5Y6OO3SHWW54EVNGCZR/events.json","paper":"https://pith.science/paper/6CFWGOK5"},"agent_actions":{"view_html":"https://pith.science/pith/6CFWGOK5Y6OO3SHWW54EVNGCZR","download_json":"https://pith.science/pith/6CFWGOK5Y6OO3SHWW54EVNGCZR.json","view_paper":"https://pith.science/paper/6CFWGOK5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/9906129&json=true","fetch_graph":"https://pith.science/api/pith-number/6CFWGOK5Y6OO3SHWW54EVNGCZR/graph.json","fetch_events":"https://pith.science/api/pith-number/6CFWGOK5Y6OO3SHWW54EVNGCZR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6CFWGOK5Y6OO3SHWW54EVNGCZR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6CFWGOK5Y6OO3SHWW54EVNGCZR/action/storage_attestation","attest_author":"https://pith.science/pith/6CFWGOK5Y6OO3SHWW54EVNGCZR/action/author_attestation","sign_citation":"https://pith.science/pith/6CFWGOK5Y6OO3SHWW54EVNGCZR/action/citation_signature","submit_replication":"https://pith.science/pith/6CFWGOK5Y6OO3SHWW54EVNGCZR/action/replication_record"}},"created_at":"2026-07-04T14:47:27.041010+00:00","updated_at":"2026-07-04T14:47:27.041010+00:00"}