{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:PCXTDETUCN5LSQKSZIR6RSBGVY","short_pith_number":"pith:PCXTDETU","schema_version":"1.0","canonical_sha256":"78af319274137ab94152ca23e8c826ae12307dc3c1baa5129bf94c269ced0aa1","source":{"kind":"arxiv","id":"1302.0744","version":2},"attestation_state":"computed","paper":{"title":"Explicit MBR All-Symbol Locality Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ankit S. Rawat, Govinda M. Kamath, Natalia Silberstein, N. Prakash, O. Ozan Koyluoglu, P. Vijay Kumar, Sriram Vishwanath, V. Lalitha","submitted_at":"2013-02-04T16:15:15Z","abstract_excerpt":"Node failures are inevitable in distributed storage systems (DSS). To enable efficient repair when faced with such failures, two main techniques are known: Regenerating codes, i.e., codes that minimize the total repair bandwidth; and codes with locality, which minimize the number of nodes participating in the repair process. This paper focuses on regenerating codes with locality, using pre-coding based on Gabidulin codes, and presents constructions that utilize minimum bandwidth regenerating (MBR) local codes. The constructions achieve maximum resilience (i.e., optimal minimum distance) and ha"},"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":"1302.0744","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-04T16:15:15Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a6c029b00b271e69f203870fd87cfa3fb3cd525a6a8008db83fd94872970bdc1","abstract_canon_sha256":"08fd30633abb9d3f84e3b16195722b06baf32b91d1f6f278286103d45d8c6173"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:24:52.430786Z","signature_b64":"icZO4Qpoo5Q2A4Edm9ldBaaFQ7HVWosTOqdJWO7PMGQztCaIX77fJ1jXN/cBIGkdCt0fefn1MFEOAqxsLqYPAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"78af319274137ab94152ca23e8c826ae12307dc3c1baa5129bf94c269ced0aa1","last_reissued_at":"2026-05-18T03:24:52.430193Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:24:52.430193Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Explicit MBR All-Symbol Locality Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ankit S. Rawat, Govinda M. Kamath, Natalia Silberstein, N. Prakash, O. Ozan Koyluoglu, P. Vijay Kumar, Sriram Vishwanath, V. Lalitha","submitted_at":"2013-02-04T16:15:15Z","abstract_excerpt":"Node failures are inevitable in distributed storage systems (DSS). To enable efficient repair when faced with such failures, two main techniques are known: Regenerating codes, i.e., codes that minimize the total repair bandwidth; and codes with locality, which minimize the number of nodes participating in the repair process. This paper focuses on regenerating codes with locality, using pre-coding based on Gabidulin codes, and presents constructions that utilize minimum bandwidth regenerating (MBR) local codes. The constructions achieve maximum resilience (i.e., optimal minimum distance) and ha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.0744","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":"1302.0744","created_at":"2026-05-18T03:24:52.430281+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.0744v2","created_at":"2026-05-18T03:24:52.430281+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.0744","created_at":"2026-05-18T03:24:52.430281+00:00"},{"alias_kind":"pith_short_12","alias_value":"PCXTDETUCN5L","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"PCXTDETUCN5LSQKS","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"PCXTDETU","created_at":"2026-05-18T12:27:54.935989+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/PCXTDETUCN5LSQKSZIR6RSBGVY","json":"https://pith.science/pith/PCXTDETUCN5LSQKSZIR6RSBGVY.json","graph_json":"https://pith.science/api/pith-number/PCXTDETUCN5LSQKSZIR6RSBGVY/graph.json","events_json":"https://pith.science/api/pith-number/PCXTDETUCN5LSQKSZIR6RSBGVY/events.json","paper":"https://pith.science/paper/PCXTDETU"},"agent_actions":{"view_html":"https://pith.science/pith/PCXTDETUCN5LSQKSZIR6RSBGVY","download_json":"https://pith.science/pith/PCXTDETUCN5LSQKSZIR6RSBGVY.json","view_paper":"https://pith.science/paper/PCXTDETU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.0744&json=true","fetch_graph":"https://pith.science/api/pith-number/PCXTDETUCN5LSQKSZIR6RSBGVY/graph.json","fetch_events":"https://pith.science/api/pith-number/PCXTDETUCN5LSQKSZIR6RSBGVY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PCXTDETUCN5LSQKSZIR6RSBGVY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PCXTDETUCN5LSQKSZIR6RSBGVY/action/storage_attestation","attest_author":"https://pith.science/pith/PCXTDETUCN5LSQKSZIR6RSBGVY/action/author_attestation","sign_citation":"https://pith.science/pith/PCXTDETUCN5LSQKSZIR6RSBGVY/action/citation_signature","submit_replication":"https://pith.science/pith/PCXTDETUCN5LSQKSZIR6RSBGVY/action/replication_record"}},"created_at":"2026-05-18T03:24:52.430281+00:00","updated_at":"2026-05-18T03:24:52.430281+00:00"}