{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:VLETNVITYLVDYM4X5YX3W2I4U4","short_pith_number":"pith:VLETNVIT","schema_version":"1.0","canonical_sha256":"aac936d513c2ea3c3397ee2fbb691ca72c6d1c1e08521b1ecf0bbbb67c66d709","source":{"kind":"arxiv","id":"1702.05730","version":1},"attestation_state":"computed","paper":{"title":"On Optimal Ternary Locally Repairable Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bin Chen, Jie Hao, Shu-Tao Xia","submitted_at":"2017-02-19T10:02:02Z","abstract_excerpt":"In an $[n,k,d]$ linear code, a code symbol is said to have locality $r$ if it can be repaired by accessing at most $r$ other code symbols. For an $(n,k,r)$ \\emph{locally repairable code} (LRC), the minimum distance satisfies the well-known Singleton-like bound $d\\le n-k-\\lceil k/r\\rceil +2$. In this paper, we study optimal ternary LRCs meeting this Singleton-like bound by employing a parity-check matrix approach. It is proved that there are only $8$ classes of possible parameters with which optimal ternary LRCs exist. Moreover, we obtain explicit constructions of optimal ternary LRCs for all t"},"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":"1702.05730","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-19T10:02:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7ef5779dea16bb988c1c0618b4b8de8fcf0dccb63de3c468f25d30b132b57ce9","abstract_canon_sha256":"0d37c9ed392d8a8809b83e689ef9a3d4c00812943d5fddc6d279e99ef3cc3bb6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:25.470651Z","signature_b64":"HH4c+4d2xdqZQnVwMuREb+VLMJgnfw15t5FKRhp2C5WAynU1/Hf77u0d4a9Q0Gl5RvVwBXnd31VDhNLHk7zNDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aac936d513c2ea3c3397ee2fbb691ca72c6d1c1e08521b1ecf0bbbb67c66d709","last_reissued_at":"2026-05-18T00:50:25.469940Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:25.469940Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Optimal Ternary Locally Repairable Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bin Chen, Jie Hao, Shu-Tao Xia","submitted_at":"2017-02-19T10:02:02Z","abstract_excerpt":"In an $[n,k,d]$ linear code, a code symbol is said to have locality $r$ if it can be repaired by accessing at most $r$ other code symbols. For an $(n,k,r)$ \\emph{locally repairable code} (LRC), the minimum distance satisfies the well-known Singleton-like bound $d\\le n-k-\\lceil k/r\\rceil +2$. In this paper, we study optimal ternary LRCs meeting this Singleton-like bound by employing a parity-check matrix approach. It is proved that there are only $8$ classes of possible parameters with which optimal ternary LRCs exist. Moreover, we obtain explicit constructions of optimal ternary LRCs for all t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.05730","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":"1702.05730","created_at":"2026-05-18T00:50:25.470101+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.05730v1","created_at":"2026-05-18T00:50:25.470101+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.05730","created_at":"2026-05-18T00:50:25.470101+00:00"},{"alias_kind":"pith_short_12","alias_value":"VLETNVITYLVD","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"VLETNVITYLVDYM4X","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"VLETNVIT","created_at":"2026-05-18T12:31:49.984773+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/VLETNVITYLVDYM4X5YX3W2I4U4","json":"https://pith.science/pith/VLETNVITYLVDYM4X5YX3W2I4U4.json","graph_json":"https://pith.science/api/pith-number/VLETNVITYLVDYM4X5YX3W2I4U4/graph.json","events_json":"https://pith.science/api/pith-number/VLETNVITYLVDYM4X5YX3W2I4U4/events.json","paper":"https://pith.science/paper/VLETNVIT"},"agent_actions":{"view_html":"https://pith.science/pith/VLETNVITYLVDYM4X5YX3W2I4U4","download_json":"https://pith.science/pith/VLETNVITYLVDYM4X5YX3W2I4U4.json","view_paper":"https://pith.science/paper/VLETNVIT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.05730&json=true","fetch_graph":"https://pith.science/api/pith-number/VLETNVITYLVDYM4X5YX3W2I4U4/graph.json","fetch_events":"https://pith.science/api/pith-number/VLETNVITYLVDYM4X5YX3W2I4U4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VLETNVITYLVDYM4X5YX3W2I4U4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VLETNVITYLVDYM4X5YX3W2I4U4/action/storage_attestation","attest_author":"https://pith.science/pith/VLETNVITYLVDYM4X5YX3W2I4U4/action/author_attestation","sign_citation":"https://pith.science/pith/VLETNVITYLVDYM4X5YX3W2I4U4/action/citation_signature","submit_replication":"https://pith.science/pith/VLETNVITYLVDYM4X5YX3W2I4U4/action/replication_record"}},"created_at":"2026-05-18T00:50:25.470101+00:00","updated_at":"2026-05-18T00:50:25.470101+00:00"}