{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:QYPIG32ZSOGNXORQFG4JK7FLAE","short_pith_number":"pith:QYPIG32Z","schema_version":"1.0","canonical_sha256":"861e836f59938cdbba3029b8957cab0126d82c1d34a433dbd9e8c5e6e34db9aa","source":{"kind":"arxiv","id":"2508.08246","version":2},"attestation_state":"computed","paper":{"title":"Composable Quantum Fault-Tolerance","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Christopher A. Pattison, Quynh T. Nguyen, Zhiyang He","submitted_at":"2025-08-11T17:58:14Z","abstract_excerpt":"Proving threshold theorems for fault-tolerant quantum computation is a burdensome endeavor with many moving parts that come together in relatively formulaic but lengthy ways. It is difficult and rare to combine elements from multiple papers into a single formal threshold proof, due to the use of different measures of fault-tolerance. In this work, we introduce composable fault-tolerance, a framework that decouples the probabilistic analysis of the noise distribution from the combinatorial analysis of circuit correctness, and enables threshold proofs to compose independently analyzed gadgets ea"},"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":"2508.08246","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-08-11T17:58:14Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"e9f1a6a97e4bf1e2343896e101d85a94469d2d2cda771ca40f362d88819995bf","abstract_canon_sha256":"18c742dd67bcc6881fac9f0c343f0a129540f9c39da1614cd42d9770f20b85fb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:53:50.518948Z","signature_b64":"W54upIoBuiZuw2Y30taEKpLajiv0owOK07RdHpWrM2VQkjEBZCnyj0+25Pus+ufX001yzJeT+uNTaP8ul9IbCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"861e836f59938cdbba3029b8957cab0126d82c1d34a433dbd9e8c5e6e34db9aa","last_reissued_at":"2026-07-05T11:53:50.518247Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:53:50.518247Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Composable Quantum Fault-Tolerance","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Christopher A. Pattison, Quynh T. Nguyen, Zhiyang He","submitted_at":"2025-08-11T17:58:14Z","abstract_excerpt":"Proving threshold theorems for fault-tolerant quantum computation is a burdensome endeavor with many moving parts that come together in relatively formulaic but lengthy ways. It is difficult and rare to combine elements from multiple papers into a single formal threshold proof, due to the use of different measures of fault-tolerance. In this work, we introduce composable fault-tolerance, a framework that decouples the probabilistic analysis of the noise distribution from the combinatorial analysis of circuit correctness, and enables threshold proofs to compose independently analyzed gadgets ea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.08246","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2508.08246/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":"2508.08246","created_at":"2026-07-05T11:53:50.518353+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.08246v2","created_at":"2026-07-05T11:53:50.518353+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.08246","created_at":"2026-07-05T11:53:50.518353+00:00"},{"alias_kind":"pith_short_12","alias_value":"QYPIG32ZSOGN","created_at":"2026-07-05T11:53:50.518353+00:00"},{"alias_kind":"pith_short_16","alias_value":"QYPIG32ZSOGNXORQ","created_at":"2026-07-05T11:53:50.518353+00:00"},{"alias_kind":"pith_short_8","alias_value":"QYPIG32Z","created_at":"2026-07-05T11:53:50.518353+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2503.05003","citing_title":"Parallel Logical Measurements via Quantum Code Surgery","ref_index":83,"is_internal_anchor":false},{"citing_arxiv_id":"2604.05870","citing_title":"Fault-Tolerant One-Shot Entanglement Generation with Constant-Sized Quantum Devices in the Plane","ref_index":31,"is_internal_anchor":false},{"citing_arxiv_id":"2605.02057","citing_title":"Exponential speedups in fault-tolerant processing of quantum experiments","ref_index":17,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QYPIG32ZSOGNXORQFG4JK7FLAE","json":"https://pith.science/pith/QYPIG32ZSOGNXORQFG4JK7FLAE.json","graph_json":"https://pith.science/api/pith-number/QYPIG32ZSOGNXORQFG4JK7FLAE/graph.json","events_json":"https://pith.science/api/pith-number/QYPIG32ZSOGNXORQFG4JK7FLAE/events.json","paper":"https://pith.science/paper/QYPIG32Z"},"agent_actions":{"view_html":"https://pith.science/pith/QYPIG32ZSOGNXORQFG4JK7FLAE","download_json":"https://pith.science/pith/QYPIG32ZSOGNXORQFG4JK7FLAE.json","view_paper":"https://pith.science/paper/QYPIG32Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.08246&json=true","fetch_graph":"https://pith.science/api/pith-number/QYPIG32ZSOGNXORQFG4JK7FLAE/graph.json","fetch_events":"https://pith.science/api/pith-number/QYPIG32ZSOGNXORQFG4JK7FLAE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QYPIG32ZSOGNXORQFG4JK7FLAE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QYPIG32ZSOGNXORQFG4JK7FLAE/action/storage_attestation","attest_author":"https://pith.science/pith/QYPIG32ZSOGNXORQFG4JK7FLAE/action/author_attestation","sign_citation":"https://pith.science/pith/QYPIG32ZSOGNXORQFG4JK7FLAE/action/citation_signature","submit_replication":"https://pith.science/pith/QYPIG32ZSOGNXORQFG4JK7FLAE/action/replication_record"}},"created_at":"2026-07-05T11:53:50.518353+00:00","updated_at":"2026-07-05T11:53:50.518353+00:00"}