{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:VGBDRR6KQ2ZSAFPGW5UGPHZVJB","short_pith_number":"pith:VGBDRR6K","schema_version":"1.0","canonical_sha256":"a98238c7ca86b32015e6b768679f3548565698b679cfd4c45e76813e4702d103","source":{"kind":"arxiv","id":"2606.06736","version":1},"attestation_state":"computed","paper":{"title":"Quantum Hierarchical Locally Recoverable Codes","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Pranav Trivedi, Rutuja Kshirsagar, Venkatesan Guruswami","submitted_at":"2026-06-04T21:43:20Z","abstract_excerpt":"Quantum locally recoverable codes (QLRCs) have recently gained attention as a framework for achieving efficient quantum storage with local recovery capabilities. Analogous to their classical counterparts, QLRCs allow a lost qudit to be reconstructed using only a small subset of other qudits, thereby reducing the resource and operational overhead in recovery. In this work, we extend the study of QLRCs by considering $(r,\\delta)$ QLRCs characterized by locality parameter $r$ and local distance $\\delta \\geq 2$. We present constructions of both random and explicit $(r,\\delta)$ QLRCs, including exp"},"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":"2606.06736","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.IT","submitted_at":"2026-06-04T21:43:20Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"eeb20f446e247b397e1d344086c8f5de129ead603b82e6fee0cd0ffc7b34fafa","abstract_canon_sha256":"5e006cb0faa07525646e0cf19cdccdba95ec1ba3f190575cf86344d41f912c6e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-08T01:04:25.382634Z","signature_b64":"Q5TPFOKieqG91ewrihlEsOdDNcHqSoZD0VHG209NxziiVhUUUEeSG9xxovIdoVKwyLowuaE1fG054YwRIKd0Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a98238c7ca86b32015e6b768679f3548565698b679cfd4c45e76813e4702d103","last_reissued_at":"2026-06-08T01:04:25.381895Z","signature_status":"signed_v1","first_computed_at":"2026-06-08T01:04:25.381895Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Hierarchical Locally Recoverable Codes","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Pranav Trivedi, Rutuja Kshirsagar, Venkatesan Guruswami","submitted_at":"2026-06-04T21:43:20Z","abstract_excerpt":"Quantum locally recoverable codes (QLRCs) have recently gained attention as a framework for achieving efficient quantum storage with local recovery capabilities. Analogous to their classical counterparts, QLRCs allow a lost qudit to be reconstructed using only a small subset of other qudits, thereby reducing the resource and operational overhead in recovery. In this work, we extend the study of QLRCs by considering $(r,\\delta)$ QLRCs characterized by locality parameter $r$ and local distance $\\delta \\geq 2$. We present constructions of both random and explicit $(r,\\delta)$ QLRCs, including exp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.06736","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/2606.06736/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":"2606.06736","created_at":"2026-06-08T01:04:25.382002+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.06736v1","created_at":"2026-06-08T01:04:25.382002+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.06736","created_at":"2026-06-08T01:04:25.382002+00:00"},{"alias_kind":"pith_short_12","alias_value":"VGBDRR6KQ2ZS","created_at":"2026-06-08T01:04:25.382002+00:00"},{"alias_kind":"pith_short_16","alias_value":"VGBDRR6KQ2ZSAFPG","created_at":"2026-06-08T01:04:25.382002+00:00"},{"alias_kind":"pith_short_8","alias_value":"VGBDRR6K","created_at":"2026-06-08T01:04:25.382002+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/VGBDRR6KQ2ZSAFPGW5UGPHZVJB","json":"https://pith.science/pith/VGBDRR6KQ2ZSAFPGW5UGPHZVJB.json","graph_json":"https://pith.science/api/pith-number/VGBDRR6KQ2ZSAFPGW5UGPHZVJB/graph.json","events_json":"https://pith.science/api/pith-number/VGBDRR6KQ2ZSAFPGW5UGPHZVJB/events.json","paper":"https://pith.science/paper/VGBDRR6K"},"agent_actions":{"view_html":"https://pith.science/pith/VGBDRR6KQ2ZSAFPGW5UGPHZVJB","download_json":"https://pith.science/pith/VGBDRR6KQ2ZSAFPGW5UGPHZVJB.json","view_paper":"https://pith.science/paper/VGBDRR6K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.06736&json=true","fetch_graph":"https://pith.science/api/pith-number/VGBDRR6KQ2ZSAFPGW5UGPHZVJB/graph.json","fetch_events":"https://pith.science/api/pith-number/VGBDRR6KQ2ZSAFPGW5UGPHZVJB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VGBDRR6KQ2ZSAFPGW5UGPHZVJB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VGBDRR6KQ2ZSAFPGW5UGPHZVJB/action/storage_attestation","attest_author":"https://pith.science/pith/VGBDRR6KQ2ZSAFPGW5UGPHZVJB/action/author_attestation","sign_citation":"https://pith.science/pith/VGBDRR6KQ2ZSAFPGW5UGPHZVJB/action/citation_signature","submit_replication":"https://pith.science/pith/VGBDRR6KQ2ZSAFPGW5UGPHZVJB/action/replication_record"}},"created_at":"2026-06-08T01:04:25.382002+00:00","updated_at":"2026-06-08T01:04:25.382002+00:00"}