{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:ZTVITGMAGBW527LSBCSY2YQ64A","short_pith_number":"pith:ZTVITGMA","schema_version":"1.0","canonical_sha256":"ccea899980306ddd7d7208a58d621ee03dbe3264e62db960ee114c44fdb9f39a","source":{"kind":"arxiv","id":"1307.1961","version":1},"attestation_state":"computed","paper":{"title":"Optimal Locally Repairable Linear Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chau Yuen, Son Hoang Dau, Tiffany Jing Li, Wentu Song","submitted_at":"2013-07-08T07:03:09Z","abstract_excerpt":"Linear erasure codes with local repairability are desirable for distributed data storage systems. An [n, k, d] code having all-symbol (r, \\delta})-locality, denoted as (r, {\\delta})a, is considered optimal if it also meets the minimum Hamming distance bound. The existing results on the existence and the construction of optimal (r, {\\delta})a codes are limited to only the special case of {\\delta} = 2, and to only two small regions within this special case, namely, m = 0 or m >= (v+{\\delta}-1) > ({\\delta}-1), where m = n mod (r+{\\delta}-1) and v = k mod r. This paper investigates the existence c"},"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":"1307.1961","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-08T07:03:09Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"728abc889b02818ae46cc3c366975cfd2679824ec421c85b58fcbb45237ba80b","abstract_canon_sha256":"f4752da2fbffaed2346b9ce42e4a644f500453f2611143be70add7cb4fbb60b6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:19:02.970424Z","signature_b64":"kvqpZvnM831Sqd0JcMQaGB6YP9XpIgUn1kXVPF8w8najZHVDflKKX8xpHMZCCFc22+wsJlWPUbZXpKnXUtHKDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ccea899980306ddd7d7208a58d621ee03dbe3264e62db960ee114c44fdb9f39a","last_reissued_at":"2026-05-18T03:19:02.969957Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:19:02.969957Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Locally Repairable Linear Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chau Yuen, Son Hoang Dau, Tiffany Jing Li, Wentu Song","submitted_at":"2013-07-08T07:03:09Z","abstract_excerpt":"Linear erasure codes with local repairability are desirable for distributed data storage systems. An [n, k, d] code having all-symbol (r, \\delta})-locality, denoted as (r, {\\delta})a, is considered optimal if it also meets the minimum Hamming distance bound. The existing results on the existence and the construction of optimal (r, {\\delta})a codes are limited to only the special case of {\\delta} = 2, and to only two small regions within this special case, namely, m = 0 or m >= (v+{\\delta}-1) > ({\\delta}-1), where m = n mod (r+{\\delta}-1) and v = k mod r. This paper investigates the existence c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.1961","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":"1307.1961","created_at":"2026-05-18T03:19:02.970024+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.1961v1","created_at":"2026-05-18T03:19:02.970024+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.1961","created_at":"2026-05-18T03:19:02.970024+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZTVITGMAGBW5","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZTVITGMAGBW527LS","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZTVITGMA","created_at":"2026-05-18T12:28:09.283467+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/ZTVITGMAGBW527LSBCSY2YQ64A","json":"https://pith.science/pith/ZTVITGMAGBW527LSBCSY2YQ64A.json","graph_json":"https://pith.science/api/pith-number/ZTVITGMAGBW527LSBCSY2YQ64A/graph.json","events_json":"https://pith.science/api/pith-number/ZTVITGMAGBW527LSBCSY2YQ64A/events.json","paper":"https://pith.science/paper/ZTVITGMA"},"agent_actions":{"view_html":"https://pith.science/pith/ZTVITGMAGBW527LSBCSY2YQ64A","download_json":"https://pith.science/pith/ZTVITGMAGBW527LSBCSY2YQ64A.json","view_paper":"https://pith.science/paper/ZTVITGMA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.1961&json=true","fetch_graph":"https://pith.science/api/pith-number/ZTVITGMAGBW527LSBCSY2YQ64A/graph.json","fetch_events":"https://pith.science/api/pith-number/ZTVITGMAGBW527LSBCSY2YQ64A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZTVITGMAGBW527LSBCSY2YQ64A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZTVITGMAGBW527LSBCSY2YQ64A/action/storage_attestation","attest_author":"https://pith.science/pith/ZTVITGMAGBW527LSBCSY2YQ64A/action/author_attestation","sign_citation":"https://pith.science/pith/ZTVITGMAGBW527LSBCSY2YQ64A/action/citation_signature","submit_replication":"https://pith.science/pith/ZTVITGMAGBW527LSBCSY2YQ64A/action/replication_record"}},"created_at":"2026-05-18T03:19:02.970024+00:00","updated_at":"2026-05-18T03:19:02.970024+00:00"}