{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1996:EKSOFWW77B4CXZIDF6BXIKFHUO","short_pith_number":"pith:EKSOFWW7","schema_version":"1.0","canonical_sha256":"22a4e2dadff8782be5032f837428a7a3b79cf9970b92847c3c6013d5f085f5ea","source":{"kind":"arxiv","id":"quant-ph/9605011","version":2},"attestation_state":"computed","paper":{"title":"Fault-tolerant quantum computation","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Peter W. Shor (AT&T Research)","submitted_at":"1996-05-13T14:29:00Z","abstract_excerpt":"Recently, it was realized that use of the properties of quantum mechanics might speed up certain computations dramatically. Interest in quantum computation has since been growing. One of the main difficulties of realizing quantum computation is that decoherence tends to destroy the information in a superposition of states in a quantum computer, thus making long computations impossible. A futher difficulty is that inaccuracies in quantum state transformations throughout the computation accumulate, rendering the output of long computations unreliable. It was previously known that a quantum circu"},"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/9605011","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"1996-05-13T14:29:00Z","cross_cats_sorted":[],"title_canon_sha256":"933cfbc8395212977ad44dcc2ec63b07d8faa5d9ba1b8a7b30059f268e4a3de4","abstract_canon_sha256":"e120280c3541aa0880cca7709ba3492c2ee634434b5697e5170e5336952b1479"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:08:20.081415Z","signature_b64":"XyEI38ZgMY1x+/IC47a5NfxilL+PIU+SJj/gtJtBK4rE4T4N7GLNu8wsd4X/DaxZwptYx5EiJHeKAxgzMNKuAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"22a4e2dadff8782be5032f837428a7a3b79cf9970b92847c3c6013d5f085f5ea","last_reissued_at":"2026-07-04T15:08:20.081040Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:08:20.081040Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fault-tolerant quantum computation","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Peter W. Shor (AT&T Research)","submitted_at":"1996-05-13T14:29:00Z","abstract_excerpt":"Recently, it was realized that use of the properties of quantum mechanics might speed up certain computations dramatically. Interest in quantum computation has since been growing. One of the main difficulties of realizing quantum computation is that decoherence tends to destroy the information in a superposition of states in a quantum computer, thus making long computations impossible. A futher difficulty is that inaccuracies in quantum state transformations throughout the computation accumulate, rendering the output of long computations unreliable. It was previously known that a quantum circu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/9605011","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/quant-ph/9605011/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/9605011","created_at":"2026-07-04T15:08:20.081098+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/9605011v2","created_at":"2026-07-04T15:08:20.081098+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/9605011","created_at":"2026-07-04T15:08:20.081098+00:00"},{"alias_kind":"pith_short_12","alias_value":"EKSOFWW77B4C","created_at":"2026-07-04T15:08:20.081098+00:00"},{"alias_kind":"pith_short_16","alias_value":"EKSOFWW77B4CXZID","created_at":"2026-07-04T15:08:20.081098+00:00"},{"alias_kind":"pith_short_8","alias_value":"EKSOFWW7","created_at":"2026-07-04T15:08:20.081098+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2606.06598","citing_title":"A superconducting surface-code processor with lattice-surgery logical operations","ref_index":23,"is_internal_anchor":true},{"citing_arxiv_id":"2605.26522","citing_title":"A Resource Comparison of Logical T-State Preparation","ref_index":4,"is_internal_anchor":true},{"citing_arxiv_id":"quant-ph/9807006","citing_title":"The Heisenberg Representation of Quantum Computers","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2604.18734","citing_title":"Learning error suppression strategies for dynamic quantum circuits","ref_index":5,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EKSOFWW77B4CXZIDF6BXIKFHUO","json":"https://pith.science/pith/EKSOFWW77B4CXZIDF6BXIKFHUO.json","graph_json":"https://pith.science/api/pith-number/EKSOFWW77B4CXZIDF6BXIKFHUO/graph.json","events_json":"https://pith.science/api/pith-number/EKSOFWW77B4CXZIDF6BXIKFHUO/events.json","paper":"https://pith.science/paper/EKSOFWW7"},"agent_actions":{"view_html":"https://pith.science/pith/EKSOFWW77B4CXZIDF6BXIKFHUO","download_json":"https://pith.science/pith/EKSOFWW77B4CXZIDF6BXIKFHUO.json","view_paper":"https://pith.science/paper/EKSOFWW7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/9605011&json=true","fetch_graph":"https://pith.science/api/pith-number/EKSOFWW77B4CXZIDF6BXIKFHUO/graph.json","fetch_events":"https://pith.science/api/pith-number/EKSOFWW77B4CXZIDF6BXIKFHUO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EKSOFWW77B4CXZIDF6BXIKFHUO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EKSOFWW77B4CXZIDF6BXIKFHUO/action/storage_attestation","attest_author":"https://pith.science/pith/EKSOFWW77B4CXZIDF6BXIKFHUO/action/author_attestation","sign_citation":"https://pith.science/pith/EKSOFWW77B4CXZIDF6BXIKFHUO/action/citation_signature","submit_replication":"https://pith.science/pith/EKSOFWW77B4CXZIDF6BXIKFHUO/action/replication_record"}},"created_at":"2026-07-04T15:08:20.081098+00:00","updated_at":"2026-07-04T15:08:20.081098+00:00"}