{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:NBDJCUR4EZZUJLXHQZWD5F5CSQ","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":"6ab5f07536dd8650aab8514904f506ab5759c070f2791d5c0d5dbbad42d30671","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-31T17:23:10Z","title_canon_sha256":"850211335189acfee1e37926a6fe893d4e54540ad8e550f66067e66078f5140b"},"schema_version":"1.0","source":{"id":"1301.7693","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.7693","created_at":"2026-05-18T03:07:54Z"},{"alias_kind":"arxiv_version","alias_value":"1301.7693v3","created_at":"2026-05-18T03:07:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.7693","created_at":"2026-05-18T03:07:54Z"},{"alias_kind":"pith_short_12","alias_value":"NBDJCUR4EZZU","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"NBDJCUR4EZZUJLXH","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"NBDJCUR4","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:e395847f4e1bf926b27d066cc38b892dfb028baa766532ff20d95269f9650470","target":"graph","created_at":"2026-05-18T03:07:54Z","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":"Petabyte-scale distributed storage systems are currently transitioning to erasure codes to achieve higher storage efficiency. Classical codes like Reed-Solomon are highly sub-optimal for distributed environments due to their high overhead in single-failure events. Locally Repairable Codes (LRCs) form a new family of codes that are repair efficient. In particular, LRCs minimize the number of nodes participating in single node repairs during which they generate small network traffic. Two large-scale distributed storage systems have already implemented different types of LRCs: Windows Azure Stora","authors_text":"Alexandros G. Dimakis, Dimitris S. Papailiopoulos, Itzhak Tamo","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-31T17:23:10Z","title":"Optimal Locally Repairable Codes and Connections to Matroid Theory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.7693","kind":"arxiv","version":3},"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:424a68b6abe1313e0e42a9544bcab19ef2012069de29f341eed3234070640885","target":"record","created_at":"2026-05-18T03:07:54Z","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":"6ab5f07536dd8650aab8514904f506ab5759c070f2791d5c0d5dbbad42d30671","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-31T17:23:10Z","title_canon_sha256":"850211335189acfee1e37926a6fe893d4e54540ad8e550f66067e66078f5140b"},"schema_version":"1.0","source":{"id":"1301.7693","kind":"arxiv","version":3}},"canonical_sha256":"684691523c267344aee7866c3e97a2943af97bcfcc4efa5d63f40a2b5d92b4ff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"684691523c267344aee7866c3e97a2943af97bcfcc4efa5d63f40a2b5d92b4ff","first_computed_at":"2026-05-18T03:07:54.786400Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:07:54.786400Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bywXIuDRcP3bjYcncSJnaGa3QF+trMEfND5LFo3Kljj6xrBmLbOt3iT197p2+04DKrx2FGS0ZcfMAvFumgPRCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:07:54.786928Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.7693","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:424a68b6abe1313e0e42a9544bcab19ef2012069de29f341eed3234070640885","sha256:e395847f4e1bf926b27d066cc38b892dfb028baa766532ff20d95269f9650470"],"state_sha256":"dfb9cb6b644b90b50187b7edde633b4829be88cdeee213600de4df984b4f0458"}