{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:6FPIPJC36XLPRJYOJURQJB4HKD","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":"16562777ba27ec32c114fec50847e24a7fba1683898d4a09e413c3ea7cd973a2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-13T20:38:49Z","title_canon_sha256":"6ba4aac097873d136dc4933839491009c4151c240647abdd578878c0de09fbe6"},"schema_version":"1.0","source":{"id":"1311.3284","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.3284","created_at":"2026-05-18T02:47:52Z"},{"alias_kind":"arxiv_version","alias_value":"1311.3284v2","created_at":"2026-05-18T02:47:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.3284","created_at":"2026-05-18T02:47:52Z"},{"alias_kind":"pith_short_12","alias_value":"6FPIPJC36XLP","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6FPIPJC36XLPRJYO","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6FPIPJC3","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:0c8e64c6975424f2d69e45427430777b4b19693073e81c1ffc56516d3cbcca27","target":"graph","created_at":"2026-05-18T02:47:52Z","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":"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","authors_text":"Alexander Barg, Itzhak Tamo","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-13T20:38:49Z","title":"A family of optimal locally recoverable codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.3284","kind":"arxiv","version":2},"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:35ffa965c4aecfadaca45f03daeffa9535faeee2fce5c29f50bee7e21aff2b8f","target":"record","created_at":"2026-05-18T02:47:52Z","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":"16562777ba27ec32c114fec50847e24a7fba1683898d4a09e413c3ea7cd973a2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-13T20:38:49Z","title_canon_sha256":"6ba4aac097873d136dc4933839491009c4151c240647abdd578878c0de09fbe6"},"schema_version":"1.0","source":{"id":"1311.3284","kind":"arxiv","version":2}},"canonical_sha256":"f15e87a45bf5d6f8a70e4d2304878750d0e161dba2f8c77a3a16975ac4e626d6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f15e87a45bf5d6f8a70e4d2304878750d0e161dba2f8c77a3a16975ac4e626d6","first_computed_at":"2026-05-18T02:47:52.877623Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:47:52.877623Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ldUb0MUBeRHAuv1m92HuhBSLhE/I9mFqO5ZO6EdXuD/FpgIWvACgI2UyNJSDJsajtf9Flb6hnwheAu9Kvpw9Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:47:52.878047Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.3284","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:35ffa965c4aecfadaca45f03daeffa9535faeee2fce5c29f50bee7e21aff2b8f","sha256:0c8e64c6975424f2d69e45427430777b4b19693073e81c1ffc56516d3cbcca27"],"state_sha256":"eb7c9a3b9fefd0e30c2550008c1475f80fa126cf140da633cec41e402f019477"}