{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1997:ITD6HPQDZ4VF7YSFIG2GZ5YRRS","short_pith_number":"pith:ITD6HPQD","schema_version":"1.0","canonical_sha256":"44c7e3be03cf2a5fe24541b46cf7118cbecc1fe2947a9429a520831446d8526e","source":{"kind":"arxiv","id":"quant-ph/9704019","version":2},"attestation_state":"computed","paper":{"title":"Spatially Correlated Qubit Errors and Burst-Correcting Quantum Codes","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"F. Vatan, M. P. Anantram, V. P. Roychowdhury","submitted_at":"1997-04-09T22:22:48Z","abstract_excerpt":"We explore the design of quantum error-correcting codes for cases where the decoherence events of qubits are correlated. In particular, we consider the case where only spatially contiguous qubits decohere, which is analogous to the case of burst errors in classical coding theory. We present several different efficient schemes for constructing families of such codes. For example, one can find one-dimensional quantum codes of length n=13 and 15 that correct burst errors of width b < 4; as a comparison, a random-error correcting quantum code that corrects t=3 errors must have length n > 18. In ge"},"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/9704019","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"1997-04-09T22:22:48Z","cross_cats_sorted":[],"title_canon_sha256":"35434915cc6e7088138caf00d40e75d607c2c000e7f63de6be1d4c20b9aed83e","abstract_canon_sha256":"d61974ab4950fba1eb0a640814c66b55b80d74bb4b79af8c6b6662c0f8af9d4b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:08:20.797359Z","signature_b64":"CKD6gIUMArLEyZBFFlK1OHOl7lF+Dzs8mjD1b5WCyets5/EH0g+lm4THTqGjXszbI8eTK4AYQ2qFwq8kcrjtCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44c7e3be03cf2a5fe24541b46cf7118cbecc1fe2947a9429a520831446d8526e","last_reissued_at":"2026-07-04T15:08:20.796972Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:08:20.796972Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spatially Correlated Qubit Errors and Burst-Correcting Quantum Codes","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"F. Vatan, M. P. Anantram, V. P. Roychowdhury","submitted_at":"1997-04-09T22:22:48Z","abstract_excerpt":"We explore the design of quantum error-correcting codes for cases where the decoherence events of qubits are correlated. In particular, we consider the case where only spatially contiguous qubits decohere, which is analogous to the case of burst errors in classical coding theory. We present several different efficient schemes for constructing families of such codes. For example, one can find one-dimensional quantum codes of length n=13 and 15 that correct burst errors of width b < 4; as a comparison, a random-error correcting quantum code that corrects t=3 errors must have length n > 18. In ge"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/9704019","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/9704019/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/9704019","created_at":"2026-07-04T15:08:20.797036+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/9704019v2","created_at":"2026-07-04T15:08:20.797036+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/9704019","created_at":"2026-07-04T15:08:20.797036+00:00"},{"alias_kind":"pith_short_12","alias_value":"ITD6HPQDZ4VF","created_at":"2026-07-04T15:08:20.797036+00:00"},{"alias_kind":"pith_short_16","alias_value":"ITD6HPQDZ4VF7YSF","created_at":"2026-07-04T15:08:20.797036+00:00"},{"alias_kind":"pith_short_8","alias_value":"ITD6HPQD","created_at":"2026-07-04T15:08:20.797036+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2606.30853","citing_title":"Rethinking quantum information in gravity and fields","ref_index":265,"is_internal_anchor":true},{"citing_arxiv_id":"2605.15344","citing_title":"Fire and ice: Partially fault-tolerant quantum computing with selective state filtering","ref_index":32,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ITD6HPQDZ4VF7YSFIG2GZ5YRRS","json":"https://pith.science/pith/ITD6HPQDZ4VF7YSFIG2GZ5YRRS.json","graph_json":"https://pith.science/api/pith-number/ITD6HPQDZ4VF7YSFIG2GZ5YRRS/graph.json","events_json":"https://pith.science/api/pith-number/ITD6HPQDZ4VF7YSFIG2GZ5YRRS/events.json","paper":"https://pith.science/paper/ITD6HPQD"},"agent_actions":{"view_html":"https://pith.science/pith/ITD6HPQDZ4VF7YSFIG2GZ5YRRS","download_json":"https://pith.science/pith/ITD6HPQDZ4VF7YSFIG2GZ5YRRS.json","view_paper":"https://pith.science/paper/ITD6HPQD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/9704019&json=true","fetch_graph":"https://pith.science/api/pith-number/ITD6HPQDZ4VF7YSFIG2GZ5YRRS/graph.json","fetch_events":"https://pith.science/api/pith-number/ITD6HPQDZ4VF7YSFIG2GZ5YRRS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ITD6HPQDZ4VF7YSFIG2GZ5YRRS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ITD6HPQDZ4VF7YSFIG2GZ5YRRS/action/storage_attestation","attest_author":"https://pith.science/pith/ITD6HPQDZ4VF7YSFIG2GZ5YRRS/action/author_attestation","sign_citation":"https://pith.science/pith/ITD6HPQDZ4VF7YSFIG2GZ5YRRS/action/citation_signature","submit_replication":"https://pith.science/pith/ITD6HPQDZ4VF7YSFIG2GZ5YRRS/action/replication_record"}},"created_at":"2026-07-04T15:08:20.797036+00:00","updated_at":"2026-07-04T15:08:20.797036+00:00"}