{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:MVI3AGBDJDSIVATSQDZX37NKCL","short_pith_number":"pith:MVI3AGBD","schema_version":"1.0","canonical_sha256":"6551b0182348e48a827280f37dfdaa12e1d54593dd46a1d370a4dc58bbf01c3a","source":{"kind":"arxiv","id":"1406.4277","version":1},"attestation_state":"computed","paper":{"title":"Constructions of Optimal and Almost Optimal Locally Repairable Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Camilla Hollanti, Thomas Westerb\\\"ack, Toni Ernvall","submitted_at":"2014-06-17T08:41:16Z","abstract_excerpt":"Constructions of optimal locally repairable codes (LRCs) in the case of $(r+1) \\nmid n$ and over small finite fields were stated as open problems for LRCs in [I. Tamo \\emph{et al.}, \"Optimal locally repairable codes and connections to matroid theory\", \\emph{2013 IEEE ISIT}]. In this paper, these problems are studied by constructing almost optimal linear LRCs, which are proven to be optimal for certain parameters, including cases for which $(r+1) \\nmid n$. More precisely, linear codes for given length, dimension, and all-symbol locality are constructed with almost optimal minimum distance. `Alm"},"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":"1406.4277","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-06-17T08:41:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f5085f96a1b02b7501cada347229b9c2829065824cab68ecefb1dc0750929027","abstract_canon_sha256":"3f5120233a36c521ebb469e6770102d685aef3a7f6a00b804987213917e9be33"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:33:25.193170Z","signature_b64":"NDtF+og9V8iY6J71NIpvpDX0cmnLefu1Ewq8jk1q5PHyE7aKhaD7EY1aQxPv6KvRlR9w1aaDGzXpAmXD1qadAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6551b0182348e48a827280f37dfdaa12e1d54593dd46a1d370a4dc58bbf01c3a","last_reissued_at":"2026-05-18T02:33:25.192678Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:33:25.192678Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constructions of Optimal and Almost Optimal Locally Repairable Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Camilla Hollanti, Thomas Westerb\\\"ack, Toni Ernvall","submitted_at":"2014-06-17T08:41:16Z","abstract_excerpt":"Constructions of optimal locally repairable codes (LRCs) in the case of $(r+1) \\nmid n$ and over small finite fields were stated as open problems for LRCs in [I. Tamo \\emph{et al.}, \"Optimal locally repairable codes and connections to matroid theory\", \\emph{2013 IEEE ISIT}]. In this paper, these problems are studied by constructing almost optimal linear LRCs, which are proven to be optimal for certain parameters, including cases for which $(r+1) \\nmid n$. More precisely, linear codes for given length, dimension, and all-symbol locality are constructed with almost optimal minimum distance. `Alm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.4277","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":"1406.4277","created_at":"2026-05-18T02:33:25.192752+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.4277v1","created_at":"2026-05-18T02:33:25.192752+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.4277","created_at":"2026-05-18T02:33:25.192752+00:00"},{"alias_kind":"pith_short_12","alias_value":"MVI3AGBDJDSI","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"MVI3AGBDJDSIVATS","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"MVI3AGBD","created_at":"2026-05-18T12:28:38.356838+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/MVI3AGBDJDSIVATSQDZX37NKCL","json":"https://pith.science/pith/MVI3AGBDJDSIVATSQDZX37NKCL.json","graph_json":"https://pith.science/api/pith-number/MVI3AGBDJDSIVATSQDZX37NKCL/graph.json","events_json":"https://pith.science/api/pith-number/MVI3AGBDJDSIVATSQDZX37NKCL/events.json","paper":"https://pith.science/paper/MVI3AGBD"},"agent_actions":{"view_html":"https://pith.science/pith/MVI3AGBDJDSIVATSQDZX37NKCL","download_json":"https://pith.science/pith/MVI3AGBDJDSIVATSQDZX37NKCL.json","view_paper":"https://pith.science/paper/MVI3AGBD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.4277&json=true","fetch_graph":"https://pith.science/api/pith-number/MVI3AGBDJDSIVATSQDZX37NKCL/graph.json","fetch_events":"https://pith.science/api/pith-number/MVI3AGBDJDSIVATSQDZX37NKCL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MVI3AGBDJDSIVATSQDZX37NKCL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MVI3AGBDJDSIVATSQDZX37NKCL/action/storage_attestation","attest_author":"https://pith.science/pith/MVI3AGBDJDSIVATSQDZX37NKCL/action/author_attestation","sign_citation":"https://pith.science/pith/MVI3AGBDJDSIVATSQDZX37NKCL/action/citation_signature","submit_replication":"https://pith.science/pith/MVI3AGBDJDSIVATSQDZX37NKCL/action/replication_record"}},"created_at":"2026-05-18T02:33:25.192752+00:00","updated_at":"2026-05-18T02:33:25.192752+00:00"}