{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:1996:MGUEDPU6KPQGJOE3I25NJGUIH5","short_pith_number":"pith:MGUEDPU6","canonical_record":{"source":{"id":"quant-ph/9610011","kind":"arxiv","version":3},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"1996-10-08T19:50:12Z","cross_cats_sorted":[],"title_canon_sha256":"91573baea40b5deb0720d510b1de1efd860f68eac50031b15e1c0fa942c8456f","abstract_canon_sha256":"53a54b7e504d293dbae3499a28fbb2ea8ed96b0b0264464816e4b2286bd9efbe"},"schema_version":"1.0"},"canonical_sha256":"61a841be9e53e064b89b46bad49a883f6bfdbd3cb66e0873debd09a12f739fd5","source":{"kind":"arxiv","id":"quant-ph/9610011","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/9610011","created_at":"2026-07-04T15:07:57Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/9610011v3","created_at":"2026-07-04T15:07:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/9610011","created_at":"2026-07-04T15:07:57Z"},{"alias_kind":"pith_short_12","alias_value":"MGUEDPU6KPQG","created_at":"2026-07-04T15:07:57Z"},{"alias_kind":"pith_short_16","alias_value":"MGUEDPU6KPQGJOE3","created_at":"2026-07-04T15:07:57Z"},{"alias_kind":"pith_short_8","alias_value":"MGUEDPU6","created_at":"2026-07-04T15:07:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:1996:MGUEDPU6KPQGJOE3I25NJGUIH5","target":"record","payload":{"canonical_record":{"source":{"id":"quant-ph/9610011","kind":"arxiv","version":3},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"1996-10-08T19:50:12Z","cross_cats_sorted":[],"title_canon_sha256":"91573baea40b5deb0720d510b1de1efd860f68eac50031b15e1c0fa942c8456f","abstract_canon_sha256":"53a54b7e504d293dbae3499a28fbb2ea8ed96b0b0264464816e4b2286bd9efbe"},"schema_version":"1.0"},"canonical_sha256":"61a841be9e53e064b89b46bad49a883f6bfdbd3cb66e0873debd09a12f739fd5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:07:57.889296Z","signature_b64":"8rUad/ymtN2apHDRcUAvrmqjO8/Ki72BjKfm2nin4G18DjFWbjLAg0ly2uFfuD0yM7/McP94VlyCNxyXsQrdDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61a841be9e53e064b89b46bad49a883f6bfdbd3cb66e0873debd09a12f739fd5","last_reissued_at":"2026-07-04T15:07:57.888905Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:07:57.888905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"quant-ph/9610011","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-04T15:07:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t+4+Ts0AG7TamNw25sMjrn1RmMK6DuiTkBZmG3dPfFnfx24UGRLn+FgZxSZbGjyRh5n8/u+eYex5TQeXvVLpCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T18:17:02.078179Z"},"content_sha256":"edcc66a62b239b1c5df8c23e6708e5499db6b3c2945162f4a0f46a27eaf4b77f","schema_version":"1.0","event_id":"sha256:edcc66a62b239b1c5df8c23e6708e5499db6b3c2945162f4a0f46a27eaf4b77f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:1996:MGUEDPU6KPQGJOE3I25NJGUIH5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Threshold Accuracy for Quantum Computation","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"E. Knill, R. Laflamme, W. Zurek","submitted_at":"1996-10-08T19:50:12Z","abstract_excerpt":"We have previously (quant-ph/9608012) shown that for quantum memories and quantum communication, a state can be transmitted over arbitrary distances with error $\\epsilon$ provided each gate has error at most $c\\epsilon$. We discuss a similar concatenation technique which can be used with fault tolerant networks to achieve any desired accuracy when computing with classical initial states, provided a minimum gate accuracy can be achieved. The technique works under realistic assumptions on operational errors. These assumptions are more general than the stochastic error heuristic used in other wor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/9610011","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/9610011/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-04T15:07:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UdXxaurRpKLu3p9YKL1zAJsH9z2su72oO4rR7qBXrsHCBU7uj5L+6M4q2104xVgrASct/s051MJvAd0Zmd9QDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T18:17:02.079249Z"},"content_sha256":"65b15da9b65d65bab4aa2e73c7f89764600d62c21d501a080284348ee5faa8ae","schema_version":"1.0","event_id":"sha256:65b15da9b65d65bab4aa2e73c7f89764600d62c21d501a080284348ee5faa8ae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MGUEDPU6KPQGJOE3I25NJGUIH5/bundle.json","state_url":"https://pith.science/pith/MGUEDPU6KPQGJOE3I25NJGUIH5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MGUEDPU6KPQGJOE3I25NJGUIH5/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:17:02Z","links":{"resolver":"https://pith.science/pith/MGUEDPU6KPQGJOE3I25NJGUIH5","bundle":"https://pith.science/pith/MGUEDPU6KPQGJOE3I25NJGUIH5/bundle.json","state":"https://pith.science/pith/MGUEDPU6KPQGJOE3I25NJGUIH5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MGUEDPU6KPQGJOE3I25NJGUIH5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:1996:MGUEDPU6KPQGJOE3I25NJGUIH5","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":"53a54b7e504d293dbae3499a28fbb2ea8ed96b0b0264464816e4b2286bd9efbe","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"1996-10-08T19:50:12Z","title_canon_sha256":"91573baea40b5deb0720d510b1de1efd860f68eac50031b15e1c0fa942c8456f"},"schema_version":"1.0","source":{"id":"quant-ph/9610011","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/9610011","created_at":"2026-07-04T15:07:57Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/9610011v3","created_at":"2026-07-04T15:07:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/9610011","created_at":"2026-07-04T15:07:57Z"},{"alias_kind":"pith_short_12","alias_value":"MGUEDPU6KPQG","created_at":"2026-07-04T15:07:57Z"},{"alias_kind":"pith_short_16","alias_value":"MGUEDPU6KPQGJOE3","created_at":"2026-07-04T15:07:57Z"},{"alias_kind":"pith_short_8","alias_value":"MGUEDPU6","created_at":"2026-07-04T15:07:57Z"}],"graph_snapshots":[{"event_id":"sha256:65b15da9b65d65bab4aa2e73c7f89764600d62c21d501a080284348ee5faa8ae","target":"graph","created_at":"2026-07-04T15:07:57Z","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/9610011/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We have previously (quant-ph/9608012) shown that for quantum memories and quantum communication, a state can be transmitted over arbitrary distances with error $\\epsilon$ provided each gate has error at most $c\\epsilon$. We discuss a similar concatenation technique which can be used with fault tolerant networks to achieve any desired accuracy when computing with classical initial states, provided a minimum gate accuracy can be achieved. The technique works under realistic assumptions on operational errors. These assumptions are more general than the stochastic error heuristic used in other wor","authors_text":"E. Knill, R. Laflamme, W. Zurek","cross_cats":[],"headline":"","license":"","primary_cat":"quant-ph","submitted_at":"1996-10-08T19:50:12Z","title":"Threshold Accuracy for Quantum Computation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/9610011","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:edcc66a62b239b1c5df8c23e6708e5499db6b3c2945162f4a0f46a27eaf4b77f","target":"record","created_at":"2026-07-04T15:07:57Z","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":"53a54b7e504d293dbae3499a28fbb2ea8ed96b0b0264464816e4b2286bd9efbe","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"1996-10-08T19:50:12Z","title_canon_sha256":"91573baea40b5deb0720d510b1de1efd860f68eac50031b15e1c0fa942c8456f"},"schema_version":"1.0","source":{"id":"quant-ph/9610011","kind":"arxiv","version":3}},"canonical_sha256":"61a841be9e53e064b89b46bad49a883f6bfdbd3cb66e0873debd09a12f739fd5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"61a841be9e53e064b89b46bad49a883f6bfdbd3cb66e0873debd09a12f739fd5","first_computed_at":"2026-07-04T15:07:57.888905Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:07:57.888905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8rUad/ymtN2apHDRcUAvrmqjO8/Ki72BjKfm2nin4G18DjFWbjLAg0ly2uFfuD0yM7/McP94VlyCNxyXsQrdDA==","signature_status":"signed_v1","signed_at":"2026-07-04T15:07:57.889296Z","signed_message":"canonical_sha256_bytes"},"source_id":"quant-ph/9610011","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:edcc66a62b239b1c5df8c23e6708e5499db6b3c2945162f4a0f46a27eaf4b77f","sha256:65b15da9b65d65bab4aa2e73c7f89764600d62c21d501a080284348ee5faa8ae"],"state_sha256":"80ad3586136e32cb64cd5494060642bd041559fd6be83e923df8547a3e31a5f7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HgXP773NPQCh3ysk9CrqfdKMcGkxwcQuOmcceGJeyTqgi/fKvWIwJTapa8cFMPUBTDDh2wK/3PukWlS772vcCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T18:17:02.086734Z","bundle_sha256":"83f6e4da09d2902a96cad163239e180172c436402a1e45c0c769bf45cfb5e85f"}}