{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:6V72LBFCT755NTFLBBA4X7YXVL","short_pith_number":"pith:6V72LBFC","schema_version":"1.0","canonical_sha256":"f57fa584a29ffbd6ccab0841cbff17aacc8d38306b80aed07025207e666ba849","source":{"kind":"arxiv","id":"1701.04120","version":2},"attestation_state":"computed","paper":{"title":"Optimal Repair Schemes for Some Families of Full-Length Reed-Solomon Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hoang Dau, Olgica Milenkovic","submitted_at":"2017-01-15T22:03:56Z","abstract_excerpt":"Reed-Solomon codes have found many applications in practical storage systems, but were until recently considered unsuitable for distributed storage applications due to the widely-held belief that they have poor repair bandwidth. The work of Guruswami and Wootters (STOC'16) has shown that one can actually perform bandwidth-efficient linear repair with Reed-Solomon codes: When the codes are over the field $\\mathbb{F}_{q^t}$ and the number of parities $r \\geq q^s$, where $(t-s)$ divides $t$, there exists a linear scheme that achieves a repair bandwidth of $(n-1)(t-s)\\log_2 q$ bits. We extend this"},"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.04120","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-15T22:03:56Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7862e0dcf2be32f8ceb1b171f40f3573f51421523c1ad947407e96d1f09dc555","abstract_canon_sha256":"cae599aa85add824a8eb3982fb68519c41501d1c206fa1f11ae35e585627acd0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:35.149072Z","signature_b64":"tIlwPeRcOQNTkAaRdRDLSxma92uwokCzbkT3McKZf6zvNZtX/0pAowcQpIHhVgShdxvCu3BBWAsFfnx5PUemDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f57fa584a29ffbd6ccab0841cbff17aacc8d38306b80aed07025207e666ba849","last_reissued_at":"2026-05-18T00:44:35.148556Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:35.148556Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Repair Schemes for Some Families of Full-Length Reed-Solomon Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hoang Dau, Olgica Milenkovic","submitted_at":"2017-01-15T22:03:56Z","abstract_excerpt":"Reed-Solomon codes have found many applications in practical storage systems, but were until recently considered unsuitable for distributed storage applications due to the widely-held belief that they have poor repair bandwidth. The work of Guruswami and Wootters (STOC'16) has shown that one can actually perform bandwidth-efficient linear repair with Reed-Solomon codes: When the codes are over the field $\\mathbb{F}_{q^t}$ and the number of parities $r \\geq q^s$, where $(t-s)$ divides $t$, there exists a linear scheme that achieves a repair bandwidth of $(n-1)(t-s)\\log_2 q$ bits. We extend this"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.04120","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.04120","created_at":"2026-05-18T00:44:35.148645+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.04120v2","created_at":"2026-05-18T00:44:35.148645+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.04120","created_at":"2026-05-18T00:44:35.148645+00:00"},{"alias_kind":"pith_short_12","alias_value":"6V72LBFCT755","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"6V72LBFCT755NTFL","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"6V72LBFC","created_at":"2026-05-18T12:31:03.183658+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/6V72LBFCT755NTFLBBA4X7YXVL","json":"https://pith.science/pith/6V72LBFCT755NTFLBBA4X7YXVL.json","graph_json":"https://pith.science/api/pith-number/6V72LBFCT755NTFLBBA4X7YXVL/graph.json","events_json":"https://pith.science/api/pith-number/6V72LBFCT755NTFLBBA4X7YXVL/events.json","paper":"https://pith.science/paper/6V72LBFC"},"agent_actions":{"view_html":"https://pith.science/pith/6V72LBFCT755NTFLBBA4X7YXVL","download_json":"https://pith.science/pith/6V72LBFCT755NTFLBBA4X7YXVL.json","view_paper":"https://pith.science/paper/6V72LBFC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.04120&json=true","fetch_graph":"https://pith.science/api/pith-number/6V72LBFCT755NTFLBBA4X7YXVL/graph.json","fetch_events":"https://pith.science/api/pith-number/6V72LBFCT755NTFLBBA4X7YXVL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6V72LBFCT755NTFLBBA4X7YXVL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6V72LBFCT755NTFLBBA4X7YXVL/action/storage_attestation","attest_author":"https://pith.science/pith/6V72LBFCT755NTFLBBA4X7YXVL/action/author_attestation","sign_citation":"https://pith.science/pith/6V72LBFCT755NTFLBBA4X7YXVL/action/citation_signature","submit_replication":"https://pith.science/pith/6V72LBFCT755NTFLBBA4X7YXVL/action/replication_record"}},"created_at":"2026-05-18T00:44:35.148645+00:00","updated_at":"2026-05-18T00:44:35.148645+00:00"}