{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:6FPIPJC36XLPRJYOJURQJB4HKD","short_pith_number":"pith:6FPIPJC3","schema_version":"1.0","canonical_sha256":"f15e87a45bf5d6f8a70e4d2304878750d0e161dba2f8c77a3a16975ac4e626d6","source":{"kind":"arxiv","id":"1311.3284","version":2},"attestation_state":"computed","paper":{"title":"A family of optimal locally recoverable codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexander Barg, Itzhak Tamo","submitted_at":"2013-11-13T20:38:49Z","abstract_excerpt":"A code over a finite alphabet is called locally recoverable (LRC) if every symbol in the encoding is a function of a small number (at most $r$) other symbols. We present a family of LRC codes that attain the maximum possible value of the distance for a given locality parameter and code cardinality. The codewords are obtained as evaluations of specially constructed polynomials over a finite field, and reduce to a Reed-Solomon code if the locality parameter $r$ is set to be equal to the code dimension. The size of the code alphabet for most parameters is only slightly greater than the code lengt"},"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":"1311.3284","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-13T20:38:49Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6ba4aac097873d136dc4933839491009c4151c240647abdd578878c0de09fbe6","abstract_canon_sha256":"16562777ba27ec32c114fec50847e24a7fba1683898d4a09e413c3ea7cd973a2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:52.878047Z","signature_b64":"ldUb0MUBeRHAuv1m92HuhBSLhE/I9mFqO5ZO6EdXuD/FpgIWvACgI2UyNJSDJsajtf9Flb6hnwheAu9Kvpw9Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f15e87a45bf5d6f8a70e4d2304878750d0e161dba2f8c77a3a16975ac4e626d6","last_reissued_at":"2026-05-18T02:47:52.877623Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:52.877623Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A family of optimal locally recoverable codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexander Barg, Itzhak Tamo","submitted_at":"2013-11-13T20:38:49Z","abstract_excerpt":"A code over a finite alphabet is called locally recoverable (LRC) if every symbol in the encoding is a function of a small number (at most $r$) other symbols. We present a family of LRC codes that attain the maximum possible value of the distance for a given locality parameter and code cardinality. The codewords are obtained as evaluations of specially constructed polynomials over a finite field, and reduce to a Reed-Solomon code if the locality parameter $r$ is set to be equal to the code dimension. The size of the code alphabet for most parameters is only slightly greater than the code lengt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.3284","kind":"arxiv","version":2},"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":"1311.3284","created_at":"2026-05-18T02:47:52.877680+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.3284v2","created_at":"2026-05-18T02:47:52.877680+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.3284","created_at":"2026-05-18T02:47:52.877680+00:00"},{"alias_kind":"pith_short_12","alias_value":"6FPIPJC36XLP","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_16","alias_value":"6FPIPJC36XLPRJYO","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_8","alias_value":"6FPIPJC3","created_at":"2026-05-18T12:27:36.564083+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/6FPIPJC36XLPRJYOJURQJB4HKD","json":"https://pith.science/pith/6FPIPJC36XLPRJYOJURQJB4HKD.json","graph_json":"https://pith.science/api/pith-number/6FPIPJC36XLPRJYOJURQJB4HKD/graph.json","events_json":"https://pith.science/api/pith-number/6FPIPJC36XLPRJYOJURQJB4HKD/events.json","paper":"https://pith.science/paper/6FPIPJC3"},"agent_actions":{"view_html":"https://pith.science/pith/6FPIPJC36XLPRJYOJURQJB4HKD","download_json":"https://pith.science/pith/6FPIPJC36XLPRJYOJURQJB4HKD.json","view_paper":"https://pith.science/paper/6FPIPJC3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.3284&json=true","fetch_graph":"https://pith.science/api/pith-number/6FPIPJC36XLPRJYOJURQJB4HKD/graph.json","fetch_events":"https://pith.science/api/pith-number/6FPIPJC36XLPRJYOJURQJB4HKD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6FPIPJC36XLPRJYOJURQJB4HKD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6FPIPJC36XLPRJYOJURQJB4HKD/action/storage_attestation","attest_author":"https://pith.science/pith/6FPIPJC36XLPRJYOJURQJB4HKD/action/author_attestation","sign_citation":"https://pith.science/pith/6FPIPJC36XLPRJYOJURQJB4HKD/action/citation_signature","submit_replication":"https://pith.science/pith/6FPIPJC36XLPRJYOJURQJB4HKD/action/replication_record"}},"created_at":"2026-05-18T02:47:52.877680+00:00","updated_at":"2026-05-18T02:47:52.877680+00:00"}