{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:TPCTDROVKJUG4FJCGRFOGJYGW6","short_pith_number":"pith:TPCTDROV","schema_version":"1.0","canonical_sha256":"9bc531c5d552686e1522344ae32706b7a93fc906961880d4e2ec137f97401337","source":{"kind":"arxiv","id":"quant-ph/0605192","version":3},"attestation_state":"computed","paper":{"title":"Fault-Tolerant Thresholds for Encoded Ancillae with Homogeneous Errors","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Bryan Eastin","submitted_at":"2006-05-22T14:23:14Z","abstract_excerpt":"I describe a procedure for calculating thresholds for quantum computation as a function of error model given the availability of ancillae prepared in logical states with independent, identically distributed errors. The thresholds are determined via a simple counting argument performed on a single qubit of an infinitely large CSS code. I give concrete examples of thresholds thus achievable for both Steane and Knill style fault-tolerant implementations and investigate their relation to threshold estimates in the literature."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"quant-ph/0605192","kind":"arxiv","version":3},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2006-05-22T14:23:14Z","cross_cats_sorted":[],"title_canon_sha256":"c189ecb5f29d93854b18422d58ddcc321b22eb151a2b615faea7e5938d34691f","abstract_canon_sha256":"784e76516321bb906f1399d8b8747a25dc6cbb73dd7bf90e708a7854e4907500"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T17:15:51.877142Z","signature_b64":"tQQ2OnppbBrNXimGCo8JAW1MKziS4Aa4TsVwIdNx+pK8PcF4OLJHBB6NzULhS8Ne3BQ+9DJAWd7NZ7mitSYCBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9bc531c5d552686e1522344ae32706b7a93fc906961880d4e2ec137f97401337","last_reissued_at":"2026-07-04T17:15:51.876710Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T17:15:51.876710Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fault-Tolerant Thresholds for Encoded Ancillae with Homogeneous Errors","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Bryan Eastin","submitted_at":"2006-05-22T14:23:14Z","abstract_excerpt":"I describe a procedure for calculating thresholds for quantum computation as a function of error model given the availability of ancillae prepared in logical states with independent, identically distributed errors. The thresholds are determined via a simple counting argument performed on a single qubit of an infinitely large CSS code. I give concrete examples of thresholds thus achievable for both Steane and Knill style fault-tolerant implementations and investigate their relation to threshold estimates in the literature."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0605192","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/0605192/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0605192","created_at":"2026-07-04T17:15:51.876764+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0605192v3","created_at":"2026-07-04T17:15:51.876764+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0605192","created_at":"2026-07-04T17:15:51.876764+00:00"},{"alias_kind":"pith_short_12","alias_value":"TPCTDROVKJUG","created_at":"2026-07-04T17:15:51.876764+00:00"},{"alias_kind":"pith_short_16","alias_value":"TPCTDROVKJUG4FJC","created_at":"2026-07-04T17:15:51.876764+00:00"},{"alias_kind":"pith_short_8","alias_value":"TPCTDROV","created_at":"2026-07-04T17:15:51.876764+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.15344","citing_title":"Fire and ice: Partially fault-tolerant quantum computing with selective state filtering","ref_index":10,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TPCTDROVKJUG4FJCGRFOGJYGW6","json":"https://pith.science/pith/TPCTDROVKJUG4FJCGRFOGJYGW6.json","graph_json":"https://pith.science/api/pith-number/TPCTDROVKJUG4FJCGRFOGJYGW6/graph.json","events_json":"https://pith.science/api/pith-number/TPCTDROVKJUG4FJCGRFOGJYGW6/events.json","paper":"https://pith.science/paper/TPCTDROV"},"agent_actions":{"view_html":"https://pith.science/pith/TPCTDROVKJUG4FJCGRFOGJYGW6","download_json":"https://pith.science/pith/TPCTDROVKJUG4FJCGRFOGJYGW6.json","view_paper":"https://pith.science/paper/TPCTDROV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0605192&json=true","fetch_graph":"https://pith.science/api/pith-number/TPCTDROVKJUG4FJCGRFOGJYGW6/graph.json","fetch_events":"https://pith.science/api/pith-number/TPCTDROVKJUG4FJCGRFOGJYGW6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TPCTDROVKJUG4FJCGRFOGJYGW6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TPCTDROVKJUG4FJCGRFOGJYGW6/action/storage_attestation","attest_author":"https://pith.science/pith/TPCTDROVKJUG4FJCGRFOGJYGW6/action/author_attestation","sign_citation":"https://pith.science/pith/TPCTDROVKJUG4FJCGRFOGJYGW6/action/citation_signature","submit_replication":"https://pith.science/pith/TPCTDROVKJUG4FJCGRFOGJYGW6/action/replication_record"}},"created_at":"2026-07-04T17:15:51.876764+00:00","updated_at":"2026-07-04T17:15:51.876764+00:00"}