{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:O5VEPX63PYPXSAIKH6GCLVN6KH","short_pith_number":"pith:O5VEPX63","canonical_record":{"source":{"id":"0904.3556","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2009-04-22T21:33:15Z","cross_cats_sorted":[],"title_canon_sha256":"f664095f3095e5eb02fb692f931fc9d356b5d5d43cb4bcc75322dfe662fbb424","abstract_canon_sha256":"89f7b1fa6f81180c5e6c69a42ddb05fe145fb4447466807c7fecf79b32298512"},"schema_version":"1.0"},"canonical_sha256":"776a47dfdb7e1f79010a3f8c25d5be51f5e7b627abbf65d06c2aaf83874b06e4","source":{"kind":"arxiv","id":"0904.3556","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0904.3556","created_at":"2026-05-18T02:13:57Z"},{"alias_kind":"arxiv_version","alias_value":"0904.3556v1","created_at":"2026-05-18T02:13:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0904.3556","created_at":"2026-05-18T02:13:57Z"},{"alias_kind":"pith_short_12","alias_value":"O5VEPX63PYPX","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"O5VEPX63PYPXSAIK","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"O5VEPX63","created_at":"2026-05-18T12:26:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:O5VEPX63PYPXSAIKH6GCLVN6KH","target":"record","payload":{"canonical_record":{"source":{"id":"0904.3556","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2009-04-22T21:33:15Z","cross_cats_sorted":[],"title_canon_sha256":"f664095f3095e5eb02fb692f931fc9d356b5d5d43cb4bcc75322dfe662fbb424","abstract_canon_sha256":"89f7b1fa6f81180c5e6c69a42ddb05fe145fb4447466807c7fecf79b32298512"},"schema_version":"1.0"},"canonical_sha256":"776a47dfdb7e1f79010a3f8c25d5be51f5e7b627abbf65d06c2aaf83874b06e4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:13:57.941879Z","signature_b64":"WNtqXSB3TyKj//5p5z8ydyQOQaTqOAhqPg+kfwoZLTc0wlS2GO4lJQgSkspekmJCVgQydDnsG/MthpFqKeskBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"776a47dfdb7e1f79010a3f8c25d5be51f5e7b627abbf65d06c2aaf83874b06e4","last_reissued_at":"2026-05-18T02:13:57.941092Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:13:57.941092Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0904.3556","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-18T02:13:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LRhgk/SiGhBaNf65fW0BUSLUKbWNwN6eoe3J5FtSlOSJuV9rsc7xhEQe7yJmi9fnPo7mIbI3R9AWR9CTqMKICA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T08:45:15.463276Z"},"content_sha256":"79a674607656832745103f23b26db09c221f367fec2b1a33ff313cce2ff9f3d5","schema_version":"1.0","event_id":"sha256:79a674607656832745103f23b26db09c221f367fec2b1a33ff313cce2ff9f3d5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:O5VEPX63PYPXSAIKH6GCLVN6KH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Thresholds for topological codes in the presence of loss","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew C. Doherty, Sean D. Barrett, Thomas M. Stace","submitted_at":"2009-04-22T21:33:15Z","abstract_excerpt":"Many proposals for quantum information processing are subject to detectable loss errors. In this paper, we show that topological error correcting codes, which protect against computational errors, are also extremely robust against losses. We present analytical results showing the maximum tolerable loss rate is 50 %, which is determined by the square-lattice bond percolation threshold. This saturates the bound set by the no-cloning theorem. Our numerical results support this, and show a graceful trade-off between computational and loss errors."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0904.3556","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-18T02:13:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L2eJvanuGstUtSmdW8LU941K36FBm3T3K6T5cWR8FpMhRLVC/ozxAcr6MYP9p6axHR87TanbVX6xItyT41KlDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T08:45:15.463644Z"},"content_sha256":"b290d130124e4f1b3dbd37ff60cd2d0998e18e750b9dfd3a77e38d6e2788782f","schema_version":"1.0","event_id":"sha256:b290d130124e4f1b3dbd37ff60cd2d0998e18e750b9dfd3a77e38d6e2788782f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O5VEPX63PYPXSAIKH6GCLVN6KH/bundle.json","state_url":"https://pith.science/pith/O5VEPX63PYPXSAIKH6GCLVN6KH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O5VEPX63PYPXSAIKH6GCLVN6KH/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-28T08:45:15Z","links":{"resolver":"https://pith.science/pith/O5VEPX63PYPXSAIKH6GCLVN6KH","bundle":"https://pith.science/pith/O5VEPX63PYPXSAIKH6GCLVN6KH/bundle.json","state":"https://pith.science/pith/O5VEPX63PYPXSAIKH6GCLVN6KH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O5VEPX63PYPXSAIKH6GCLVN6KH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:O5VEPX63PYPXSAIKH6GCLVN6KH","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":"89f7b1fa6f81180c5e6c69a42ddb05fe145fb4447466807c7fecf79b32298512","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2009-04-22T21:33:15Z","title_canon_sha256":"f664095f3095e5eb02fb692f931fc9d356b5d5d43cb4bcc75322dfe662fbb424"},"schema_version":"1.0","source":{"id":"0904.3556","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0904.3556","created_at":"2026-05-18T02:13:57Z"},{"alias_kind":"arxiv_version","alias_value":"0904.3556v1","created_at":"2026-05-18T02:13:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0904.3556","created_at":"2026-05-18T02:13:57Z"},{"alias_kind":"pith_short_12","alias_value":"O5VEPX63PYPX","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"O5VEPX63PYPXSAIK","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"O5VEPX63","created_at":"2026-05-18T12:26:01Z"}],"graph_snapshots":[{"event_id":"sha256:b290d130124e4f1b3dbd37ff60cd2d0998e18e750b9dfd3a77e38d6e2788782f","target":"graph","created_at":"2026-05-18T02:13: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"},"paper":{"abstract_excerpt":"Many proposals for quantum information processing are subject to detectable loss errors. In this paper, we show that topological error correcting codes, which protect against computational errors, are also extremely robust against losses. We present analytical results showing the maximum tolerable loss rate is 50 %, which is determined by the square-lattice bond percolation threshold. This saturates the bound set by the no-cloning theorem. Our numerical results support this, and show a graceful trade-off between computational and loss errors.","authors_text":"Andrew C. Doherty, Sean D. Barrett, Thomas M. Stace","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2009-04-22T21:33:15Z","title":"Thresholds for topological codes in the presence of loss"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0904.3556","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:79a674607656832745103f23b26db09c221f367fec2b1a33ff313cce2ff9f3d5","target":"record","created_at":"2026-05-18T02:13: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":"89f7b1fa6f81180c5e6c69a42ddb05fe145fb4447466807c7fecf79b32298512","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2009-04-22T21:33:15Z","title_canon_sha256":"f664095f3095e5eb02fb692f931fc9d356b5d5d43cb4bcc75322dfe662fbb424"},"schema_version":"1.0","source":{"id":"0904.3556","kind":"arxiv","version":1}},"canonical_sha256":"776a47dfdb7e1f79010a3f8c25d5be51f5e7b627abbf65d06c2aaf83874b06e4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"776a47dfdb7e1f79010a3f8c25d5be51f5e7b627abbf65d06c2aaf83874b06e4","first_computed_at":"2026-05-18T02:13:57.941092Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:13:57.941092Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WNtqXSB3TyKj//5p5z8ydyQOQaTqOAhqPg+kfwoZLTc0wlS2GO4lJQgSkspekmJCVgQydDnsG/MthpFqKeskBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:13:57.941879Z","signed_message":"canonical_sha256_bytes"},"source_id":"0904.3556","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:79a674607656832745103f23b26db09c221f367fec2b1a33ff313cce2ff9f3d5","sha256:b290d130124e4f1b3dbd37ff60cd2d0998e18e750b9dfd3a77e38d6e2788782f"],"state_sha256":"33c4fbebc168a4d85d2f1b84100780aaacd7d6a77e4e262aaf7a9adb18062377"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G4eGkzl0I094if+5ruwHubDHQQ/wXAayDXtjIhg5xoSXmoJ0wmyvJBcYDCz2st3Bk4ADOvUNYUmHByXHe1mlDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T08:45:15.465859Z","bundle_sha256":"72f220ce5ca3f9695d9981155b685db11d11450f38dd3f88e59cbd8c6b17ff0b"}}