{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:JBXTPNIX3QAMSPJEFNQH6OSHMT","short_pith_number":"pith:JBXTPNIX","schema_version":"1.0","canonical_sha256":"486f37b517dc00c93d242b607f3a4764cc37fb8a4fbcd68450fec672e4920213","source":{"kind":"arxiv","id":"1206.3804","version":2},"attestation_state":"computed","paper":{"title":"Locally Repairable Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandros G. Dimakis, Dimitris S. Papailiopoulos","submitted_at":"2012-06-17T22:47:08Z","abstract_excerpt":"Distributed storage systems for large-scale applications typically use replication for reliability. Recently, erasure codes were used to reduce the large storage overhead, while increasing data reliability. A main limitation of off-the-shelf erasure codes is their high-repair cost during single node failure events. A major open problem in this area has been the design of codes that {\\it i)} are repair efficient and {\\it ii)} achieve arbitrarily high data rates.\n  In this paper, we explore the repair metric of {\\it locality}, which corresponds to the number of disk accesses required during a {\\"},"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":"1206.3804","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-06-17T22:47:08Z","cross_cats_sorted":["cs.DC","cs.NI","math.IT"],"title_canon_sha256":"4594ee23f871d6d4fc9392325d72bfcde09eecf1549219075b36fe7ed28434eb","abstract_canon_sha256":"3852714d88e69946c8852e69cea75524270d4a2946371db5f900df20da22de22"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:42.351351Z","signature_b64":"rQ1VisgT8PV1RzBIiS8qa5m1/HFr8DUNT05Vuuc7jQD+dSHgViWCPgEwI3skZjIMx8yiMhrwcpeEiw8eLap+BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"486f37b517dc00c93d242b607f3a4764cc37fb8a4fbcd68450fec672e4920213","last_reissued_at":"2026-05-18T02:52:42.350691Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:42.350691Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Locally Repairable Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandros G. Dimakis, Dimitris S. Papailiopoulos","submitted_at":"2012-06-17T22:47:08Z","abstract_excerpt":"Distributed storage systems for large-scale applications typically use replication for reliability. Recently, erasure codes were used to reduce the large storage overhead, while increasing data reliability. A main limitation of off-the-shelf erasure codes is their high-repair cost during single node failure events. A major open problem in this area has been the design of codes that {\\it i)} are repair efficient and {\\it ii)} achieve arbitrarily high data rates.\n  In this paper, we explore the repair metric of {\\it locality}, which corresponds to the number of disk accesses required during a {\\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.3804","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":"1206.3804","created_at":"2026-05-18T02:52:42.350787+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.3804v2","created_at":"2026-05-18T02:52:42.350787+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.3804","created_at":"2026-05-18T02:52:42.350787+00:00"},{"alias_kind":"pith_short_12","alias_value":"JBXTPNIX3QAM","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_16","alias_value":"JBXTPNIX3QAMSPJE","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_8","alias_value":"JBXTPNIX","created_at":"2026-05-18T12:27:11.947152+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/JBXTPNIX3QAMSPJEFNQH6OSHMT","json":"https://pith.science/pith/JBXTPNIX3QAMSPJEFNQH6OSHMT.json","graph_json":"https://pith.science/api/pith-number/JBXTPNIX3QAMSPJEFNQH6OSHMT/graph.json","events_json":"https://pith.science/api/pith-number/JBXTPNIX3QAMSPJEFNQH6OSHMT/events.json","paper":"https://pith.science/paper/JBXTPNIX"},"agent_actions":{"view_html":"https://pith.science/pith/JBXTPNIX3QAMSPJEFNQH6OSHMT","download_json":"https://pith.science/pith/JBXTPNIX3QAMSPJEFNQH6OSHMT.json","view_paper":"https://pith.science/paper/JBXTPNIX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.3804&json=true","fetch_graph":"https://pith.science/api/pith-number/JBXTPNIX3QAMSPJEFNQH6OSHMT/graph.json","fetch_events":"https://pith.science/api/pith-number/JBXTPNIX3QAMSPJEFNQH6OSHMT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JBXTPNIX3QAMSPJEFNQH6OSHMT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JBXTPNIX3QAMSPJEFNQH6OSHMT/action/storage_attestation","attest_author":"https://pith.science/pith/JBXTPNIX3QAMSPJEFNQH6OSHMT/action/author_attestation","sign_citation":"https://pith.science/pith/JBXTPNIX3QAMSPJEFNQH6OSHMT/action/citation_signature","submit_replication":"https://pith.science/pith/JBXTPNIX3QAMSPJEFNQH6OSHMT/action/replication_record"}},"created_at":"2026-05-18T02:52:42.350787+00:00","updated_at":"2026-05-18T02:52:42.350787+00:00"}