{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:C2RHIPELCSLCFNLVV3RQBBPSB4","short_pith_number":"pith:C2RHIPEL","schema_version":"1.0","canonical_sha256":"16a2743c8b149622b575aee30085f20f2b0fe8d9bf1f66e4530156fb3ccae36e","source":{"kind":"arxiv","id":"1505.05124","version":2},"attestation_state":"computed","paper":{"title":"Locally Repairable Regenerating Codes: Node Unavailability and the Insufficiency of Stationary Local Repair","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chih-Chun Wang, Imad Ahmad","submitted_at":"2015-05-19T19:30:24Z","abstract_excerpt":"Locally repairable codes (LRCs) are ingeniously designed distributed storage codes with a (usually small) fixed set of helper nodes participating in repair. Since most existing LRCs assume exact repair and allow full exchange of the stored data ($\\beta=\\alpha$) from the helper nodes, they can be viewed as a generalization of the traditional erasure codes (ECs) with a much desired feature of local repairability via predetermined sets of helpers. However, it also means that they lack the features of (i) functional repair, and (ii) partial information-exchange ($\\beta<\\alpha$) in the original reg"},"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":"1505.05124","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-19T19:30:24Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4e5d6f273d9ff68a32ab0f4fbfb4230a73835fdff7f6bf97a14d5c557eaffd05","abstract_canon_sha256":"d4ee25767a71bb7a167abcbe4548c8e3e486a0a1a0d743adda54ecbad43ccc11"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:36.262392Z","signature_b64":"0BS2RowiUUSIRDZ8EZmG51U98nmtqyAHrwlcLvQUPWTmy4Q0WG9oXImOFsOa/kZgiE5ycifK04HgtjzfS7fuDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"16a2743c8b149622b575aee30085f20f2b0fe8d9bf1f66e4530156fb3ccae36e","last_reissued_at":"2026-05-18T01:15:36.261812Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:36.261812Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Locally Repairable Regenerating Codes: Node Unavailability and the Insufficiency of Stationary Local Repair","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chih-Chun Wang, Imad Ahmad","submitted_at":"2015-05-19T19:30:24Z","abstract_excerpt":"Locally repairable codes (LRCs) are ingeniously designed distributed storage codes with a (usually small) fixed set of helper nodes participating in repair. Since most existing LRCs assume exact repair and allow full exchange of the stored data ($\\beta=\\alpha$) from the helper nodes, they can be viewed as a generalization of the traditional erasure codes (ECs) with a much desired feature of local repairability via predetermined sets of helpers. However, it also means that they lack the features of (i) functional repair, and (ii) partial information-exchange ($\\beta<\\alpha$) in the original reg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.05124","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":"1505.05124","created_at":"2026-05-18T01:15:36.261907+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.05124v2","created_at":"2026-05-18T01:15:36.261907+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.05124","created_at":"2026-05-18T01:15:36.261907+00:00"},{"alias_kind":"pith_short_12","alias_value":"C2RHIPELCSLC","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"C2RHIPELCSLCFNLV","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"C2RHIPEL","created_at":"2026-05-18T12:29:14.074870+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/C2RHIPELCSLCFNLVV3RQBBPSB4","json":"https://pith.science/pith/C2RHIPELCSLCFNLVV3RQBBPSB4.json","graph_json":"https://pith.science/api/pith-number/C2RHIPELCSLCFNLVV3RQBBPSB4/graph.json","events_json":"https://pith.science/api/pith-number/C2RHIPELCSLCFNLVV3RQBBPSB4/events.json","paper":"https://pith.science/paper/C2RHIPEL"},"agent_actions":{"view_html":"https://pith.science/pith/C2RHIPELCSLCFNLVV3RQBBPSB4","download_json":"https://pith.science/pith/C2RHIPELCSLCFNLVV3RQBBPSB4.json","view_paper":"https://pith.science/paper/C2RHIPEL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.05124&json=true","fetch_graph":"https://pith.science/api/pith-number/C2RHIPELCSLCFNLVV3RQBBPSB4/graph.json","fetch_events":"https://pith.science/api/pith-number/C2RHIPELCSLCFNLVV3RQBBPSB4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C2RHIPELCSLCFNLVV3RQBBPSB4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C2RHIPELCSLCFNLVV3RQBBPSB4/action/storage_attestation","attest_author":"https://pith.science/pith/C2RHIPELCSLCFNLVV3RQBBPSB4/action/author_attestation","sign_citation":"https://pith.science/pith/C2RHIPELCSLCFNLVV3RQBBPSB4/action/citation_signature","submit_replication":"https://pith.science/pith/C2RHIPELCSLCFNLVV3RQBBPSB4/action/replication_record"}},"created_at":"2026-05-18T01:15:36.261907+00:00","updated_at":"2026-05-18T01:15:36.261907+00:00"}