{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ASCQXJ3F3MKSES24VHR5LRIVG3","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":"097d06593782f81a2ba02fd49d367be75a5f555408c6da4d90efa9077aaae88c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-29T18:32:57Z","title_canon_sha256":"d6a42484e397b0d2ab4db612cdb72170395446d41ca7560ee35481cc16c82ef1"},"schema_version":"1.0","source":{"id":"1603.08876","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.08876","created_at":"2026-05-18T00:58:33Z"},{"alias_kind":"arxiv_version","alias_value":"1603.08876v1","created_at":"2026-05-18T00:58:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.08876","created_at":"2026-05-18T00:58:33Z"},{"alias_kind":"pith_short_12","alias_value":"ASCQXJ3F3MKS","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"ASCQXJ3F3MKSES24","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"ASCQXJ3F","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:4ea995be3fedac4007c92dccd79a1b17934686399a918d7f89ca7f229c003719","target":"graph","created_at":"2026-05-18T00:58:33Z","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 of the codeword. In this paper we introduce a construction of LRC codes on algebraic curves, extending a recent construction of Reed-Solomon like codes with locality. We treat the following situations: local recovery of a single erasure, local recovery of multiple erasures, and codes with several disjoint recovery sets for every coordinate (the {\\em availability problem}). For each of these three problems we describe a general constr","authors_text":"Alexander Barg, Itzhak Tamo, Serge Vladuts","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-29T18:32:57Z","title":"Locally recoverable codes on algebraic curves"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.08876","kind":"arxiv","version":1},"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:71c9012e9404083faab6de3210ff752ab6017a143bbfe144ba0ab6f7b77952d6","target":"record","created_at":"2026-05-18T00:58:33Z","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":"097d06593782f81a2ba02fd49d367be75a5f555408c6da4d90efa9077aaae88c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-29T18:32:57Z","title_canon_sha256":"d6a42484e397b0d2ab4db612cdb72170395446d41ca7560ee35481cc16c82ef1"},"schema_version":"1.0","source":{"id":"1603.08876","kind":"arxiv","version":1}},"canonical_sha256":"04850ba765db15224b5ca9e3d5c51536f0b207e3b9f43200d0e825dee3af5da7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"04850ba765db15224b5ca9e3d5c51536f0b207e3b9f43200d0e825dee3af5da7","first_computed_at":"2026-05-18T00:58:33.787934Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:33.787934Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZnNT5qj/mNAAeEXRb10HmG5dLkSODEKnLGsw+ICQlbpXbS6A62D/AXsO0lv2FKOeiNK4DpPGD+Sd+YtsBc6pDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:33.789274Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.08876","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:71c9012e9404083faab6de3210ff752ab6017a143bbfe144ba0ab6f7b77952d6","sha256:4ea995be3fedac4007c92dccd79a1b17934686399a918d7f89ca7f229c003719"],"state_sha256":"90e8938e1e039b048b3378b96a1d69c64c6202ce076dac71588ca82c7e2d1f37"}