{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:L4XYSXZQCBBBPJHYVTNNGSXYT2","short_pith_number":"pith:L4XYSXZQ","schema_version":"1.0","canonical_sha256":"5f2f895f30104217a4f8acdad34af89e80b55a0cc68b40929f86617c90738c10","source":{"kind":"arxiv","id":"1308.3200","version":2},"attestation_state":"computed","paper":{"title":"An Upper Bound On the Size of Locally Recoverable Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Arya Mazumdar, Viveck Cadambe","submitted_at":"2013-08-14T18:25:32Z","abstract_excerpt":"In a {\\em locally recoverable} or {\\em repairable} code, any symbol of a codeword can be recovered by reading only a small (constant) number of other symbols. The notion of local recoverability is important in the area of distributed storage where a most frequent error-event is a single storage node failure (erasure). A common objective is to repair the node by downloading data from as few other storage node as possible. In this paper, we bound the minimum distance of a code in terms of its length, size and locality. Unlike previous bounds, our bound follows from a significantly simple analysi"},"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":"1308.3200","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-08-14T18:25:32Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0de8ac75e6b64e860a7acc499c343a5cc5ce85794c0e3538d5c17836b7ca088a","abstract_canon_sha256":"ae292a50edd1cc5903e63f9f81a4c5f6f3918e77c77866feb1e6523196d39a89"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:42.085675Z","signature_b64":"5W/uppP1o/VQVTD95NUmbvD6L8NpHlnD9rdeSOuC9yHWw7C6KPPzjoUtnGVaPXf1QLMarYx1Lp3ujIFhj0mfBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f2f895f30104217a4f8acdad34af89e80b55a0cc68b40929f86617c90738c10","last_reissued_at":"2026-05-18T00:58:42.084986Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:42.084986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Upper Bound On the Size of Locally Recoverable Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Arya Mazumdar, Viveck Cadambe","submitted_at":"2013-08-14T18:25:32Z","abstract_excerpt":"In a {\\em locally recoverable} or {\\em repairable} code, any symbol of a codeword can be recovered by reading only a small (constant) number of other symbols. The notion of local recoverability is important in the area of distributed storage where a most frequent error-event is a single storage node failure (erasure). A common objective is to repair the node by downloading data from as few other storage node as possible. In this paper, we bound the minimum distance of a code in terms of its length, size and locality. Unlike previous bounds, our bound follows from a significantly simple analysi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.3200","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":"1308.3200","created_at":"2026-05-18T00:58:42.085098+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.3200v2","created_at":"2026-05-18T00:58:42.085098+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.3200","created_at":"2026-05-18T00:58:42.085098+00:00"},{"alias_kind":"pith_short_12","alias_value":"L4XYSXZQCBBB","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_16","alias_value":"L4XYSXZQCBBBPJHY","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_8","alias_value":"L4XYSXZQ","created_at":"2026-05-18T12:27:51.066281+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/L4XYSXZQCBBBPJHYVTNNGSXYT2","json":"https://pith.science/pith/L4XYSXZQCBBBPJHYVTNNGSXYT2.json","graph_json":"https://pith.science/api/pith-number/L4XYSXZQCBBBPJHYVTNNGSXYT2/graph.json","events_json":"https://pith.science/api/pith-number/L4XYSXZQCBBBPJHYVTNNGSXYT2/events.json","paper":"https://pith.science/paper/L4XYSXZQ"},"agent_actions":{"view_html":"https://pith.science/pith/L4XYSXZQCBBBPJHYVTNNGSXYT2","download_json":"https://pith.science/pith/L4XYSXZQCBBBPJHYVTNNGSXYT2.json","view_paper":"https://pith.science/paper/L4XYSXZQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.3200&json=true","fetch_graph":"https://pith.science/api/pith-number/L4XYSXZQCBBBPJHYVTNNGSXYT2/graph.json","fetch_events":"https://pith.science/api/pith-number/L4XYSXZQCBBBPJHYVTNNGSXYT2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L4XYSXZQCBBBPJHYVTNNGSXYT2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L4XYSXZQCBBBPJHYVTNNGSXYT2/action/storage_attestation","attest_author":"https://pith.science/pith/L4XYSXZQCBBBPJHYVTNNGSXYT2/action/author_attestation","sign_citation":"https://pith.science/pith/L4XYSXZQCBBBPJHYVTNNGSXYT2/action/citation_signature","submit_replication":"https://pith.science/pith/L4XYSXZQCBBBPJHYVTNNGSXYT2/action/replication_record"}},"created_at":"2026-05-18T00:58:42.085098+00:00","updated_at":"2026-05-18T00:58:42.085098+00:00"}