{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:KNGFMRRXBD3KN72YDM4G4HIMLF","short_pith_number":"pith:KNGFMRRX","schema_version":"1.0","canonical_sha256":"534c56463708f6a6ff581b386e1d0c597f7399dc20400538bb0dd7b5ed1c5ec5","source":{"kind":"arxiv","id":"2607.27091","version":1},"attestation_state":"computed","paper":{"title":"Entanglement-Assisted Quantum Locally Recoverable Codes: Characterizations, Bounds, and Constructions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Gaojun Luo, San Ling, Shixin Zhu, Yang Li, Zhenliang Lu","submitted_at":"2026-07-29T16:19:14Z","abstract_excerpt":"Quantum locally recoverable codes (qLRCs) allow a single qudit erasure to be corrected by accessing only a small number of other qudits. Standard CSS and Hermitian constructions, however, impose dual-containing or self-orthogonal constraints on the underlying classical codes, thereby restricting the well-structured classical LRCs (cLRCs) that can be used to construct qLRCs. To relax these constraints, we introduce entanglement-assisted quantum locally recoverable codes (EAQLRCs) by assuming that halves of the pre-shared maximally entangled pairs are noiseless. We characterize sufficient suppor"},"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":"2607.27091","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-07-29T16:19:14Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e2e921e76a0e10ac11dc10f0ce45ffbd85a8fcb78c95c71b851acc77475d1682","abstract_canon_sha256":"f7db4ac436ae6e85b3e239cce5181f48993b8dcec997dcfb7155062001782f6d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"534c56463708f6a6ff581b386e1d0c597f7399dc20400538bb0dd7b5ed1c5ec5","last_reissued_at":"2026-07-30T01:23:33.162908Z","signature_status":"unsigned_v0","first_computed_at":"2026-07-30T01:23:33.162908Z"},"graph_snapshot":{"paper":{"title":"Entanglement-Assisted Quantum Locally Recoverable Codes: Characterizations, Bounds, and Constructions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Gaojun Luo, San Ling, Shixin Zhu, Yang Li, Zhenliang Lu","submitted_at":"2026-07-29T16:19:14Z","abstract_excerpt":"Quantum locally recoverable codes (qLRCs) allow a single qudit erasure to be corrected by accessing only a small number of other qudits. Standard CSS and Hermitian constructions, however, impose dual-containing or self-orthogonal constraints on the underlying classical codes, thereby restricting the well-structured classical LRCs (cLRCs) that can be used to construct qLRCs. To relax these constraints, we introduce entanglement-assisted quantum locally recoverable codes (EAQLRCs) by assuming that halves of the pre-shared maximally entangled pairs are noiseless. We characterize sufficient suppor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.27091","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.27091/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":"2607.27091","created_at":"2026-07-30T01:23:33.167966+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.27091v1","created_at":"2026-07-30T01:23:33.167966+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.27091","created_at":"2026-07-30T01:23:33.167966+00:00"},{"alias_kind":"pith_short_12","alias_value":"KNGFMRRXBD3K","created_at":"2026-07-30T01:23:33.167966+00:00"},{"alias_kind":"pith_short_16","alias_value":"KNGFMRRXBD3KN72Y","created_at":"2026-07-30T01:23:33.167966+00:00"},{"alias_kind":"pith_short_8","alias_value":"KNGFMRRX","created_at":"2026-07-30T01:23:33.167966+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.06854","citing_title":"Entanglement-Assisted Quantum Locally Recoverable Codes: Bounds, Optimal Constructions, and Achievability","ref_index":19,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KNGFMRRXBD3KN72YDM4G4HIMLF","json":"https://pith.science/pith/KNGFMRRXBD3KN72YDM4G4HIMLF.json","graph_json":"https://pith.science/api/pith-number/KNGFMRRXBD3KN72YDM4G4HIMLF/graph.json","events_json":"https://pith.science/api/pith-number/KNGFMRRXBD3KN72YDM4G4HIMLF/events.json","paper":"https://pith.science/paper/KNGFMRRX"},"agent_actions":{"view_html":"https://pith.science/pith/KNGFMRRXBD3KN72YDM4G4HIMLF","download_json":"https://pith.science/pith/KNGFMRRXBD3KN72YDM4G4HIMLF.json","view_paper":"https://pith.science/paper/KNGFMRRX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.27091&json=true","fetch_graph":"https://pith.science/api/pith-number/KNGFMRRXBD3KN72YDM4G4HIMLF/graph.json","fetch_events":"https://pith.science/api/pith-number/KNGFMRRXBD3KN72YDM4G4HIMLF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KNGFMRRXBD3KN72YDM4G4HIMLF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KNGFMRRXBD3KN72YDM4G4HIMLF/action/storage_attestation","attest_author":"https://pith.science/pith/KNGFMRRXBD3KN72YDM4G4HIMLF/action/author_attestation","sign_citation":"https://pith.science/pith/KNGFMRRXBD3KN72YDM4G4HIMLF/action/citation_signature","submit_replication":"https://pith.science/pith/KNGFMRRXBD3KN72YDM4G4HIMLF/action/replication_record"}},"created_at":"2026-07-30T01:23:33.167966+00:00","updated_at":"2026-07-30T01:23:33.167966+00:00"}