{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2002:7XIRBJK7LZMFEWZL4JF4CDZBPC","short_pith_number":"pith:7XIRBJK7","schema_version":"1.0","canonical_sha256":"fdd110a55f5e58525b2be24bc10f2178b30e2ded54327f25b6db77cd20713a55","source":{"kind":"arxiv","id":"quant-ph/0202036","version":2},"attestation_state":"computed","paper":{"title":"Fast fault-tolerant filtering of quantum codewords","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew M. Steane","submitted_at":"2002-02-06T12:05:31Z","abstract_excerpt":"The stabilization of a quantum computer by repeated error correction can be reduced almost entirely to repeated preparation of blocks of qubits in quantum codeword states. These are multi-particle entangled states with a high degree of symmetry. The required accuracy can be achieved by measuring parity checks, using imperfect apparatus, and rejecting states which fail them. This filtering process is considered for t-error-correcting codes with t>1. It is shown how to exploit the structure of the codeword and the check matrix, so that the filter is reduced to a minimal form where each parity ch"},"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/0202036","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2002-02-06T12:05:31Z","cross_cats_sorted":[],"title_canon_sha256":"fd4125502b6aa7e3a32054fd6a88cee96e083e3c7bd6088b47ff700a6d74e887","abstract_canon_sha256":"ec51d1281ef031f9fb7332581ddd11cdaf74429ca5062813dea19f918484d771"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:45:53.455503Z","signature_b64":"F7ONNQPIG7zGqQocjX9DhVEBLSwubq6T6lAXUTz4LzOXqK3SrrlxifWDABy76xCLrBD704H7q8auYNlBMmhNBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fdd110a55f5e58525b2be24bc10f2178b30e2ded54327f25b6db77cd20713a55","last_reissued_at":"2026-07-04T14:45:53.455120Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:45:53.455120Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast fault-tolerant filtering of quantum codewords","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew M. Steane","submitted_at":"2002-02-06T12:05:31Z","abstract_excerpt":"The stabilization of a quantum computer by repeated error correction can be reduced almost entirely to repeated preparation of blocks of qubits in quantum codeword states. These are multi-particle entangled states with a high degree of symmetry. The required accuracy can be achieved by measuring parity checks, using imperfect apparatus, and rejecting states which fail them. This filtering process is considered for t-error-correcting codes with t>1. It is shown how to exploit the structure of the codeword and the check matrix, so that the filter is reduced to a minimal form where each parity ch"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0202036","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/quant-ph/0202036/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/0202036","created_at":"2026-07-04T14:45:53.455174+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0202036v2","created_at":"2026-07-04T14:45:53.455174+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0202036","created_at":"2026-07-04T14:45:53.455174+00:00"},{"alias_kind":"pith_short_12","alias_value":"7XIRBJK7LZMF","created_at":"2026-07-04T14:45:53.455174+00:00"},{"alias_kind":"pith_short_16","alias_value":"7XIRBJK7LZMFEWZL","created_at":"2026-07-04T14:45:53.455174+00:00"},{"alias_kind":"pith_short_8","alias_value":"7XIRBJK7","created_at":"2026-07-04T14:45:53.455174+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":31,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7XIRBJK7LZMFEWZL4JF4CDZBPC","json":"https://pith.science/pith/7XIRBJK7LZMFEWZL4JF4CDZBPC.json","graph_json":"https://pith.science/api/pith-number/7XIRBJK7LZMFEWZL4JF4CDZBPC/graph.json","events_json":"https://pith.science/api/pith-number/7XIRBJK7LZMFEWZL4JF4CDZBPC/events.json","paper":"https://pith.science/paper/7XIRBJK7"},"agent_actions":{"view_html":"https://pith.science/pith/7XIRBJK7LZMFEWZL4JF4CDZBPC","download_json":"https://pith.science/pith/7XIRBJK7LZMFEWZL4JF4CDZBPC.json","view_paper":"https://pith.science/paper/7XIRBJK7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0202036&json=true","fetch_graph":"https://pith.science/api/pith-number/7XIRBJK7LZMFEWZL4JF4CDZBPC/graph.json","fetch_events":"https://pith.science/api/pith-number/7XIRBJK7LZMFEWZL4JF4CDZBPC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7XIRBJK7LZMFEWZL4JF4CDZBPC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7XIRBJK7LZMFEWZL4JF4CDZBPC/action/storage_attestation","attest_author":"https://pith.science/pith/7XIRBJK7LZMFEWZL4JF4CDZBPC/action/author_attestation","sign_citation":"https://pith.science/pith/7XIRBJK7LZMFEWZL4JF4CDZBPC/action/citation_signature","submit_replication":"https://pith.science/pith/7XIRBJK7LZMFEWZL4JF4CDZBPC/action/replication_record"}},"created_at":"2026-07-04T14:45:53.455174+00:00","updated_at":"2026-07-04T14:45:53.455174+00:00"}