{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2005:6PM6HR37ZGT56QINJYUVP526LV","short_pith_number":"pith:6PM6HR37","canonical_record":{"source":{"id":"quant-ph/0508176","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2005-08-23T20:43:51Z","cross_cats_sorted":[],"title_canon_sha256":"6892789c82be802b4eb2fc4436e1c6886a34a855d9ade553bbd9abc3a47da121","abstract_canon_sha256":"42f5e307f3881d83cf12b210b683308c46bcef6c8d9f8e7f0ead2eded0102cde"},"schema_version":"1.0"},"canonical_sha256":"f3d9e3c77fc9a7df410d4e2957f75e5d6d1c18d9ef1a9261769536905e63b4c8","source":{"kind":"arxiv","id":"quant-ph/0508176","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0508176","created_at":"2026-05-18T03:29:14Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0508176v2","created_at":"2026-05-18T03:29:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0508176","created_at":"2026-05-18T03:29:14Z"},{"alias_kind":"pith_short_12","alias_value":"6PM6HR37ZGT5","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"6PM6HR37ZGT56QIN","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"6PM6HR37","created_at":"2026-05-18T12:25:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2005:6PM6HR37ZGT56QINJYUVP526LV","target":"record","payload":{"canonical_record":{"source":{"id":"quant-ph/0508176","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2005-08-23T20:43:51Z","cross_cats_sorted":[],"title_canon_sha256":"6892789c82be802b4eb2fc4436e1c6886a34a855d9ade553bbd9abc3a47da121","abstract_canon_sha256":"42f5e307f3881d83cf12b210b683308c46bcef6c8d9f8e7f0ead2eded0102cde"},"schema_version":"1.0"},"canonical_sha256":"f3d9e3c77fc9a7df410d4e2957f75e5d6d1c18d9ef1a9261769536905e63b4c8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:29:14.277952Z","signature_b64":"D65iQPZoyVYT/AqvVAAuLyeFg9DbR+8wDiTs06R1XP/JkJXNCkuQR6jkuxBobJkZTpq0oLC56y4wmc8VWVx1CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f3d9e3c77fc9a7df410d4e2957f75e5d6d1c18d9ef1a9261769536905e63b4c8","last_reissued_at":"2026-05-18T03:29:14.277260Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:29:14.277260Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"quant-ph/0508176","source_version":2,"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:29:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MebVSzUGjKiA8wtaK126imgA6AXPuhnDlBsqwEk2dnBiKECfCwTw3sRVJE9725lwK9S8HyhX+/hZXJstj65zBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:20:24.464384Z"},"content_sha256":"e38a7e91ebfbc0da51926848e5e9a22e75918b25d74f929d6073e4cb0ae65e0e","schema_version":"1.0","event_id":"sha256:e38a7e91ebfbc0da51926848e5e9a22e75918b25d74f929d6073e4cb0ae65e0e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2005:6PM6HR37ZGT56QINJYUVP526LV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A flow-map model for analyzing pseudothresholds in fault-tolerant quantum computing","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"(2) Massachusetts Institute of Technology), A. V. Aho (1) ((1) Columbia University, A. W. Cross (2), I. L. Chuang (2), K. M. Svore (1)","submitted_at":"2005-08-23T20:43:51Z","abstract_excerpt":"An arbitrarily reliable quantum computer can be efficiently constructed from noisy components using a recursive simulation procedure, provided that those components fail with probability less than the fault-tolerance threshold. Recent estimates of the threshold are near some experimentally achieved gate fidelities. However, the landscape of threshold estimates includes pseudothresholds, threshold estimates based on a subset of components and a low level of recursion. In this paper, we observe that pseudothresholds are a generic phenomenon in fault-tolerant computation. We define pseudothreshol"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0508176","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":""},"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:29:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yPjw9bG0t29afu8S92jiYyRvl1HCqHyBuJ9wOIjlfN1y7wsOaDicZopQAZVtG33Q6bcwemHpt2THgrkip4PEDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:20:24.464731Z"},"content_sha256":"57e4b23ba030f82fe5ce8f002296883cf8fdef9a4bfe202d202513cc26148523","schema_version":"1.0","event_id":"sha256:57e4b23ba030f82fe5ce8f002296883cf8fdef9a4bfe202d202513cc26148523"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6PM6HR37ZGT56QINJYUVP526LV/bundle.json","state_url":"https://pith.science/pith/6PM6HR37ZGT56QINJYUVP526LV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6PM6HR37ZGT56QINJYUVP526LV/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-06-03T22:20:24Z","links":{"resolver":"https://pith.science/pith/6PM6HR37ZGT56QINJYUVP526LV","bundle":"https://pith.science/pith/6PM6HR37ZGT56QINJYUVP526LV/bundle.json","state":"https://pith.science/pith/6PM6HR37ZGT56QINJYUVP526LV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6PM6HR37ZGT56QINJYUVP526LV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2005:6PM6HR37ZGT56QINJYUVP526LV","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":"42f5e307f3881d83cf12b210b683308c46bcef6c8d9f8e7f0ead2eded0102cde","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2005-08-23T20:43:51Z","title_canon_sha256":"6892789c82be802b4eb2fc4436e1c6886a34a855d9ade553bbd9abc3a47da121"},"schema_version":"1.0","source":{"id":"quant-ph/0508176","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0508176","created_at":"2026-05-18T03:29:14Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0508176v2","created_at":"2026-05-18T03:29:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0508176","created_at":"2026-05-18T03:29:14Z"},{"alias_kind":"pith_short_12","alias_value":"6PM6HR37ZGT5","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"6PM6HR37ZGT56QIN","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"6PM6HR37","created_at":"2026-05-18T12:25:53Z"}],"graph_snapshots":[{"event_id":"sha256:57e4b23ba030f82fe5ce8f002296883cf8fdef9a4bfe202d202513cc26148523","target":"graph","created_at":"2026-05-18T03:29:14Z","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":"An arbitrarily reliable quantum computer can be efficiently constructed from noisy components using a recursive simulation procedure, provided that those components fail with probability less than the fault-tolerance threshold. Recent estimates of the threshold are near some experimentally achieved gate fidelities. However, the landscape of threshold estimates includes pseudothresholds, threshold estimates based on a subset of components and a low level of recursion. In this paper, we observe that pseudothresholds are a generic phenomenon in fault-tolerant computation. We define pseudothreshol","authors_text":"(2) Massachusetts Institute of Technology), A. V. Aho (1) ((1) Columbia University, A. W. Cross (2), I. L. Chuang (2), K. M. Svore (1)","cross_cats":[],"headline":"","license":"","primary_cat":"quant-ph","submitted_at":"2005-08-23T20:43:51Z","title":"A flow-map model for analyzing pseudothresholds in fault-tolerant quantum computing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0508176","kind":"arxiv","version":2},"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:e38a7e91ebfbc0da51926848e5e9a22e75918b25d74f929d6073e4cb0ae65e0e","target":"record","created_at":"2026-05-18T03:29:14Z","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":"42f5e307f3881d83cf12b210b683308c46bcef6c8d9f8e7f0ead2eded0102cde","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2005-08-23T20:43:51Z","title_canon_sha256":"6892789c82be802b4eb2fc4436e1c6886a34a855d9ade553bbd9abc3a47da121"},"schema_version":"1.0","source":{"id":"quant-ph/0508176","kind":"arxiv","version":2}},"canonical_sha256":"f3d9e3c77fc9a7df410d4e2957f75e5d6d1c18d9ef1a9261769536905e63b4c8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f3d9e3c77fc9a7df410d4e2957f75e5d6d1c18d9ef1a9261769536905e63b4c8","first_computed_at":"2026-05-18T03:29:14.277260Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:29:14.277260Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"D65iQPZoyVYT/AqvVAAuLyeFg9DbR+8wDiTs06R1XP/JkJXNCkuQR6jkuxBobJkZTpq0oLC56y4wmc8VWVx1CA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:29:14.277952Z","signed_message":"canonical_sha256_bytes"},"source_id":"quant-ph/0508176","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e38a7e91ebfbc0da51926848e5e9a22e75918b25d74f929d6073e4cb0ae65e0e","sha256:57e4b23ba030f82fe5ce8f002296883cf8fdef9a4bfe202d202513cc26148523"],"state_sha256":"8e200e81b6911ae458f2bf25078fa5d897f2c95290af23382fa92f213108a165"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tLIfhJ81qasfal63sRK6yDggQtTExMN/HqJkUHzejNc7z6BnTu4WMg9NsCBA2PXhkoTGuznbCJiZEgg8r4/2Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T22:20:24.466757Z","bundle_sha256":"82f333369f7a6d6db5201b8763d2298b58878fd8fea9f5120603691ff0f358f4"}}