{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:ASCQXJ3F3MKSES24VHR5LRIVG3","short_pith_number":"pith:ASCQXJ3F","schema_version":"1.0","canonical_sha256":"04850ba765db15224b5ca9e3d5c51536f0b207e3b9f43200d0e825dee3af5da7","source":{"kind":"arxiv","id":"1603.08876","version":1},"attestation_state":"computed","paper":{"title":"Locally recoverable codes on algebraic curves","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexander Barg, Itzhak Tamo, Serge Vladuts","submitted_at":"2016-03-29T18:32:57Z","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"},"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":"1603.08876","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-29T18:32:57Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d6a42484e397b0d2ab4db612cdb72170395446d41ca7560ee35481cc16c82ef1","abstract_canon_sha256":"097d06593782f81a2ba02fd49d367be75a5f555408c6da4d90efa9077aaae88c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:33.789274Z","signature_b64":"ZnNT5qj/mNAAeEXRb10HmG5dLkSODEKnLGsw+ICQlbpXbS6A62D/AXsO0lv2FKOeiNK4DpPGD+Sd+YtsBc6pDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"04850ba765db15224b5ca9e3d5c51536f0b207e3b9f43200d0e825dee3af5da7","last_reissued_at":"2026-05-18T00:58:33.787934Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:33.787934Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Locally recoverable codes on algebraic curves","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexander Barg, Itzhak Tamo, Serge Vladuts","submitted_at":"2016-03-29T18:32:57Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.08876","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":"1603.08876","created_at":"2026-05-18T00:58:33.788658+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.08876v1","created_at":"2026-05-18T00:58:33.788658+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.08876","created_at":"2026-05-18T00:58:33.788658+00:00"},{"alias_kind":"pith_short_12","alias_value":"ASCQXJ3F3MKS","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_16","alias_value":"ASCQXJ3F3MKSES24","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_8","alias_value":"ASCQXJ3F","created_at":"2026-05-18T12:30:07.202191+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/ASCQXJ3F3MKSES24VHR5LRIVG3","json":"https://pith.science/pith/ASCQXJ3F3MKSES24VHR5LRIVG3.json","graph_json":"https://pith.science/api/pith-number/ASCQXJ3F3MKSES24VHR5LRIVG3/graph.json","events_json":"https://pith.science/api/pith-number/ASCQXJ3F3MKSES24VHR5LRIVG3/events.json","paper":"https://pith.science/paper/ASCQXJ3F"},"agent_actions":{"view_html":"https://pith.science/pith/ASCQXJ3F3MKSES24VHR5LRIVG3","download_json":"https://pith.science/pith/ASCQXJ3F3MKSES24VHR5LRIVG3.json","view_paper":"https://pith.science/paper/ASCQXJ3F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.08876&json=true","fetch_graph":"https://pith.science/api/pith-number/ASCQXJ3F3MKSES24VHR5LRIVG3/graph.json","fetch_events":"https://pith.science/api/pith-number/ASCQXJ3F3MKSES24VHR5LRIVG3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ASCQXJ3F3MKSES24VHR5LRIVG3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ASCQXJ3F3MKSES24VHR5LRIVG3/action/storage_attestation","attest_author":"https://pith.science/pith/ASCQXJ3F3MKSES24VHR5LRIVG3/action/author_attestation","sign_citation":"https://pith.science/pith/ASCQXJ3F3MKSES24VHR5LRIVG3/action/citation_signature","submit_replication":"https://pith.science/pith/ASCQXJ3F3MKSES24VHR5LRIVG3/action/replication_record"}},"created_at":"2026-05-18T00:58:33.788658+00:00","updated_at":"2026-05-18T00:58:33.788658+00:00"}