{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:7UZUWCI2BYEJV5NAHLKVUW24ID","short_pith_number":"pith:7UZUWCI2","canonical_record":{"source":{"id":"1511.06960","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-22T04:09:44Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5d0fc4b42b8fc3fbd6dd8759bd4803bf59c2638a8f538ac3f55fb67dd6f12c0c","abstract_canon_sha256":"cab3e0a535a7f095d045da558d3f98bf60b89f0f0dace13c234abb475b25109d"},"schema_version":"1.0"},"canonical_sha256":"fd334b091a0e089af5a03ad55a5b5c40e25751c2f2f816e5be62bd44c8f1b892","source":{"kind":"arxiv","id":"1511.06960","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:7UZUWCI2BYEJV5NAHLKVUW24ID","target":"record","payload":{"canonical_record":{"source":{"id":"1511.06960","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-22T04:09:44Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5d0fc4b42b8fc3fbd6dd8759bd4803bf59c2638a8f538ac3f55fb67dd6f12c0c","abstract_canon_sha256":"cab3e0a535a7f095d045da558d3f98bf60b89f0f0dace13c234abb475b25109d"},"schema_version":"1.0"},"canonical_sha256":"fd334b091a0e089af5a03ad55a5b5c40e25751c2f2f816e5be62bd44c8f1b892","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:17.059140Z","signature_b64":"EhI2LEEQJkkKR9BxcyvwFZMS/o67F8I92o5QlGx/8RGte1AcPnLaLc8FBzNrLfTC84oSBt0cLRdPg6GB8RJoBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd334b091a0e089af5a03ad55a5b5c40e25751c2f2f816e5be62bd44c8f1b892","last_reissued_at":"2026-05-18T01:26:17.058534Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:17.058534Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.06960","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:26:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t4b0f85qwg06JCcZPf7JkEkqOmKu9Q2RR0ZDKuPK8LNFGGZQ8OEhrzQv/7HCKmr/exVbZ4TT6wNC4x9QMcgNDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:07:41.747875Z"},"content_sha256":"f09f7d7a435f4401555895f3dc1edfc3fb4ee1e3146c10080659684b69dfe453","schema_version":"1.0","event_id":"sha256:f09f7d7a435f4401555895f3dc1edfc3fb4ee1e3146c10080659684b69dfe453"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:7UZUWCI2BYEJV5NAHLKVUW24ID","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Binary Linear Locally Repairable Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Eitan Yaakobi, Hironori Uchikawa, Paul H. Siegel, Pengfei Huang","submitted_at":"2015-11-22T04:09:44Z","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$, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.06960","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:26:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"10Yvf3W8YPL6Hs0JADTiNEYTdehP1nE9RjogkbphVh/4SS0FiXM1kDStuPdH3Y4a60PGIEmEvRD9lmCcOwH2Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:07:41.748226Z"},"content_sha256":"a6a2afe9aa59cf9356946472d556ab3f812fe1a2d4743a5c8206e044c2e98657","schema_version":"1.0","event_id":"sha256:a6a2afe9aa59cf9356946472d556ab3f812fe1a2d4743a5c8206e044c2e98657"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7UZUWCI2BYEJV5NAHLKVUW24ID/bundle.json","state_url":"https://pith.science/pith/7UZUWCI2BYEJV5NAHLKVUW24ID/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7UZUWCI2BYEJV5NAHLKVUW24ID/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-02T22:07:41Z","links":{"resolver":"https://pith.science/pith/7UZUWCI2BYEJV5NAHLKVUW24ID","bundle":"https://pith.science/pith/7UZUWCI2BYEJV5NAHLKVUW24ID/bundle.json","state":"https://pith.science/pith/7UZUWCI2BYEJV5NAHLKVUW24ID/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7UZUWCI2BYEJV5NAHLKVUW24ID/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oJE+mXlmaIQFAn9fmGASfFDBQScDxXKEiG0wmyAlOgC7LDzJs68jgtTup4LVlomjdfWt4MaSDikQNh8drduwAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T22:07:41.750165Z","bundle_sha256":"a5dd666e99033d1494a3ecd2a280493ced92c1c8e122f4a84b59be407fd92d7d"}}