{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:SN5SQFEG7C24IAHDJUKN4ZRVF3","short_pith_number":"pith:SN5SQFEG","schema_version":"1.0","canonical_sha256":"937b281486f8b5c400e34d14de66352eed9d026172697e8784c293f7b601f070","source":{"kind":"arxiv","id":"1409.3900","version":2},"attestation_state":"computed","paper":{"title":"Cooperative Local Repair in Distributed Storage","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ankit Singh Rawat, Arya Mazumdar, Sriram Vishwanath","submitted_at":"2014-09-13T02:15:34Z","abstract_excerpt":"Erasure-correcting codes, that support local repair of codeword symbols, have attracted substantial attention recently for their application in distributed storage systems. This paper investigates a generalization of the usual locally repairable codes. In particular, this paper studies a class of codes with the following property: any small set of codeword symbols can be reconstructed (repaired) from a small number of other symbols. This is referred to as cooperative local repair. The main contribution of this paper is bounds on the trade-off of the minimum distance and the dimension of such c"},"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":"1409.3900","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-09-13T02:15:34Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a0edd3ea88019114db7b8217b1b61e90867bf02b24b12339944d9a705641d7a6","abstract_canon_sha256":"d0f2eeb0716ad186be37c5030e5c70d29e304f62764c20b35a1f834510bc5db5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:49.360900Z","signature_b64":"qEfP3vBgJt1OPzybnB1uKZj+8ckdRGtbkpGD/jqybvWtIInsedN5Pyiev5zus/4bAAcJvo+LlAeBVUS8pN1RDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"937b281486f8b5c400e34d14de66352eed9d026172697e8784c293f7b601f070","last_reissued_at":"2026-05-18T01:21:49.360369Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:49.360369Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cooperative Local Repair in Distributed Storage","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ankit Singh Rawat, Arya Mazumdar, Sriram Vishwanath","submitted_at":"2014-09-13T02:15:34Z","abstract_excerpt":"Erasure-correcting codes, that support local repair of codeword symbols, have attracted substantial attention recently for their application in distributed storage systems. This paper investigates a generalization of the usual locally repairable codes. In particular, this paper studies a class of codes with the following property: any small set of codeword symbols can be reconstructed (repaired) from a small number of other symbols. This is referred to as cooperative local repair. The main contribution of this paper is bounds on the trade-off of the minimum distance and the dimension of such c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.3900","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":"1409.3900","created_at":"2026-05-18T01:21:49.360455+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.3900v2","created_at":"2026-05-18T01:21:49.360455+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.3900","created_at":"2026-05-18T01:21:49.360455+00:00"},{"alias_kind":"pith_short_12","alias_value":"SN5SQFEG7C24","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_16","alias_value":"SN5SQFEG7C24IAHD","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_8","alias_value":"SN5SQFEG","created_at":"2026-05-18T12:28:49.207871+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/SN5SQFEG7C24IAHDJUKN4ZRVF3","json":"https://pith.science/pith/SN5SQFEG7C24IAHDJUKN4ZRVF3.json","graph_json":"https://pith.science/api/pith-number/SN5SQFEG7C24IAHDJUKN4ZRVF3/graph.json","events_json":"https://pith.science/api/pith-number/SN5SQFEG7C24IAHDJUKN4ZRVF3/events.json","paper":"https://pith.science/paper/SN5SQFEG"},"agent_actions":{"view_html":"https://pith.science/pith/SN5SQFEG7C24IAHDJUKN4ZRVF3","download_json":"https://pith.science/pith/SN5SQFEG7C24IAHDJUKN4ZRVF3.json","view_paper":"https://pith.science/paper/SN5SQFEG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.3900&json=true","fetch_graph":"https://pith.science/api/pith-number/SN5SQFEG7C24IAHDJUKN4ZRVF3/graph.json","fetch_events":"https://pith.science/api/pith-number/SN5SQFEG7C24IAHDJUKN4ZRVF3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SN5SQFEG7C24IAHDJUKN4ZRVF3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SN5SQFEG7C24IAHDJUKN4ZRVF3/action/storage_attestation","attest_author":"https://pith.science/pith/SN5SQFEG7C24IAHDJUKN4ZRVF3/action/author_attestation","sign_citation":"https://pith.science/pith/SN5SQFEG7C24IAHDJUKN4ZRVF3/action/citation_signature","submit_replication":"https://pith.science/pith/SN5SQFEG7C24IAHDJUKN4ZRVF3/action/replication_record"}},"created_at":"2026-05-18T01:21:49.360455+00:00","updated_at":"2026-05-18T01:21:49.360455+00:00"}