{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:IBVWQL7JPR5CNYXVLM3CD5RAXJ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"b495d01c5e198991d349ac9357b473886b8484148ca9d86e91f2756e4039c2ec","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-09-24T21:17:20Z","title_canon_sha256":"899ec2a7fef05be4f6e0ecc8bcd6c2fb5a9fd8d58479fde79738d7de435eca12"},"schema_version":"1.0","source":{"id":"1809.09227","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.09227","created_at":"2026-05-18T00:04:53Z"},{"alias_kind":"arxiv_version","alias_value":"1809.09227v1","created_at":"2026-05-18T00:04:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.09227","created_at":"2026-05-18T00:04:53Z"},{"alias_kind":"pith_short_12","alias_value":"IBVWQL7JPR5C","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"IBVWQL7JPR5CNYXV","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"IBVWQL7J","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:8f72b31ec98aa4c3ec9d32ced0e2e316b272d24491b0e4926d3d376b81db6050","target":"graph","created_at":"2026-05-18T00:04:53Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Majid Khabbazian","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-09-24T21:17:20Z","title":"On Finding the Largest Minimum Distance of Locally Recoverable Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.09227","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:51adc8f2a4c284976c904440b2cb79ff8e27c2fffaac76b8e6d71ba8bc0542bb","target":"record","created_at":"2026-05-18T00:04:53Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"b495d01c5e198991d349ac9357b473886b8484148ca9d86e91f2756e4039c2ec","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-09-24T21:17:20Z","title_canon_sha256":"899ec2a7fef05be4f6e0ecc8bcd6c2fb5a9fd8d58479fde79738d7de435eca12"},"schema_version":"1.0","source":{"id":"1809.09227","kind":"arxiv","version":1}},"canonical_sha256":"406b682fe97c7a26e2f55b3621f620ba51f72a73c94627073778567e396cbb0f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"406b682fe97c7a26e2f55b3621f620ba51f72a73c94627073778567e396cbb0f","first_computed_at":"2026-05-18T00:04:53.986623Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:53.986623Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2ievvLuUwdxH0VS5F64+S8LmgW9nqDka4+TSd2EhRjREbI8OQQ+1d+4FEgaFl2iQ+tH/cSQSoJQkP/vhHOOzDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:53.987207Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.09227","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:51adc8f2a4c284976c904440b2cb79ff8e27c2fffaac76b8e6d71ba8bc0542bb","sha256:8f72b31ec98aa4c3ec9d32ced0e2e316b272d24491b0e4926d3d376b81db6050"],"state_sha256":"9744485938809a150dbf735c0b51dab8c21e52beaf58d3b66648b1338a02e2d3"}