{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:4ANTRDWEMBRG3P4IFU6ASQWR32","short_pith_number":"pith:4ANTRDWE","schema_version":"1.0","canonical_sha256":"e01b388ec460626dbf882d3c0942d1dea179b2556b55d67efa1c9860b118f01b","source":{"kind":"arxiv","id":"1709.09770","version":1},"attestation_state":"computed","paper":{"title":"Multi-Erasure Locally Recoverable Codes Over Small Fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Eitan Yaakobi, Paul H. Siegel, Pengfei Huang","submitted_at":"2017-09-28T00:37:02Z","abstract_excerpt":"Erasure codes play an important role in storage systems to prevent data loss. In this work, we study a class of erasure codes called Multi-Erasure Locally Recoverable Codes (ME-LRCs) for storage arrays. Compared to previous related works, we focus on the construction of ME-LRCs over small fields. We first develop upper and lower bounds on the minimum distance of ME-LRCs. Our main contribution is to propose a general construction of ME-LRCs based on generalized tensor product codes, and study their erasure-correcting properties. A decoding algorithm tailored for erasure recovery is given, and c"},"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":"1709.09770","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-09-28T00:37:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3d70756703ee4a33ff5a2eaf12ec112a9c770e27c01d8fb75690af461883736e","abstract_canon_sha256":"2d7d8cc072e13ce873691876703da5c6c2d90d1615a24698a68ea32248836e24"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:06.812623Z","signature_b64":"lbGtICgFpMg7e71I7CDzvUo1z80v0YoUmSLKd8jChxwBkQaeekSpucv4oi1Fk3Y0qHtDuR7IoLC3oaYKf5egCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e01b388ec460626dbf882d3c0942d1dea179b2556b55d67efa1c9860b118f01b","last_reissued_at":"2026-05-18T00:34:06.812063Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:06.812063Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-Erasure Locally Recoverable Codes Over Small Fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Eitan Yaakobi, Paul H. Siegel, Pengfei Huang","submitted_at":"2017-09-28T00:37:02Z","abstract_excerpt":"Erasure codes play an important role in storage systems to prevent data loss. In this work, we study a class of erasure codes called Multi-Erasure Locally Recoverable Codes (ME-LRCs) for storage arrays. Compared to previous related works, we focus on the construction of ME-LRCs over small fields. We first develop upper and lower bounds on the minimum distance of ME-LRCs. Our main contribution is to propose a general construction of ME-LRCs based on generalized tensor product codes, and study their erasure-correcting properties. A decoding algorithm tailored for erasure recovery is given, and c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.09770","kind":"arxiv","version":1},"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":"1709.09770","created_at":"2026-05-18T00:34:06.812179+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.09770v1","created_at":"2026-05-18T00:34:06.812179+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.09770","created_at":"2026-05-18T00:34:06.812179+00:00"},{"alias_kind":"pith_short_12","alias_value":"4ANTRDWEMBRG","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"4ANTRDWEMBRG3P4I","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"4ANTRDWE","created_at":"2026-05-18T12:30:58.224056+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/4ANTRDWEMBRG3P4IFU6ASQWR32","json":"https://pith.science/pith/4ANTRDWEMBRG3P4IFU6ASQWR32.json","graph_json":"https://pith.science/api/pith-number/4ANTRDWEMBRG3P4IFU6ASQWR32/graph.json","events_json":"https://pith.science/api/pith-number/4ANTRDWEMBRG3P4IFU6ASQWR32/events.json","paper":"https://pith.science/paper/4ANTRDWE"},"agent_actions":{"view_html":"https://pith.science/pith/4ANTRDWEMBRG3P4IFU6ASQWR32","download_json":"https://pith.science/pith/4ANTRDWEMBRG3P4IFU6ASQWR32.json","view_paper":"https://pith.science/paper/4ANTRDWE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.09770&json=true","fetch_graph":"https://pith.science/api/pith-number/4ANTRDWEMBRG3P4IFU6ASQWR32/graph.json","fetch_events":"https://pith.science/api/pith-number/4ANTRDWEMBRG3P4IFU6ASQWR32/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4ANTRDWEMBRG3P4IFU6ASQWR32/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4ANTRDWEMBRG3P4IFU6ASQWR32/action/storage_attestation","attest_author":"https://pith.science/pith/4ANTRDWEMBRG3P4IFU6ASQWR32/action/author_attestation","sign_citation":"https://pith.science/pith/4ANTRDWEMBRG3P4IFU6ASQWR32/action/citation_signature","submit_replication":"https://pith.science/pith/4ANTRDWEMBRG3P4IFU6ASQWR32/action/replication_record"}},"created_at":"2026-05-18T00:34:06.812179+00:00","updated_at":"2026-05-18T00:34:06.812179+00:00"}