{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:7UZUWCI2BYEJV5NAHLKVUW24ID","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":"cab3e0a535a7f095d045da558d3f98bf60b89f0f0dace13c234abb475b25109d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-22T04:09:44Z","title_canon_sha256":"5d0fc4b42b8fc3fbd6dd8759bd4803bf59c2638a8f538ac3f55fb67dd6f12c0c"},"schema_version":"1.0","source":{"id":"1511.06960","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.06960","created_at":"2026-05-18T01:26:17Z"},{"alias_kind":"arxiv_version","alias_value":"1511.06960v1","created_at":"2026-05-18T01:26:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.06960","created_at":"2026-05-18T01:26:17Z"},{"alias_kind":"pith_short_12","alias_value":"7UZUWCI2BYEJ","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7UZUWCI2BYEJV5NA","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7UZUWCI2","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:a6a2afe9aa59cf9356946472d556ab3f812fe1a2d4743a5c8206e044c2e98657","target":"graph","created_at":"2026-05-18T01:26:17Z","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":"Locally repairable codes (LRCs) are a class of codes designed for the local correction of erasures. They have received considerable attention in recent years due to their applications in distributed storage. Most existing results on LRCs do not explicitly take into consideration the field size $q$, i.e., the size of the code alphabet. In particular, for the binary case, only a few results are known.\n  In this work, we present an upper bound on the minimum distance $d$ of linear LRCs with availability, based on the work of Cadambe and Mazumdar. The bound takes into account the code length $n$, ","authors_text":"Eitan Yaakobi, Hironori Uchikawa, Paul H. Siegel, Pengfei Huang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-22T04:09:44Z","title":"Binary Linear Locally Repairable Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.06960","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:f09f7d7a435f4401555895f3dc1edfc3fb4ee1e3146c10080659684b69dfe453","target":"record","created_at":"2026-05-18T01:26:17Z","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":"cab3e0a535a7f095d045da558d3f98bf60b89f0f0dace13c234abb475b25109d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-22T04:09:44Z","title_canon_sha256":"5d0fc4b42b8fc3fbd6dd8759bd4803bf59c2638a8f538ac3f55fb67dd6f12c0c"},"schema_version":"1.0","source":{"id":"1511.06960","kind":"arxiv","version":1}},"canonical_sha256":"fd334b091a0e089af5a03ad55a5b5c40e25751c2f2f816e5be62bd44c8f1b892","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fd334b091a0e089af5a03ad55a5b5c40e25751c2f2f816e5be62bd44c8f1b892","first_computed_at":"2026-05-18T01:26:17.058534Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:26:17.058534Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EhI2LEEQJkkKR9BxcyvwFZMS/o67F8I92o5QlGx/8RGte1AcPnLaLc8FBzNrLfTC84oSBt0cLRdPg6GB8RJoBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:26:17.059140Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.06960","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f09f7d7a435f4401555895f3dc1edfc3fb4ee1e3146c10080659684b69dfe453","sha256:a6a2afe9aa59cf9356946472d556ab3f812fe1a2d4743a5c8206e044c2e98657"],"state_sha256":"0ba548763a8d1a5865501d5459f7d4101d63858ec494210fdfe9ef50dcec6fd5"}