{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:JBXTPNIX3QAMSPJEFNQH6OSHMT","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":"3852714d88e69946c8852e69cea75524270d4a2946371db5f900df20da22de22","cross_cats_sorted":["cs.DC","cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-06-17T22:47:08Z","title_canon_sha256":"4594ee23f871d6d4fc9392325d72bfcde09eecf1549219075b36fe7ed28434eb"},"schema_version":"1.0","source":{"id":"1206.3804","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.3804","created_at":"2026-05-18T02:52:42Z"},{"alias_kind":"arxiv_version","alias_value":"1206.3804v2","created_at":"2026-05-18T02:52:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.3804","created_at":"2026-05-18T02:52:42Z"},{"alias_kind":"pith_short_12","alias_value":"JBXTPNIX3QAM","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"JBXTPNIX3QAMSPJE","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"JBXTPNIX","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:8b30d05dfe738d58d406da92f3b90ba3ac8ca024356fd9082402cba849abd45f","target":"graph","created_at":"2026-05-18T02:52:42Z","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":"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 {\\","authors_text":"Alexandros G. Dimakis, Dimitris S. Papailiopoulos","cross_cats":["cs.DC","cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-06-17T22:47:08Z","title":"Locally Repairable Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.3804","kind":"arxiv","version":2},"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:21da2d73e2b64a6d17631a3eca60a31b648d7676e01fef3bd345970e6c9853d9","target":"record","created_at":"2026-05-18T02:52:42Z","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":"3852714d88e69946c8852e69cea75524270d4a2946371db5f900df20da22de22","cross_cats_sorted":["cs.DC","cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-06-17T22:47:08Z","title_canon_sha256":"4594ee23f871d6d4fc9392325d72bfcde09eecf1549219075b36fe7ed28434eb"},"schema_version":"1.0","source":{"id":"1206.3804","kind":"arxiv","version":2}},"canonical_sha256":"486f37b517dc00c93d242b607f3a4764cc37fb8a4fbcd68450fec672e4920213","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"486f37b517dc00c93d242b607f3a4764cc37fb8a4fbcd68450fec672e4920213","first_computed_at":"2026-05-18T02:52:42.350691Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:52:42.350691Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rQ1VisgT8PV1RzBIiS8qa5m1/HFr8DUNT05Vuuc7jQD+dSHgViWCPgEwI3skZjIMx8yiMhrwcpeEiw8eLap+BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:52:42.351351Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.3804","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:21da2d73e2b64a6d17631a3eca60a31b648d7676e01fef3bd345970e6c9853d9","sha256:8b30d05dfe738d58d406da92f3b90ba3ac8ca024356fd9082402cba849abd45f"],"state_sha256":"b2e6cc588a5ccbeff7dcada636bd6507c7e940c15887a62d6513f965202a2576"}