{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:IEBFN4MDV2C7NJWAFUMO4R7773","short_pith_number":"pith:IEBFN4MD","schema_version":"1.0","canonical_sha256":"410256f183ae85f6a6c02d18ee47fffee2b4e49afdb6131edaf9b39857fded51","source":{"kind":"arxiv","id":"1502.01414","version":1},"attestation_state":"computed","paper":{"title":"Cyclic LRC Codes and their Subfield Subcodes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexander Barg, Itzhak Tamo, Robert Calderbank, Sreechakra Goparaju","submitted_at":"2015-02-05T02:51:33Z","abstract_excerpt":"We consider linear cyclic codes with the locality property, or locally recoverable codes (LRC codes). A family of LRC codes that generalizes the classical construction of Reed-Solomon codes was constructed in a recent paper by I. Tamo and A. Barg (IEEE Transactions on Information Theory, no. 8, 2014; arXiv:1311.3284). In this paper we focus on the optimal cyclic codes that arise from the general construction. We give a characterization of these codes in terms of their zeros, and observe that there are many equivalent ways of constructing optimal cyclic LRC codes over a given field. We also stu"},"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":"1502.01414","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-02-05T02:51:33Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"530865199ecc4b7655981e80107ae35b0d60d948ece229c2d65d34f1a2698ce6","abstract_canon_sha256":"c8801f1adbff10788189629ce1b72a1aa1aa2c4127f6a88483edf4c6d72a2b81"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:56.615138Z","signature_b64":"kjf2NqkEBEXHQxKhJ5MGq7dg9QvXV1KvmDq3yzJk6jdGvHvwVbtC4G459LP5hV88Pd+Tq6XPhWAAh8H4RP2FAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"410256f183ae85f6a6c02d18ee47fffee2b4e49afdb6131edaf9b39857fded51","last_reissued_at":"2026-05-18T02:27:56.614696Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:56.614696Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cyclic LRC Codes and their Subfield Subcodes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexander Barg, Itzhak Tamo, Robert Calderbank, Sreechakra Goparaju","submitted_at":"2015-02-05T02:51:33Z","abstract_excerpt":"We consider linear cyclic codes with the locality property, or locally recoverable codes (LRC codes). A family of LRC codes that generalizes the classical construction of Reed-Solomon codes was constructed in a recent paper by I. Tamo and A. Barg (IEEE Transactions on Information Theory, no. 8, 2014; arXiv:1311.3284). In this paper we focus on the optimal cyclic codes that arise from the general construction. We give a characterization of these codes in terms of their zeros, and observe that there are many equivalent ways of constructing optimal cyclic LRC codes over a given field. We also stu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.01414","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":"1502.01414","created_at":"2026-05-18T02:27:56.614767+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.01414v1","created_at":"2026-05-18T02:27:56.614767+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.01414","created_at":"2026-05-18T02:27:56.614767+00:00"},{"alias_kind":"pith_short_12","alias_value":"IEBFN4MDV2C7","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"IEBFN4MDV2C7NJWA","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"IEBFN4MD","created_at":"2026-05-18T12:29:25.134429+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/IEBFN4MDV2C7NJWAFUMO4R7773","json":"https://pith.science/pith/IEBFN4MDV2C7NJWAFUMO4R7773.json","graph_json":"https://pith.science/api/pith-number/IEBFN4MDV2C7NJWAFUMO4R7773/graph.json","events_json":"https://pith.science/api/pith-number/IEBFN4MDV2C7NJWAFUMO4R7773/events.json","paper":"https://pith.science/paper/IEBFN4MD"},"agent_actions":{"view_html":"https://pith.science/pith/IEBFN4MDV2C7NJWAFUMO4R7773","download_json":"https://pith.science/pith/IEBFN4MDV2C7NJWAFUMO4R7773.json","view_paper":"https://pith.science/paper/IEBFN4MD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.01414&json=true","fetch_graph":"https://pith.science/api/pith-number/IEBFN4MDV2C7NJWAFUMO4R7773/graph.json","fetch_events":"https://pith.science/api/pith-number/IEBFN4MDV2C7NJWAFUMO4R7773/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IEBFN4MDV2C7NJWAFUMO4R7773/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IEBFN4MDV2C7NJWAFUMO4R7773/action/storage_attestation","attest_author":"https://pith.science/pith/IEBFN4MDV2C7NJWAFUMO4R7773/action/author_attestation","sign_citation":"https://pith.science/pith/IEBFN4MDV2C7NJWAFUMO4R7773/action/citation_signature","submit_replication":"https://pith.science/pith/IEBFN4MDV2C7NJWAFUMO4R7773/action/replication_record"}},"created_at":"2026-05-18T02:27:56.614767+00:00","updated_at":"2026-05-18T02:27:56.614767+00:00"}