{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:DQ6AZJGVGBEPAPM2XSFZI5UXVP","short_pith_number":"pith:DQ6AZJGV","schema_version":"1.0","canonical_sha256":"1c3c0ca4d53048f03d9abc8b947697abd6e92ab7858b108e0741486a09023f97","source":{"kind":"arxiv","id":"1608.08228","version":3},"attestation_state":"computed","paper":{"title":"High-Threshold Low-Overhead Fault-Tolerant Classical Computation and the Replacement of Measurements with Unitary Quantum Gates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Benjamin Cruikshank, Kurt Jacobs","submitted_at":"2016-08-29T20:00:25Z","abstract_excerpt":"Von Neumann's classic \"multiplexing\" method is unique in achieving high-threshold fault-tolerant classical computation (FTCC), but has several significant barriers to implementation: i) the extremely complex circuits required by randomized connections, ii) the difficulty of calculating its performance in practical regimes of both code size and logical error rate, and iii) the (perceived) need for large code sizes. Here we present numerical results indicating that the third assertion is false, and introduce a novel scheme that eliminates the two remaining problems while retaining a threshold ve"},"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":"1608.08228","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-08-29T20:00:25Z","cross_cats_sorted":[],"title_canon_sha256":"3fc0fe257b0ea502e4d47cf461492e1c51af55474f959949865d92cf2c04c732","abstract_canon_sha256":"8a69de81bccd75cc64f86620c55413d0d51af3953c9587df303935d089963415"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:47.513125Z","signature_b64":"WmojX7G7j11cYItB5xrSjodNmBpNsqbDTu4JKjSAVh6BqzR+N9pnEWJtpZracuJB7xePg7C2e3ZE+lm/N/54DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c3c0ca4d53048f03d9abc8b947697abd6e92ab7858b108e0741486a09023f97","last_reissued_at":"2026-05-18T00:39:47.512583Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:47.512583Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"High-Threshold Low-Overhead Fault-Tolerant Classical Computation and the Replacement of Measurements with Unitary Quantum Gates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Benjamin Cruikshank, Kurt Jacobs","submitted_at":"2016-08-29T20:00:25Z","abstract_excerpt":"Von Neumann's classic \"multiplexing\" method is unique in achieving high-threshold fault-tolerant classical computation (FTCC), but has several significant barriers to implementation: i) the extremely complex circuits required by randomized connections, ii) the difficulty of calculating its performance in practical regimes of both code size and logical error rate, and iii) the (perceived) need for large code sizes. Here we present numerical results indicating that the third assertion is false, and introduce a novel scheme that eliminates the two remaining problems while retaining a threshold ve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.08228","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":""},"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":"1608.08228","created_at":"2026-05-18T00:39:47.512674+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.08228v3","created_at":"2026-05-18T00:39:47.512674+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.08228","created_at":"2026-05-18T00:39:47.512674+00:00"},{"alias_kind":"pith_short_12","alias_value":"DQ6AZJGVGBEP","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"DQ6AZJGVGBEPAPM2","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"DQ6AZJGV","created_at":"2026-05-18T12:30:12.583610+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DQ6AZJGVGBEPAPM2XSFZI5UXVP","json":"https://pith.science/pith/DQ6AZJGVGBEPAPM2XSFZI5UXVP.json","graph_json":"https://pith.science/api/pith-number/DQ6AZJGVGBEPAPM2XSFZI5UXVP/graph.json","events_json":"https://pith.science/api/pith-number/DQ6AZJGVGBEPAPM2XSFZI5UXVP/events.json","paper":"https://pith.science/paper/DQ6AZJGV"},"agent_actions":{"view_html":"https://pith.science/pith/DQ6AZJGVGBEPAPM2XSFZI5UXVP","download_json":"https://pith.science/pith/DQ6AZJGVGBEPAPM2XSFZI5UXVP.json","view_paper":"https://pith.science/paper/DQ6AZJGV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.08228&json=true","fetch_graph":"https://pith.science/api/pith-number/DQ6AZJGVGBEPAPM2XSFZI5UXVP/graph.json","fetch_events":"https://pith.science/api/pith-number/DQ6AZJGVGBEPAPM2XSFZI5UXVP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DQ6AZJGVGBEPAPM2XSFZI5UXVP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DQ6AZJGVGBEPAPM2XSFZI5UXVP/action/storage_attestation","attest_author":"https://pith.science/pith/DQ6AZJGVGBEPAPM2XSFZI5UXVP/action/author_attestation","sign_citation":"https://pith.science/pith/DQ6AZJGVGBEPAPM2XSFZI5UXVP/action/citation_signature","submit_replication":"https://pith.science/pith/DQ6AZJGVGBEPAPM2XSFZI5UXVP/action/replication_record"}},"created_at":"2026-05-18T00:39:47.512674+00:00","updated_at":"2026-05-18T00:39:47.512674+00:00"}