{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:1997:BBRCBQ6LM4AU7U6GJWHD77H6QQ","short_pith_number":"pith:BBRCBQ6L","canonical_record":{"source":{"id":"quant-ph/9708021","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"1997-08-12T13:12:16Z","cross_cats_sorted":[],"title_canon_sha256":"19f492090d4a60b1a0ef84e4623e43359c02538e0ecafd65ec339b27a9aa187a","abstract_canon_sha256":"5c93ff7bb69044743bcc38d42f223f3f0c4e34ddf91d319d4e5b0fca1c04a9e7"},"schema_version":"1.0"},"canonical_sha256":"086220c3cb67014fd3c64d8e3ffcfe843176c0db0f2eb21788d3fd2652c64bf6","source":{"kind":"arxiv","id":"quant-ph/9708021","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/9708021","created_at":"2026-05-18T01:37:53Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/9708021v1","created_at":"2026-05-18T01:37:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/9708021","created_at":"2026-05-18T01:37:53Z"},{"alias_kind":"pith_short_12","alias_value":"BBRCBQ6LM4AU","created_at":"2026-05-18T12:25:48Z"},{"alias_kind":"pith_short_16","alias_value":"BBRCBQ6LM4AU7U6G","created_at":"2026-05-18T12:25:48Z"},{"alias_kind":"pith_short_8","alias_value":"BBRCBQ6L","created_at":"2026-05-18T12:25:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:1997:BBRCBQ6LM4AU7U6GJWHD77H6QQ","target":"record","payload":{"canonical_record":{"source":{"id":"quant-ph/9708021","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"1997-08-12T13:12:16Z","cross_cats_sorted":[],"title_canon_sha256":"19f492090d4a60b1a0ef84e4623e43359c02538e0ecafd65ec339b27a9aa187a","abstract_canon_sha256":"5c93ff7bb69044743bcc38d42f223f3f0c4e34ddf91d319d4e5b0fca1c04a9e7"},"schema_version":"1.0"},"canonical_sha256":"086220c3cb67014fd3c64d8e3ffcfe843176c0db0f2eb21788d3fd2652c64bf6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:53.166264Z","signature_b64":"qr2rpnYpFUevtXu95Wh7wEls++YVY2ZOizQ4GHY2Bcp0oLhGp4q5ZtcP8q5Cm9/0deouOa6amc3FeC2hIzfqAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"086220c3cb67014fd3c64d8e3ffcfe843176c0db0f2eb21788d3fd2652c64bf6","last_reissued_at":"2026-05-18T01:37:53.165662Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:53.165662Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"quant-ph/9708021","source_version":1,"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-18T01:37:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GSYYoSzA1vnutjRdXG6n3zsyDoFRDAcjCBIjBrkcFfJPiRDuY9a6vskUs64K4hevuN0QcJGkvIhr3RLxOu0tBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T19:22:30.160580Z"},"content_sha256":"1fbe98626affb5fabd4c73b35059d80bf31d95963c61fa2f3eb6fbc2834b944c","schema_version":"1.0","event_id":"sha256:1fbe98626affb5fabd4c73b35059d80bf31d95963c61fa2f3eb6fbc2834b944c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:1997:BBRCBQ6LM4AU7U6GJWHD77H6QQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Space, time, parallelism and noise requirements for reliable quantum computing","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew Steane (Clarendon Laboratory, Oxford University)","submitted_at":"1997-08-12T13:12:16Z","abstract_excerpt":"Quantum error correction methods use processing power to combat noise. The noise level which can be tolerated in a fault-tolerant method is therefore a function of the computational resources available, especially the size of computer and degree of parallelism. I present an analysis of error correction with block codes, made fault-tolerant through the use of prepared ancilla blocks. The preparation and verification of the ancillas is described in detail. It is shown that the ancillas need only be verified against a small set of errors. This, combined with previously known advantages, makes thi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/9708021","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":""},"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-18T01:37:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SRVnZHXX7fFEwxrgsHu0hNwmbHm1oyOSk53GX2uFM1S+QtIzftrAVkHtg+tEGlVeQJsUgMQuW2D3bAa9Bbb7Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T19:22:30.161205Z"},"content_sha256":"546b0a5989c13da6436c6b2e3c5d8057ba89d5416c55a0ac9836870df2360db3","schema_version":"1.0","event_id":"sha256:546b0a5989c13da6436c6b2e3c5d8057ba89d5416c55a0ac9836870df2360db3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BBRCBQ6LM4AU7U6GJWHD77H6QQ/bundle.json","state_url":"https://pith.science/pith/BBRCBQ6LM4AU7U6GJWHD77H6QQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BBRCBQ6LM4AU7U6GJWHD77H6QQ/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-28T19:22:30Z","links":{"resolver":"https://pith.science/pith/BBRCBQ6LM4AU7U6GJWHD77H6QQ","bundle":"https://pith.science/pith/BBRCBQ6LM4AU7U6GJWHD77H6QQ/bundle.json","state":"https://pith.science/pith/BBRCBQ6LM4AU7U6GJWHD77H6QQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BBRCBQ6LM4AU7U6GJWHD77H6QQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:1997:BBRCBQ6LM4AU7U6GJWHD77H6QQ","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":"5c93ff7bb69044743bcc38d42f223f3f0c4e34ddf91d319d4e5b0fca1c04a9e7","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"1997-08-12T13:12:16Z","title_canon_sha256":"19f492090d4a60b1a0ef84e4623e43359c02538e0ecafd65ec339b27a9aa187a"},"schema_version":"1.0","source":{"id":"quant-ph/9708021","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/9708021","created_at":"2026-05-18T01:37:53Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/9708021v1","created_at":"2026-05-18T01:37:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/9708021","created_at":"2026-05-18T01:37:53Z"},{"alias_kind":"pith_short_12","alias_value":"BBRCBQ6LM4AU","created_at":"2026-05-18T12:25:48Z"},{"alias_kind":"pith_short_16","alias_value":"BBRCBQ6LM4AU7U6G","created_at":"2026-05-18T12:25:48Z"},{"alias_kind":"pith_short_8","alias_value":"BBRCBQ6L","created_at":"2026-05-18T12:25:48Z"}],"graph_snapshots":[{"event_id":"sha256:546b0a5989c13da6436c6b2e3c5d8057ba89d5416c55a0ac9836870df2360db3","target":"graph","created_at":"2026-05-18T01:37:53Z","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":"Quantum error correction methods use processing power to combat noise. The noise level which can be tolerated in a fault-tolerant method is therefore a function of the computational resources available, especially the size of computer and degree of parallelism. I present an analysis of error correction with block codes, made fault-tolerant through the use of prepared ancilla blocks. The preparation and verification of the ancillas is described in detail. It is shown that the ancillas need only be verified against a small set of errors. This, combined with previously known advantages, makes thi","authors_text":"Andrew Steane (Clarendon Laboratory, Oxford University)","cross_cats":[],"headline":"","license":"","primary_cat":"quant-ph","submitted_at":"1997-08-12T13:12:16Z","title":"Space, time, parallelism and noise requirements for reliable quantum computing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/9708021","kind":"arxiv","version":1},"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:1fbe98626affb5fabd4c73b35059d80bf31d95963c61fa2f3eb6fbc2834b944c","target":"record","created_at":"2026-05-18T01:37:53Z","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":"5c93ff7bb69044743bcc38d42f223f3f0c4e34ddf91d319d4e5b0fca1c04a9e7","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"1997-08-12T13:12:16Z","title_canon_sha256":"19f492090d4a60b1a0ef84e4623e43359c02538e0ecafd65ec339b27a9aa187a"},"schema_version":"1.0","source":{"id":"quant-ph/9708021","kind":"arxiv","version":1}},"canonical_sha256":"086220c3cb67014fd3c64d8e3ffcfe843176c0db0f2eb21788d3fd2652c64bf6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"086220c3cb67014fd3c64d8e3ffcfe843176c0db0f2eb21788d3fd2652c64bf6","first_computed_at":"2026-05-18T01:37:53.165662Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:53.165662Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qr2rpnYpFUevtXu95Wh7wEls++YVY2ZOizQ4GHY2Bcp0oLhGp4q5ZtcP8q5Cm9/0deouOa6amc3FeC2hIzfqAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:53.166264Z","signed_message":"canonical_sha256_bytes"},"source_id":"quant-ph/9708021","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1fbe98626affb5fabd4c73b35059d80bf31d95963c61fa2f3eb6fbc2834b944c","sha256:546b0a5989c13da6436c6b2e3c5d8057ba89d5416c55a0ac9836870df2360db3"],"state_sha256":"3961667753c5c2d84307bb23f8f0d7c9e57f0ce69cfc9d079ed8f09e36789305"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XIUlzIPzXY5GjmQ5MdWA04qnTEswQnHyuYyi5ig7Ywy4L2OMc1sjSZzzSe5tvow0PZ1ugK3WygXeRIvMrMwaAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T19:22:30.164354Z","bundle_sha256":"013b214c459dcf21fae6b24720c09e36d95995a109e958d6b60183b260eb477a"}}