{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:2M6JNGC243F74H6LGB4T4DBNIT","short_pith_number":"pith:2M6JNGC2","schema_version":"1.0","canonical_sha256":"d33c96985ae6cbfe1fcb30793e0c2d44eb87d39b07097baf308bf74b08b2a8f1","source":{"kind":"arxiv","id":"2508.03597","version":1},"attestation_state":"computed","paper":{"title":"Optimal Quantum $(r,\\delta)$-Locally Repairable Codes From Matrix-Product Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Kun Zhou, Meng Cao","submitted_at":"2025-08-05T16:05:14Z","abstract_excerpt":"This paper studies optimal quantum $(r,\\delta)$-LRCs from matrix-product (MP) codes. We establish a necessary and sufficient condition for an MP code to be an optimal $(r,\\delta)$-LRC. Based on this, we present a characterization for optimal quantum $(r,\\delta)$-LRCs from MP codes with nested constituent codes, and also study optimal quantum $(r,\\delta)$-LRCs constructed from MP codes with non-nested constituent codes. Through Hermitian dual-containing and Euclidean dual-containing MP codes, we present five infinite families of optimal quantum $(r,\\delta)$-LRCs with flexible parameters."},"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":"2508.03597","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-08-05T16:05:14Z","cross_cats_sorted":[],"title_canon_sha256":"bb1299dad47ccdc60f3c60e7bc61b885e5a6156cf42b1c74493d700d12193b6e","abstract_canon_sha256":"cd5205844e1eaf0f10b6a41a4814c5cb8bf031f091ac4179dadcd6050dc26c26"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:48:59.612579Z","signature_b64":"2blBvAQXUjmZzIqyvNJUHrip2G0T3HKCk+CN58h9eYSl1b9fC21DCZ+Y0Tni2xzDgfao+vd606Ipz6rUd9J+Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d33c96985ae6cbfe1fcb30793e0c2d44eb87d39b07097baf308bf74b08b2a8f1","last_reissued_at":"2026-07-05T11:48:59.612137Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:48:59.612137Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Quantum $(r,\\delta)$-Locally Repairable Codes From Matrix-Product Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Kun Zhou, Meng Cao","submitted_at":"2025-08-05T16:05:14Z","abstract_excerpt":"This paper studies optimal quantum $(r,\\delta)$-LRCs from matrix-product (MP) codes. We establish a necessary and sufficient condition for an MP code to be an optimal $(r,\\delta)$-LRC. Based on this, we present a characterization for optimal quantum $(r,\\delta)$-LRCs from MP codes with nested constituent codes, and also study optimal quantum $(r,\\delta)$-LRCs constructed from MP codes with non-nested constituent codes. Through Hermitian dual-containing and Euclidean dual-containing MP codes, we present five infinite families of optimal quantum $(r,\\delta)$-LRCs with flexible parameters."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.03597","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/2508.03597/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":"2508.03597","created_at":"2026-07-05T11:48:59.612191+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.03597v1","created_at":"2026-07-05T11:48:59.612191+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.03597","created_at":"2026-07-05T11:48:59.612191+00:00"},{"alias_kind":"pith_short_12","alias_value":"2M6JNGC243F7","created_at":"2026-07-05T11:48:59.612191+00:00"},{"alias_kind":"pith_short_16","alias_value":"2M6JNGC243F74H6L","created_at":"2026-07-05T11:48:59.612191+00:00"},{"alias_kind":"pith_short_8","alias_value":"2M6JNGC2","created_at":"2026-07-05T11:48:59.612191+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.09522","citing_title":"Constructions of Quantum $(r,\\delta)$-LRCs from cyclic codes","ref_index":19,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2M6JNGC243F74H6LGB4T4DBNIT","json":"https://pith.science/pith/2M6JNGC243F74H6LGB4T4DBNIT.json","graph_json":"https://pith.science/api/pith-number/2M6JNGC243F74H6LGB4T4DBNIT/graph.json","events_json":"https://pith.science/api/pith-number/2M6JNGC243F74H6LGB4T4DBNIT/events.json","paper":"https://pith.science/paper/2M6JNGC2"},"agent_actions":{"view_html":"https://pith.science/pith/2M6JNGC243F74H6LGB4T4DBNIT","download_json":"https://pith.science/pith/2M6JNGC243F74H6LGB4T4DBNIT.json","view_paper":"https://pith.science/paper/2M6JNGC2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.03597&json=true","fetch_graph":"https://pith.science/api/pith-number/2M6JNGC243F74H6LGB4T4DBNIT/graph.json","fetch_events":"https://pith.science/api/pith-number/2M6JNGC243F74H6LGB4T4DBNIT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2M6JNGC243F74H6LGB4T4DBNIT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2M6JNGC243F74H6LGB4T4DBNIT/action/storage_attestation","attest_author":"https://pith.science/pith/2M6JNGC243F74H6LGB4T4DBNIT/action/author_attestation","sign_citation":"https://pith.science/pith/2M6JNGC243F74H6LGB4T4DBNIT/action/citation_signature","submit_replication":"https://pith.science/pith/2M6JNGC243F74H6LGB4T4DBNIT/action/replication_record"}},"created_at":"2026-07-05T11:48:59.612191+00:00","updated_at":"2026-07-05T11:48:59.612191+00:00"}