{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:5XAAEFAGI7B2CD5IWGTTGZ7KSH","short_pith_number":"pith:5XAAEFAG","canonical_record":{"source":{"id":"1008.1369","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-08-07T22:18:41Z","cross_cats_sorted":[],"title_canon_sha256":"f3c3d6840172316490cf72d66ed4d9fd07d0d8ce2bed1ec2ee3201baece9f79f","abstract_canon_sha256":"2d0d87e5c695f9a8b4fcaa4c2b78b18b3f7c5334147b3bda98334dbf1c73a956"},"schema_version":"1.0"},"canonical_sha256":"edc002140647c3a10fa8b1a73367ea91d3e3621e721bc97560257cb43d618357","source":{"kind":"arxiv","id":"1008.1369","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.1369","created_at":"2026-05-18T03:23:47Z"},{"alias_kind":"arxiv_version","alias_value":"1008.1369v1","created_at":"2026-05-18T03:23:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.1369","created_at":"2026-05-18T03:23:47Z"},{"alias_kind":"pith_short_12","alias_value":"5XAAEFAGI7B2","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"5XAAEFAGI7B2CD5I","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"5XAAEFAG","created_at":"2026-05-18T12:26:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:5XAAEFAGI7B2CD5IWGTTGZ7KSH","target":"record","payload":{"canonical_record":{"source":{"id":"1008.1369","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-08-07T22:18:41Z","cross_cats_sorted":[],"title_canon_sha256":"f3c3d6840172316490cf72d66ed4d9fd07d0d8ce2bed1ec2ee3201baece9f79f","abstract_canon_sha256":"2d0d87e5c695f9a8b4fcaa4c2b78b18b3f7c5334147b3bda98334dbf1c73a956"},"schema_version":"1.0"},"canonical_sha256":"edc002140647c3a10fa8b1a73367ea91d3e3621e721bc97560257cb43d618357","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:23:47.948239Z","signature_b64":"ICG8eKeo3AZaZUcFWw/zOz71DaOZc39SsLSFuIYZUjVd/1cE4CQj8vZQYMjWZ/ZTuarCh+XBoJ2yVPoI7jF+CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"edc002140647c3a10fa8b1a73367ea91d3e3621e721bc97560257cb43d618357","last_reissued_at":"2026-05-18T03:23:47.947716Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:23:47.947716Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1008.1369","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-18T03:23:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DsuvwRQOqxETcFs13yYthDwwRJeTgruep1LxmAZZkAWnUq2koEoNT1oLoPoX3vy+XFmVd+zW91BvVRQTu2suDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:28:38.930413Z"},"content_sha256":"fcb06337c118a9e5f9e9b38a48c9fd3553d72163e6e1f692b5a55492aaf99b15","schema_version":"1.0","event_id":"sha256:fcb06337c118a9e5f9e9b38a48c9fd3553d72163e6e1f692b5a55492aaf99b15"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:5XAAEFAGI7B2CD5IWGTTGZ7KSH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fully fault tolerant quantum computation with non-deterministic gates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Sean D. Barrett, Simon C. Benjamin, Thomas M. Stace, Ying Li","submitted_at":"2010-08-07T22:18:41Z","abstract_excerpt":"In certain approaches to quantum computing the operations between qubits are non-deterministic and likely to fail. For example, a distributed quantum processor would achieve scalability by networking together many small components; operations between components should assumed to be failure prone. In the logical limit of this architecture each component contains only one qubit. Here we derive thresholds for fault tolerant quantum computation under such extreme paradigms. We find that computation is supported for remarkably high failure rates (exceeding 90%) providing that failures are heralded,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.1369","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-18T03:23:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RgqPY3L6UFdjikyCBs6o4rfCQqKExnyqy9IVr7XDAzsSH+r8ka9Jor0PVCxM973xlSuQGF4v3h9aiMOJ9iDOCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:28:38.930762Z"},"content_sha256":"797be9fa6e5055a153c9b59b7516768160d379588029bde875cd0455bb70f295","schema_version":"1.0","event_id":"sha256:797be9fa6e5055a153c9b59b7516768160d379588029bde875cd0455bb70f295"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5XAAEFAGI7B2CD5IWGTTGZ7KSH/bundle.json","state_url":"https://pith.science/pith/5XAAEFAGI7B2CD5IWGTTGZ7KSH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5XAAEFAGI7B2CD5IWGTTGZ7KSH/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-28T10:28:38Z","links":{"resolver":"https://pith.science/pith/5XAAEFAGI7B2CD5IWGTTGZ7KSH","bundle":"https://pith.science/pith/5XAAEFAGI7B2CD5IWGTTGZ7KSH/bundle.json","state":"https://pith.science/pith/5XAAEFAGI7B2CD5IWGTTGZ7KSH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5XAAEFAGI7B2CD5IWGTTGZ7KSH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:5XAAEFAGI7B2CD5IWGTTGZ7KSH","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":"2d0d87e5c695f9a8b4fcaa4c2b78b18b3f7c5334147b3bda98334dbf1c73a956","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-08-07T22:18:41Z","title_canon_sha256":"f3c3d6840172316490cf72d66ed4d9fd07d0d8ce2bed1ec2ee3201baece9f79f"},"schema_version":"1.0","source":{"id":"1008.1369","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.1369","created_at":"2026-05-18T03:23:47Z"},{"alias_kind":"arxiv_version","alias_value":"1008.1369v1","created_at":"2026-05-18T03:23:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.1369","created_at":"2026-05-18T03:23:47Z"},{"alias_kind":"pith_short_12","alias_value":"5XAAEFAGI7B2","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"5XAAEFAGI7B2CD5I","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"5XAAEFAG","created_at":"2026-05-18T12:26:04Z"}],"graph_snapshots":[{"event_id":"sha256:797be9fa6e5055a153c9b59b7516768160d379588029bde875cd0455bb70f295","target":"graph","created_at":"2026-05-18T03:23:47Z","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":"In certain approaches to quantum computing the operations between qubits are non-deterministic and likely to fail. For example, a distributed quantum processor would achieve scalability by networking together many small components; operations between components should assumed to be failure prone. In the logical limit of this architecture each component contains only one qubit. Here we derive thresholds for fault tolerant quantum computation under such extreme paradigms. We find that computation is supported for remarkably high failure rates (exceeding 90%) providing that failures are heralded,","authors_text":"Sean D. Barrett, Simon C. Benjamin, Thomas M. Stace, Ying Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-08-07T22:18:41Z","title":"Fully fault tolerant quantum computation with non-deterministic gates"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.1369","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:fcb06337c118a9e5f9e9b38a48c9fd3553d72163e6e1f692b5a55492aaf99b15","target":"record","created_at":"2026-05-18T03:23:47Z","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":"2d0d87e5c695f9a8b4fcaa4c2b78b18b3f7c5334147b3bda98334dbf1c73a956","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-08-07T22:18:41Z","title_canon_sha256":"f3c3d6840172316490cf72d66ed4d9fd07d0d8ce2bed1ec2ee3201baece9f79f"},"schema_version":"1.0","source":{"id":"1008.1369","kind":"arxiv","version":1}},"canonical_sha256":"edc002140647c3a10fa8b1a73367ea91d3e3621e721bc97560257cb43d618357","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"edc002140647c3a10fa8b1a73367ea91d3e3621e721bc97560257cb43d618357","first_computed_at":"2026-05-18T03:23:47.947716Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:23:47.947716Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ICG8eKeo3AZaZUcFWw/zOz71DaOZc39SsLSFuIYZUjVd/1cE4CQj8vZQYMjWZ/ZTuarCh+XBoJ2yVPoI7jF+CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:23:47.948239Z","signed_message":"canonical_sha256_bytes"},"source_id":"1008.1369","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fcb06337c118a9e5f9e9b38a48c9fd3553d72163e6e1f692b5a55492aaf99b15","sha256:797be9fa6e5055a153c9b59b7516768160d379588029bde875cd0455bb70f295"],"state_sha256":"57d9d1c24e0d85f001eee0dc70bbea51834cfc7654cbcf5d4348fb910b188879"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DFbSt7EdxIDptrO2nrvQffGwEs/1zCQ+0fU/2rSpTpOQVrPSkwThSMqUWE30f/F1WyYsCaC1NAyFVISL1DRuAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T10:28:38.932731Z","bundle_sha256":"9072bb42551498b8c2e5ce7608e6c57467282a6a83a533215a1f091a884ca3a8"}}