{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:A2MBV3RV7OE5RVB5HXRQLB3NJL","short_pith_number":"pith:A2MBV3RV","schema_version":"1.0","canonical_sha256":"06981aee35fb89d8d43d3de305876d4ac2cc9710952ea998aa756c72f01a9c92","source":{"kind":"arxiv","id":"2507.18175","version":1},"attestation_state":"computed","paper":{"title":"Optimal Quantum $(r,\\delta)$-Locally Repairable Codes via Classical Ones","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Kun Zhou, Meng Cao","submitted_at":"2025-07-24T08:21:20Z","abstract_excerpt":"Locally repairable codes (LRCs) play a crucial role in mitigating data loss in large-scale distributed and cloud storage systems. This paper establishes a unified decomposition theorem for general optimal $(r,\\delta)$-LRCs. Based on this, we obtain that the local protection codes of general optimal $(r,\\delta)$-LRCs are MDS codes with the same minimum Hamming distance $\\delta$. We prove that for general optimal $(r,\\delta)$-LRCs, their minimum Hamming distance $d$ always satisfies $d\\geq \\delta$. We fully characterize the optimal quantum $(r,\\delta)$-LRCs induced by classical optimal $(r,\\delt"},"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":"2507.18175","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-07-24T08:21:20Z","cross_cats_sorted":[],"title_canon_sha256":"d4d41cddc0e00f79938bcdb4ed647148b490f10d4ca169b47d9cbafa8fa7a4ed","abstract_canon_sha256":"04963593cb959e734b224191c7edb80c812569294a2f79998c93257749ef869a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:42:43.171384Z","signature_b64":"f5I+Ys0WsF+/NFYJkvnKZH1z/S+t6o8MK9fiftENK497OgquvKPT78hcQzugeKSnpST/fEsza7VL8C973hS7AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"06981aee35fb89d8d43d3de305876d4ac2cc9710952ea998aa756c72f01a9c92","last_reissued_at":"2026-07-05T11:42:43.170911Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:42:43.170911Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Quantum $(r,\\delta)$-Locally Repairable Codes via Classical Ones","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Kun Zhou, Meng Cao","submitted_at":"2025-07-24T08:21:20Z","abstract_excerpt":"Locally repairable codes (LRCs) play a crucial role in mitigating data loss in large-scale distributed and cloud storage systems. This paper establishes a unified decomposition theorem for general optimal $(r,\\delta)$-LRCs. Based on this, we obtain that the local protection codes of general optimal $(r,\\delta)$-LRCs are MDS codes with the same minimum Hamming distance $\\delta$. We prove that for general optimal $(r,\\delta)$-LRCs, their minimum Hamming distance $d$ always satisfies $d\\geq \\delta$. We fully characterize the optimal quantum $(r,\\delta)$-LRCs induced by classical optimal $(r,\\delt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.18175","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/2507.18175/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":"2507.18175","created_at":"2026-07-05T11:42:43.170968+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.18175v1","created_at":"2026-07-05T11:42:43.170968+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.18175","created_at":"2026-07-05T11:42:43.170968+00:00"},{"alias_kind":"pith_short_12","alias_value":"A2MBV3RV7OE5","created_at":"2026-07-05T11:42:43.170968+00:00"},{"alias_kind":"pith_short_16","alias_value":"A2MBV3RV7OE5RVB5","created_at":"2026-07-05T11:42:43.170968+00:00"},{"alias_kind":"pith_short_8","alias_value":"A2MBV3RV","created_at":"2026-07-05T11:42:43.170968+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.06736","citing_title":"Quantum Hierarchical Locally Recoverable Codes","ref_index":35,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/A2MBV3RV7OE5RVB5HXRQLB3NJL","json":"https://pith.science/pith/A2MBV3RV7OE5RVB5HXRQLB3NJL.json","graph_json":"https://pith.science/api/pith-number/A2MBV3RV7OE5RVB5HXRQLB3NJL/graph.json","events_json":"https://pith.science/api/pith-number/A2MBV3RV7OE5RVB5HXRQLB3NJL/events.json","paper":"https://pith.science/paper/A2MBV3RV"},"agent_actions":{"view_html":"https://pith.science/pith/A2MBV3RV7OE5RVB5HXRQLB3NJL","download_json":"https://pith.science/pith/A2MBV3RV7OE5RVB5HXRQLB3NJL.json","view_paper":"https://pith.science/paper/A2MBV3RV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.18175&json=true","fetch_graph":"https://pith.science/api/pith-number/A2MBV3RV7OE5RVB5HXRQLB3NJL/graph.json","fetch_events":"https://pith.science/api/pith-number/A2MBV3RV7OE5RVB5HXRQLB3NJL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A2MBV3RV7OE5RVB5HXRQLB3NJL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A2MBV3RV7OE5RVB5HXRQLB3NJL/action/storage_attestation","attest_author":"https://pith.science/pith/A2MBV3RV7OE5RVB5HXRQLB3NJL/action/author_attestation","sign_citation":"https://pith.science/pith/A2MBV3RV7OE5RVB5HXRQLB3NJL/action/citation_signature","submit_replication":"https://pith.science/pith/A2MBV3RV7OE5RVB5HXRQLB3NJL/action/replication_record"}},"created_at":"2026-07-05T11:42:43.170968+00:00","updated_at":"2026-07-05T11:42:43.170968+00:00"}