{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:4ANTRDWEMBRG3P4IFU6ASQWR32","short_pith_number":"pith:4ANTRDWE","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"},"canonical_sha256":"e01b388ec460626dbf882d3c0942d1dea179b2556b55d67efa1c9860b118f01b","source":{"kind":"arxiv","id":"1709.09770","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.09770","created_at":"2026-05-18T00:34:06Z"},{"alias_kind":"arxiv_version","alias_value":"1709.09770v1","created_at":"2026-05-18T00:34:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.09770","created_at":"2026-05-18T00:34:06Z"},{"alias_kind":"pith_short_12","alias_value":"4ANTRDWEMBRG","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"4ANTRDWEMBRG3P4I","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"4ANTRDWE","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:4ANTRDWEMBRG3P4IFU6ASQWR32","target":"record","payload":{"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"},"canonical_sha256":"e01b388ec460626dbf882d3c0942d1dea179b2556b55d67efa1c9860b118f01b","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"},"source_kind":"arxiv","source_id":"1709.09770","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:34:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e76j+z/8VLXrCdurK6SBxI+Sl5ryTMY9nKQ0lQk+detL4Ri+4HgwyIlnH4XP76FTAbPXwGxk5py5dd9Ld7aqDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T12:47:13.277730Z"},"content_sha256":"fcdef787a0e0c0184534a31ebd42efec83ca3a75f25057ca65ef4ce7430a30e3","schema_version":"1.0","event_id":"sha256:fcdef787a0e0c0184534a31ebd42efec83ca3a75f25057ca65ef4ce7430a30e3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:4ANTRDWEMBRG3P4IFU6ASQWR32","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:34:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oRWPFIBD2Sn1sC7sqYBi8Yd8tRg507890sg0hpwqRnt41y6fA0ETmfjaXSicQoymHd42PT13ofwL/3hwHnY+Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T12:47:13.278075Z"},"content_sha256":"8b2cea18cf3faa601f888e6f93d9eb56ff8a0a532fba6e54cb822a63c2c64629","schema_version":"1.0","event_id":"sha256:8b2cea18cf3faa601f888e6f93d9eb56ff8a0a532fba6e54cb822a63c2c64629"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4ANTRDWEMBRG3P4IFU6ASQWR32/bundle.json","state_url":"https://pith.science/pith/4ANTRDWEMBRG3P4IFU6ASQWR32/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4ANTRDWEMBRG3P4IFU6ASQWR32/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-05T12:47:13Z","links":{"resolver":"https://pith.science/pith/4ANTRDWEMBRG3P4IFU6ASQWR32","bundle":"https://pith.science/pith/4ANTRDWEMBRG3P4IFU6ASQWR32/bundle.json","state":"https://pith.science/pith/4ANTRDWEMBRG3P4IFU6ASQWR32/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4ANTRDWEMBRG3P4IFU6ASQWR32/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4ANTRDWEMBRG3P4IFU6ASQWR32","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":"2d7d8cc072e13ce873691876703da5c6c2d90d1615a24698a68ea32248836e24","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-09-28T00:37:02Z","title_canon_sha256":"3d70756703ee4a33ff5a2eaf12ec112a9c770e27c01d8fb75690af461883736e"},"schema_version":"1.0","source":{"id":"1709.09770","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.09770","created_at":"2026-05-18T00:34:06Z"},{"alias_kind":"arxiv_version","alias_value":"1709.09770v1","created_at":"2026-05-18T00:34:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.09770","created_at":"2026-05-18T00:34:06Z"},{"alias_kind":"pith_short_12","alias_value":"4ANTRDWEMBRG","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"4ANTRDWEMBRG3P4I","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"4ANTRDWE","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:8b2cea18cf3faa601f888e6f93d9eb56ff8a0a532fba6e54cb822a63c2c64629","target":"graph","created_at":"2026-05-18T00:34:06Z","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":"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","authors_text":"Eitan Yaakobi, Paul H. Siegel, Pengfei Huang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-09-28T00:37:02Z","title":"Multi-Erasure Locally Recoverable Codes Over Small Fields"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.09770","kind":"arxiv","version":1},"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:fcdef787a0e0c0184534a31ebd42efec83ca3a75f25057ca65ef4ce7430a30e3","target":"record","created_at":"2026-05-18T00:34:06Z","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":"2d7d8cc072e13ce873691876703da5c6c2d90d1615a24698a68ea32248836e24","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-09-28T00:37:02Z","title_canon_sha256":"3d70756703ee4a33ff5a2eaf12ec112a9c770e27c01d8fb75690af461883736e"},"schema_version":"1.0","source":{"id":"1709.09770","kind":"arxiv","version":1}},"canonical_sha256":"e01b388ec460626dbf882d3c0942d1dea179b2556b55d67efa1c9860b118f01b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e01b388ec460626dbf882d3c0942d1dea179b2556b55d67efa1c9860b118f01b","first_computed_at":"2026-05-18T00:34:06.812063Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:06.812063Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lbGtICgFpMg7e71I7CDzvUo1z80v0YoUmSLKd8jChxwBkQaeekSpucv4oi1Fk3Y0qHtDuR7IoLC3oaYKf5egCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:06.812623Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.09770","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fcdef787a0e0c0184534a31ebd42efec83ca3a75f25057ca65ef4ce7430a30e3","sha256:8b2cea18cf3faa601f888e6f93d9eb56ff8a0a532fba6e54cb822a63c2c64629"],"state_sha256":"cfe661e2f5ea11e56e07e7c94bacb3def2316d402f959ea270bfe00b366c92b2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6Xosn8YJG0+kRuzHsQnLQ9MKqVIJA46q0fFc1qcExCutXdqrYHu5jYG83BkLc7T3f+PXX8OaG01CnZNz1P4CCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T12:47:13.280103Z","bundle_sha256":"b9752c282252c3e2c62609bc85f999da303118f12f9d551a69d5150a8e1e94c1"}}