{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:IBVWQL7JPR5CNYXVLM3CD5RAXJ","short_pith_number":"pith:IBVWQL7J","schema_version":"1.0","canonical_sha256":"406b682fe97c7a26e2f55b3621f620ba51f72a73c94627073778567e396cbb0f","source":{"kind":"arxiv","id":"1809.09227","version":1},"attestation_state":"computed","paper":{"title":"On Finding the Largest Minimum Distance of Locally Recoverable Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Majid Khabbazian","submitted_at":"2018-09-24T21:17:20Z","abstract_excerpt":"The (n, k, r)-Locally recoverable codes (LRC) studied in this work are (n, k) linear codes for which the value of each coordinate can be recovered by a linear combination of at most r other coordinates. In this paper, we are interested to find the largest possible minimum distance of (n,k,r)-LRCs, denoted D(n,k,r). We refer to the problem of finding the value of D(n,k,r) as the largest minimum distance (LMD) problem. LMD can be approximated within an additive term of one; it is known in the literature that D(n,k,r) is either equal to d* or d*-1, where d*=n-k-ceil(k/r) +2. Also, in the literatu"},"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":"1809.09227","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-09-24T21:17:20Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"899ec2a7fef05be4f6e0ecc8bcd6c2fb5a9fd8d58479fde79738d7de435eca12","abstract_canon_sha256":"b495d01c5e198991d349ac9357b473886b8484148ca9d86e91f2756e4039c2ec"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:53.987207Z","signature_b64":"2ievvLuUwdxH0VS5F64+S8LmgW9nqDka4+TSd2EhRjREbI8OQQ+1d+4FEgaFl2iQ+tH/cSQSoJQkP/vhHOOzDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"406b682fe97c7a26e2f55b3621f620ba51f72a73c94627073778567e396cbb0f","last_reissued_at":"2026-05-18T00:04:53.986623Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:53.986623Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Finding the Largest Minimum Distance of Locally Recoverable Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Majid Khabbazian","submitted_at":"2018-09-24T21:17:20Z","abstract_excerpt":"The (n, k, r)-Locally recoverable codes (LRC) studied in this work are (n, k) linear codes for which the value of each coordinate can be recovered by a linear combination of at most r other coordinates. In this paper, we are interested to find the largest possible minimum distance of (n,k,r)-LRCs, denoted D(n,k,r). We refer to the problem of finding the value of D(n,k,r) as the largest minimum distance (LMD) problem. LMD can be approximated within an additive term of one; it is known in the literature that D(n,k,r) is either equal to d* or d*-1, where d*=n-k-ceil(k/r) +2. Also, in the literatu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.09227","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":""},"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":"1809.09227","created_at":"2026-05-18T00:04:53.986705+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.09227v1","created_at":"2026-05-18T00:04:53.986705+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.09227","created_at":"2026-05-18T00:04:53.986705+00:00"},{"alias_kind":"pith_short_12","alias_value":"IBVWQL7JPR5C","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"IBVWQL7JPR5CNYXV","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"IBVWQL7J","created_at":"2026-05-18T12:32:28.185984+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/IBVWQL7JPR5CNYXVLM3CD5RAXJ","json":"https://pith.science/pith/IBVWQL7JPR5CNYXVLM3CD5RAXJ.json","graph_json":"https://pith.science/api/pith-number/IBVWQL7JPR5CNYXVLM3CD5RAXJ/graph.json","events_json":"https://pith.science/api/pith-number/IBVWQL7JPR5CNYXVLM3CD5RAXJ/events.json","paper":"https://pith.science/paper/IBVWQL7J"},"agent_actions":{"view_html":"https://pith.science/pith/IBVWQL7JPR5CNYXVLM3CD5RAXJ","download_json":"https://pith.science/pith/IBVWQL7JPR5CNYXVLM3CD5RAXJ.json","view_paper":"https://pith.science/paper/IBVWQL7J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.09227&json=true","fetch_graph":"https://pith.science/api/pith-number/IBVWQL7JPR5CNYXVLM3CD5RAXJ/graph.json","fetch_events":"https://pith.science/api/pith-number/IBVWQL7JPR5CNYXVLM3CD5RAXJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IBVWQL7JPR5CNYXVLM3CD5RAXJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IBVWQL7JPR5CNYXVLM3CD5RAXJ/action/storage_attestation","attest_author":"https://pith.science/pith/IBVWQL7JPR5CNYXVLM3CD5RAXJ/action/author_attestation","sign_citation":"https://pith.science/pith/IBVWQL7JPR5CNYXVLM3CD5RAXJ/action/citation_signature","submit_replication":"https://pith.science/pith/IBVWQL7JPR5CNYXVLM3CD5RAXJ/action/replication_record"}},"created_at":"2026-05-18T00:04:53.986705+00:00","updated_at":"2026-05-18T00:04:53.986705+00:00"}