{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:O4Z7SDBHLRYRZEKKHMZV75IUDD","short_pith_number":"pith:O4Z7SDBH","schema_version":"1.0","canonical_sha256":"7733f90c275c711c914a3b335ff51418e87aef944670b3b58119d6b3785a84a6","source":{"kind":"arxiv","id":"1702.02685","version":2},"attestation_state":"computed","paper":{"title":"Combinatorial Alphabet-Dependent Bounds for Locally Recoverable Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.IT"],"primary_cat":"cs.IT","authors_text":"Abhishek Agarwal, Alexander Barg, Arya Mazumdar, Itzhak Tamo, Sihuang Hu","submitted_at":"2017-02-09T03:01:41Z","abstract_excerpt":"Locally recoverable (LRC) codes have recently been a focus point of research in coding theory due to their theoretical appeal and applications in distributed storage systems. In an LRC code, any erased symbol of a codeword can be recovered by accessing only a small number of other symbols. For LRC codes over a small alphabet (such as binary), the optimal rate-distance trade-off is unknown. We present several new combinatorial bounds on LRC codes including the locality-aware sphere packing and Plotkin bounds. We also develop an approach to linear programming (LP) bounds on LRC codes. The result"},"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":"1702.02685","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-09T03:01:41Z","cross_cats_sorted":["cs.DM","math.IT"],"title_canon_sha256":"d175f21e87feac102b1d64a41a8a7d2087c379d0f778e4efcaf10e098c118858","abstract_canon_sha256":"9784dce7b1cb4c7d406c53ed68fca8bd68d043211a396c499bf8eacc3afd44fb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:59.432006Z","signature_b64":"NV/NuSPr93m0Ee0JRX/eKoDSm4tz7dubCXkhj1Xdn13nvcuVroCclb5NW76JYASob2r9PTv8afh+0izWHHiNBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7733f90c275c711c914a3b335ff51418e87aef944670b3b58119d6b3785a84a6","last_reissued_at":"2026-05-18T00:15:59.431403Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:59.431403Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Combinatorial Alphabet-Dependent Bounds for Locally Recoverable Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.IT"],"primary_cat":"cs.IT","authors_text":"Abhishek Agarwal, Alexander Barg, Arya Mazumdar, Itzhak Tamo, Sihuang Hu","submitted_at":"2017-02-09T03:01:41Z","abstract_excerpt":"Locally recoverable (LRC) codes have recently been a focus point of research in coding theory due to their theoretical appeal and applications in distributed storage systems. In an LRC code, any erased symbol of a codeword can be recovered by accessing only a small number of other symbols. For LRC codes over a small alphabet (such as binary), the optimal rate-distance trade-off is unknown. We present several new combinatorial bounds on LRC codes including the locality-aware sphere packing and Plotkin bounds. We also develop an approach to linear programming (LP) bounds on LRC codes. The result"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.02685","kind":"arxiv","version":2},"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":"1702.02685","created_at":"2026-05-18T00:15:59.431505+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.02685v2","created_at":"2026-05-18T00:15:59.431505+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.02685","created_at":"2026-05-18T00:15:59.431505+00:00"},{"alias_kind":"pith_short_12","alias_value":"O4Z7SDBHLRYR","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"O4Z7SDBHLRYRZEKK","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"O4Z7SDBH","created_at":"2026-05-18T12:31:34.259226+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/O4Z7SDBHLRYRZEKKHMZV75IUDD","json":"https://pith.science/pith/O4Z7SDBHLRYRZEKKHMZV75IUDD.json","graph_json":"https://pith.science/api/pith-number/O4Z7SDBHLRYRZEKKHMZV75IUDD/graph.json","events_json":"https://pith.science/api/pith-number/O4Z7SDBHLRYRZEKKHMZV75IUDD/events.json","paper":"https://pith.science/paper/O4Z7SDBH"},"agent_actions":{"view_html":"https://pith.science/pith/O4Z7SDBHLRYRZEKKHMZV75IUDD","download_json":"https://pith.science/pith/O4Z7SDBHLRYRZEKKHMZV75IUDD.json","view_paper":"https://pith.science/paper/O4Z7SDBH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.02685&json=true","fetch_graph":"https://pith.science/api/pith-number/O4Z7SDBHLRYRZEKKHMZV75IUDD/graph.json","fetch_events":"https://pith.science/api/pith-number/O4Z7SDBHLRYRZEKKHMZV75IUDD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O4Z7SDBHLRYRZEKKHMZV75IUDD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O4Z7SDBHLRYRZEKKHMZV75IUDD/action/storage_attestation","attest_author":"https://pith.science/pith/O4Z7SDBHLRYRZEKKHMZV75IUDD/action/author_attestation","sign_citation":"https://pith.science/pith/O4Z7SDBHLRYRZEKKHMZV75IUDD/action/citation_signature","submit_replication":"https://pith.science/pith/O4Z7SDBHLRYRZEKKHMZV75IUDD/action/replication_record"}},"created_at":"2026-05-18T00:15:59.431505+00:00","updated_at":"2026-05-18T00:15:59.431505+00:00"}