{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:5CO2ILSJHUYOVFBKSUVFJA7VCT","short_pith_number":"pith:5CO2ILSJ","schema_version":"1.0","canonical_sha256":"e89da42e493d30ea942a952a5483f514eb5b75b705f76f87977dc8b78edd5a2d","source":{"kind":"arxiv","id":"1701.07118","version":2},"attestation_state":"computed","paper":{"title":"Repairing Reed-Solomon Codes With Two Erasures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Han Mao Kiah, Hoang Dau, Iwan Duursma, Olgica Milenkovic","submitted_at":"2017-01-25T00:42:22Z","abstract_excerpt":"Despite their exceptional error-correcting properties, Reed-Solomon (RS) codes have been overlooked in distributed storage applications due to the common belief that they have poor repair bandwidth: A naive repair approach would require the whole file to be reconstructed in order to recover a single erased codeword symbol. In a recent work, Guruswami and Wootters (STOC'16) proposed a single-erasure repair method for RS codes that achieves the optimal repair bandwidth amongst all linear encoding schemes. We extend their trace collection technique to cope with two erasures."},"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":"1701.07118","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-25T00:42:22Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"28a7969a30cd1672b35c70e20613c006b9fa22fc2ed5650f104aac08a12a6dd2","abstract_canon_sha256":"88ab67d713bccb6ccbf85853d64f77a51fc6e6e59b6cc5dddfdd861be6e7c0ef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:35.135492Z","signature_b64":"6YAgHBV7LXoBTPAyhEdRbajurJvCV8UjezK0Y2fDIOMR6Y+nUadMaBQcxFfnJO5Y0b1EAvVIR3w+0NAgtUIuBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e89da42e493d30ea942a952a5483f514eb5b75b705f76f87977dc8b78edd5a2d","last_reissued_at":"2026-05-18T00:44:35.135021Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:35.135021Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Repairing Reed-Solomon Codes With Two Erasures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Han Mao Kiah, Hoang Dau, Iwan Duursma, Olgica Milenkovic","submitted_at":"2017-01-25T00:42:22Z","abstract_excerpt":"Despite their exceptional error-correcting properties, Reed-Solomon (RS) codes have been overlooked in distributed storage applications due to the common belief that they have poor repair bandwidth: A naive repair approach would require the whole file to be reconstructed in order to recover a single erased codeword symbol. In a recent work, Guruswami and Wootters (STOC'16) proposed a single-erasure repair method for RS codes that achieves the optimal repair bandwidth amongst all linear encoding schemes. We extend their trace collection technique to cope with two erasures."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.07118","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":"1701.07118","created_at":"2026-05-18T00:44:35.135095+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.07118v2","created_at":"2026-05-18T00:44:35.135095+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.07118","created_at":"2026-05-18T00:44:35.135095+00:00"},{"alias_kind":"pith_short_12","alias_value":"5CO2ILSJHUYO","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"5CO2ILSJHUYOVFBK","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"5CO2ILSJ","created_at":"2026-05-18T12:31:00.734936+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/5CO2ILSJHUYOVFBKSUVFJA7VCT","json":"https://pith.science/pith/5CO2ILSJHUYOVFBKSUVFJA7VCT.json","graph_json":"https://pith.science/api/pith-number/5CO2ILSJHUYOVFBKSUVFJA7VCT/graph.json","events_json":"https://pith.science/api/pith-number/5CO2ILSJHUYOVFBKSUVFJA7VCT/events.json","paper":"https://pith.science/paper/5CO2ILSJ"},"agent_actions":{"view_html":"https://pith.science/pith/5CO2ILSJHUYOVFBKSUVFJA7VCT","download_json":"https://pith.science/pith/5CO2ILSJHUYOVFBKSUVFJA7VCT.json","view_paper":"https://pith.science/paper/5CO2ILSJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.07118&json=true","fetch_graph":"https://pith.science/api/pith-number/5CO2ILSJHUYOVFBKSUVFJA7VCT/graph.json","fetch_events":"https://pith.science/api/pith-number/5CO2ILSJHUYOVFBKSUVFJA7VCT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5CO2ILSJHUYOVFBKSUVFJA7VCT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5CO2ILSJHUYOVFBKSUVFJA7VCT/action/storage_attestation","attest_author":"https://pith.science/pith/5CO2ILSJHUYOVFBKSUVFJA7VCT/action/author_attestation","sign_citation":"https://pith.science/pith/5CO2ILSJHUYOVFBKSUVFJA7VCT/action/citation_signature","submit_replication":"https://pith.science/pith/5CO2ILSJHUYOVFBKSUVFJA7VCT/action/replication_record"}},"created_at":"2026-05-18T00:44:35.135095+00:00","updated_at":"2026-05-18T00:44:35.135095+00:00"}