{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1999:5U2CPUJHXRGJNC5TARF5SG424S","short_pith_number":"pith:5U2CPUJH","schema_version":"1.0","canonical_sha256":"ed3427d127bc4c968bb3044bd91b9ae4a068f512d0a23f8dfed0d3088c2807cf","source":{"kind":"arxiv","id":"quant-ph/9910059","version":1},"attestation_state":"computed","paper":{"title":"Quantum Reed-Solomon Codes","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Markus Grassl, Thomas Beth (Universitaet Karlsruhe), Willi Geiselmann","submitted_at":"1999-10-14T10:56:26Z","abstract_excerpt":"After a brief introduction to both quantum computation and quantum error correction, we show how to construct quantum error-correcting codes based on classical BCH codes. With these codes, decoding can exploit additional information about the position of errors. This error model - the quantum erasure channel - is discussed. Finally, parameters of quantum BCH codes are provided."},"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/9910059","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"1999-10-14T10:56:26Z","cross_cats_sorted":[],"title_canon_sha256":"7bf27b0b051521374dd4c909b0a0c3443fddf35f74a6cc1773db94263cb85c0f","abstract_canon_sha256":"388a866f7e44720fbf154c0fede94a9fecafdaf5f097041a46d4c28c71c400ed"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:10:37.410394Z","signature_b64":"3yMwyfGFwsuLtiBehKSfWGpR3naiLpIhr/6cgnXJAazSXTcKoyhrNqhWKOBedfjfUevNQA+QgTJQ9XF1MYq+BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed3427d127bc4c968bb3044bd91b9ae4a068f512d0a23f8dfed0d3088c2807cf","last_reissued_at":"2026-05-18T04:10:37.409552Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:10:37.409552Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Reed-Solomon Codes","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Markus Grassl, Thomas Beth (Universitaet Karlsruhe), Willi Geiselmann","submitted_at":"1999-10-14T10:56:26Z","abstract_excerpt":"After a brief introduction to both quantum computation and quantum error correction, we show how to construct quantum error-correcting codes based on classical BCH codes. With these codes, decoding can exploit additional information about the position of errors. This error model - the quantum erasure channel - is discussed. Finally, parameters of quantum BCH codes are provided."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/9910059","kind":"arxiv","version":1},"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":"quant-ph/9910059","created_at":"2026-05-18T04:10:37.409683+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/9910059v1","created_at":"2026-05-18T04:10:37.409683+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/9910059","created_at":"2026-05-18T04:10:37.409683+00:00"},{"alias_kind":"pith_short_12","alias_value":"5U2CPUJHXRGJ","created_at":"2026-05-18T12:25:49.038998+00:00"},{"alias_kind":"pith_short_16","alias_value":"5U2CPUJHXRGJNC5T","created_at":"2026-05-18T12:25:49.038998+00:00"},{"alias_kind":"pith_short_8","alias_value":"5U2CPUJH","created_at":"2026-05-18T12:25:49.038998+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/5U2CPUJHXRGJNC5TARF5SG424S","json":"https://pith.science/pith/5U2CPUJHXRGJNC5TARF5SG424S.json","graph_json":"https://pith.science/api/pith-number/5U2CPUJHXRGJNC5TARF5SG424S/graph.json","events_json":"https://pith.science/api/pith-number/5U2CPUJHXRGJNC5TARF5SG424S/events.json","paper":"https://pith.science/paper/5U2CPUJH"},"agent_actions":{"view_html":"https://pith.science/pith/5U2CPUJHXRGJNC5TARF5SG424S","download_json":"https://pith.science/pith/5U2CPUJHXRGJNC5TARF5SG424S.json","view_paper":"https://pith.science/paper/5U2CPUJH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/9910059&json=true","fetch_graph":"https://pith.science/api/pith-number/5U2CPUJHXRGJNC5TARF5SG424S/graph.json","fetch_events":"https://pith.science/api/pith-number/5U2CPUJHXRGJNC5TARF5SG424S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5U2CPUJHXRGJNC5TARF5SG424S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5U2CPUJHXRGJNC5TARF5SG424S/action/storage_attestation","attest_author":"https://pith.science/pith/5U2CPUJHXRGJNC5TARF5SG424S/action/author_attestation","sign_citation":"https://pith.science/pith/5U2CPUJHXRGJNC5TARF5SG424S/action/citation_signature","submit_replication":"https://pith.science/pith/5U2CPUJHXRGJNC5TARF5SG424S/action/replication_record"}},"created_at":"2026-05-18T04:10:37.409683+00:00","updated_at":"2026-05-18T04:10:37.409683+00:00"}