{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:F3ODCT2ODGQ77OGPEPJ7FLAVPM","short_pith_number":"pith:F3ODCT2O","schema_version":"1.0","canonical_sha256":"2edc314f4e19a1ffb8cf23d3f2ac157b3b7904ddf5bb1e51eabe240cef6f8752","source":{"kind":"arxiv","id":"2501.18989","version":1},"attestation_state":"computed","paper":{"title":"Extension of Optimal Locally Repairable codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chang-An Zhao, Yunlong Zhu","submitted_at":"2025-01-31T09:41:14Z","abstract_excerpt":"Recent studies have delved into the construction of locally repairable codes (LRCs) with optimal minimum distance from function fields. In this paper, we present several novel constructions by extending the findings of optimally designed locally repairable codes documented in the literature. Let $C$ denote an optimal LRC of locality $r$, implying that every repairable block of $C$ is a $[r+1, r]$ MDS code, and $C$ maximizes its minimum distance. By extending a single coordinate of one of these blocks, we demonstrate that the resulting code remains an optimally designed locally repairable code."},"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":"2501.18989","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-01-31T09:41:14Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4d17264c129e0c98bd9a1afefa7fc239bc6c028dd78a483f0fb784c1e0ae05b2","abstract_canon_sha256":"63574dcb931c65be04a00578c94e39918f9309aae0bf4b751f403c5abfb08f67"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:07:54.518612Z","signature_b64":"TY/9kNf9OlyY3jet3qp7PrjlRnjApLLJpRKI/oDAazQYgsfEtMXlnO3QIMicVDS+aZdh3033NrWotzMofrz7DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2edc314f4e19a1ffb8cf23d3f2ac157b3b7904ddf5bb1e51eabe240cef6f8752","last_reissued_at":"2026-07-05T10:07:54.518137Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:07:54.518137Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Extension of Optimal Locally Repairable codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chang-An Zhao, Yunlong Zhu","submitted_at":"2025-01-31T09:41:14Z","abstract_excerpt":"Recent studies have delved into the construction of locally repairable codes (LRCs) with optimal minimum distance from function fields. In this paper, we present several novel constructions by extending the findings of optimally designed locally repairable codes documented in the literature. Let $C$ denote an optimal LRC of locality $r$, implying that every repairable block of $C$ is a $[r+1, r]$ MDS code, and $C$ maximizes its minimum distance. By extending a single coordinate of one of these blocks, we demonstrate that the resulting code remains an optimally designed locally repairable code."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.18989","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/2501.18989/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":"2501.18989","created_at":"2026-07-05T10:07:54.518204+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.18989v1","created_at":"2026-07-05T10:07:54.518204+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.18989","created_at":"2026-07-05T10:07:54.518204+00:00"},{"alias_kind":"pith_short_12","alias_value":"F3ODCT2ODGQ7","created_at":"2026-07-05T10:07:54.518204+00:00"},{"alias_kind":"pith_short_16","alias_value":"F3ODCT2ODGQ77OGP","created_at":"2026-07-05T10:07:54.518204+00:00"},{"alias_kind":"pith_short_8","alias_value":"F3ODCT2O","created_at":"2026-07-05T10:07:54.518204+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.18175","citing_title":"Optimal Quantum $(r,\\delta)$-Locally Repairable Codes via Classical Ones","ref_index":32,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/F3ODCT2ODGQ77OGPEPJ7FLAVPM","json":"https://pith.science/pith/F3ODCT2ODGQ77OGPEPJ7FLAVPM.json","graph_json":"https://pith.science/api/pith-number/F3ODCT2ODGQ77OGPEPJ7FLAVPM/graph.json","events_json":"https://pith.science/api/pith-number/F3ODCT2ODGQ77OGPEPJ7FLAVPM/events.json","paper":"https://pith.science/paper/F3ODCT2O"},"agent_actions":{"view_html":"https://pith.science/pith/F3ODCT2ODGQ77OGPEPJ7FLAVPM","download_json":"https://pith.science/pith/F3ODCT2ODGQ77OGPEPJ7FLAVPM.json","view_paper":"https://pith.science/paper/F3ODCT2O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.18989&json=true","fetch_graph":"https://pith.science/api/pith-number/F3ODCT2ODGQ77OGPEPJ7FLAVPM/graph.json","fetch_events":"https://pith.science/api/pith-number/F3ODCT2ODGQ77OGPEPJ7FLAVPM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F3ODCT2ODGQ77OGPEPJ7FLAVPM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F3ODCT2ODGQ77OGPEPJ7FLAVPM/action/storage_attestation","attest_author":"https://pith.science/pith/F3ODCT2ODGQ77OGPEPJ7FLAVPM/action/author_attestation","sign_citation":"https://pith.science/pith/F3ODCT2ODGQ77OGPEPJ7FLAVPM/action/citation_signature","submit_replication":"https://pith.science/pith/F3ODCT2ODGQ77OGPEPJ7FLAVPM/action/replication_record"}},"created_at":"2026-07-05T10:07:54.518204+00:00","updated_at":"2026-07-05T10:07:54.518204+00:00"}