{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:NBDJCUR4EZZUJLXHQZWD5F5CSQ","short_pith_number":"pith:NBDJCUR4","schema_version":"1.0","canonical_sha256":"684691523c267344aee7866c3e97a2943af97bcfcc4efa5d63f40a2b5d92b4ff","source":{"kind":"arxiv","id":"1301.7693","version":3},"attestation_state":"computed","paper":{"title":"Optimal Locally Repairable Codes and Connections to Matroid Theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandros G. Dimakis, Dimitris S. Papailiopoulos, Itzhak Tamo","submitted_at":"2013-01-31T17:23:10Z","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"},"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":"1301.7693","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-31T17:23:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"850211335189acfee1e37926a6fe893d4e54540ad8e550f66067e66078f5140b","abstract_canon_sha256":"6ab5f07536dd8650aab8514904f506ab5759c070f2791d5c0d5dbbad42d30671"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:07:54.786928Z","signature_b64":"bywXIuDRcP3bjYcncSJnaGa3QF+trMEfND5LFo3Kljj6xrBmLbOt3iT197p2+04DKrx2FGS0ZcfMAvFumgPRCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"684691523c267344aee7866c3e97a2943af97bcfcc4efa5d63f40a2b5d92b4ff","last_reissued_at":"2026-05-18T03:07:54.786400Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:07:54.786400Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Locally Repairable Codes and Connections to Matroid Theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandros G. Dimakis, Dimitris S. Papailiopoulos, Itzhak Tamo","submitted_at":"2013-01-31T17:23:10Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.7693","kind":"arxiv","version":3},"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":"1301.7693","created_at":"2026-05-18T03:07:54.786483+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.7693v3","created_at":"2026-05-18T03:07:54.786483+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.7693","created_at":"2026-05-18T03:07:54.786483+00:00"},{"alias_kind":"pith_short_12","alias_value":"NBDJCUR4EZZU","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"NBDJCUR4EZZUJLXH","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"NBDJCUR4","created_at":"2026-05-18T12:27:52.871228+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/NBDJCUR4EZZUJLXHQZWD5F5CSQ","json":"https://pith.science/pith/NBDJCUR4EZZUJLXHQZWD5F5CSQ.json","graph_json":"https://pith.science/api/pith-number/NBDJCUR4EZZUJLXHQZWD5F5CSQ/graph.json","events_json":"https://pith.science/api/pith-number/NBDJCUR4EZZUJLXHQZWD5F5CSQ/events.json","paper":"https://pith.science/paper/NBDJCUR4"},"agent_actions":{"view_html":"https://pith.science/pith/NBDJCUR4EZZUJLXHQZWD5F5CSQ","download_json":"https://pith.science/pith/NBDJCUR4EZZUJLXHQZWD5F5CSQ.json","view_paper":"https://pith.science/paper/NBDJCUR4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.7693&json=true","fetch_graph":"https://pith.science/api/pith-number/NBDJCUR4EZZUJLXHQZWD5F5CSQ/graph.json","fetch_events":"https://pith.science/api/pith-number/NBDJCUR4EZZUJLXHQZWD5F5CSQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NBDJCUR4EZZUJLXHQZWD5F5CSQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NBDJCUR4EZZUJLXHQZWD5F5CSQ/action/storage_attestation","attest_author":"https://pith.science/pith/NBDJCUR4EZZUJLXHQZWD5F5CSQ/action/author_attestation","sign_citation":"https://pith.science/pith/NBDJCUR4EZZUJLXHQZWD5F5CSQ/action/citation_signature","submit_replication":"https://pith.science/pith/NBDJCUR4EZZUJLXHQZWD5F5CSQ/action/replication_record"}},"created_at":"2026-05-18T03:07:54.786483+00:00","updated_at":"2026-05-18T03:07:54.786483+00:00"}