{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:E6NEFSE3YS4QCWB4M5C42JFGSS","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":"2d27514035eff32fd40eba3547648791a19c00885a4367e6d3a150ea5f56ba79","cross_cats_sorted":["math.AG","math.IT","math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-20T18:22:31Z","title_canon_sha256":"d6a42484e397b0d2ab4db612cdb72170395446d41ca7560ee35481cc16c82ef1"},"schema_version":"1.0","source":{"id":"1501.04904","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.04904","created_at":"2026-05-18T02:16:20Z"},{"alias_kind":"arxiv_version","alias_value":"1501.04904v2","created_at":"2026-05-18T02:16:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.04904","created_at":"2026-05-18T02:16:20Z"},{"alias_kind":"pith_short_12","alias_value":"E6NEFSE3YS4Q","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"E6NEFSE3YS4QCWB4","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"E6NEFSE3","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:b40d872e7b707c7b0e75e36b5612f1f8c0e59a0fcbe427e689622ba8b91008fb","target":"graph","created_at":"2026-05-18T02:16:20Z","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 code) if every symbol in the encoding is a function of a small number (at most r) other symbols. A family of linear LRC codes that generalize the classic construction of Reed-Solomon codes was constructed in a recent paper by I. Tamo and A. Barg. In this paper we extend this construction to codes on algebraic curves. We give a general construction of LRC codes on curves and compute some examples, including asymptotically good families of codes derived from the Garcia- Stichtenoth towers. The local recovery procedure is performed ","authors_text":"Alexander Barg, Itzhak Tamo, Serge Vladut","cross_cats":["math.AG","math.IT","math.NT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-20T18:22:31Z","title":"Locally recoverable codes on algebraic curves"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.04904","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:9e715a830dc5049f397c85e131cf48c27d2b025c1fe8710ef920663a876bb5a9","target":"record","created_at":"2026-05-18T02:16:20Z","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":"2d27514035eff32fd40eba3547648791a19c00885a4367e6d3a150ea5f56ba79","cross_cats_sorted":["math.AG","math.IT","math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-20T18:22:31Z","title_canon_sha256":"d6a42484e397b0d2ab4db612cdb72170395446d41ca7560ee35481cc16c82ef1"},"schema_version":"1.0","source":{"id":"1501.04904","kind":"arxiv","version":2}},"canonical_sha256":"279a42c89bc4b901583c6745cd24a694a568c538b50a0e97ee9158be5c6a0765","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"279a42c89bc4b901583c6745cd24a694a568c538b50a0e97ee9158be5c6a0765","first_computed_at":"2026-05-18T02:16:20.337914Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:16:20.337914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"N3mq0bXOQ1cV2FUGhHiuJy1fRq19xcG2KSTlSOi9bkqTxQsNvm0rE803OrN3xXQXVRk+RlPtUXe9fP9/0fjPAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:16:20.338529Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.04904","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9e715a830dc5049f397c85e131cf48c27d2b025c1fe8710ef920663a876bb5a9","sha256:b40d872e7b707c7b0e75e36b5612f1f8c0e59a0fcbe427e689622ba8b91008fb"],"state_sha256":"edb6ea0b1268f437e5b03aa2764b6b856be7faba33917ea02ce8bdd786bb7a60"}