{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:OKQ6F3NOYFOXAX5WM7I26Q3X2R","short_pith_number":"pith:OKQ6F3NO","schema_version":"1.0","canonical_sha256":"72a1e2edaec15d705fb667d1af4377d4612500cb102e8abd52e831b2951ecc15","source":{"kind":"arxiv","id":"1806.00496","version":2},"attestation_state":"computed","paper":{"title":"On the Sub-Packetization Size and the Repair Bandwidth of Reed-Solomon Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hamid Jafarkhani, Weiqi Li, Zhiying Wang","submitted_at":"2018-06-01T18:23:14Z","abstract_excerpt":"Reed-Solomon (RS) codes are widely used in distributed storage systems. In this paper, we study the repair bandwidth and sub-packetization size of RS codes. The repair bandwidth is defined as the amount of transmitted information from surviving nodes to a failed node. The RS code can be viewed as a polynomial over a finite field $GF(q^\\ell)$ evaluated at a set of points, where $\\ell$ is called the sub-packetization size. Smaller bandwidth reduces the network traffic in distributed storage, and smaller $\\ell$ facilitates the implementation of RS codes with lower complexity. Recently, Guruswami "},"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":"1806.00496","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-01T18:23:14Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f32c3069a3fb597d8a7f46a6b49688d1d9e79d0ac4a779b24647db398166817e","abstract_canon_sha256":"c2eb25eb1483c9f5970d819327bd9e5fa33ce8b859d585d5783a192067f163c0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:49.366964Z","signature_b64":"3SGBKBmv88sWKvdrehmIeRs2aahA0QbDobijyUO2/cNkTve674GPVHHWxKJWsyfI31WdFLkWZ/c3RaAbuwhOBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"72a1e2edaec15d705fb667d1af4377d4612500cb102e8abd52e831b2951ecc15","last_reissued_at":"2026-05-17T23:51:49.366364Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:49.366364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Sub-Packetization Size and the Repair Bandwidth of Reed-Solomon Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hamid Jafarkhani, Weiqi Li, Zhiying Wang","submitted_at":"2018-06-01T18:23:14Z","abstract_excerpt":"Reed-Solomon (RS) codes are widely used in distributed storage systems. In this paper, we study the repair bandwidth and sub-packetization size of RS codes. The repair bandwidth is defined as the amount of transmitted information from surviving nodes to a failed node. The RS code can be viewed as a polynomial over a finite field $GF(q^\\ell)$ evaluated at a set of points, where $\\ell$ is called the sub-packetization size. Smaller bandwidth reduces the network traffic in distributed storage, and smaller $\\ell$ facilitates the implementation of RS codes with lower complexity. Recently, Guruswami "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.00496","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":"1806.00496","created_at":"2026-05-17T23:51:49.366446+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.00496v2","created_at":"2026-05-17T23:51:49.366446+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.00496","created_at":"2026-05-17T23:51:49.366446+00:00"},{"alias_kind":"pith_short_12","alias_value":"OKQ6F3NOYFOX","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"OKQ6F3NOYFOXAX5W","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"OKQ6F3NO","created_at":"2026-05-18T12:32:43.782077+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/OKQ6F3NOYFOXAX5WM7I26Q3X2R","json":"https://pith.science/pith/OKQ6F3NOYFOXAX5WM7I26Q3X2R.json","graph_json":"https://pith.science/api/pith-number/OKQ6F3NOYFOXAX5WM7I26Q3X2R/graph.json","events_json":"https://pith.science/api/pith-number/OKQ6F3NOYFOXAX5WM7I26Q3X2R/events.json","paper":"https://pith.science/paper/OKQ6F3NO"},"agent_actions":{"view_html":"https://pith.science/pith/OKQ6F3NOYFOXAX5WM7I26Q3X2R","download_json":"https://pith.science/pith/OKQ6F3NOYFOXAX5WM7I26Q3X2R.json","view_paper":"https://pith.science/paper/OKQ6F3NO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.00496&json=true","fetch_graph":"https://pith.science/api/pith-number/OKQ6F3NOYFOXAX5WM7I26Q3X2R/graph.json","fetch_events":"https://pith.science/api/pith-number/OKQ6F3NOYFOXAX5WM7I26Q3X2R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OKQ6F3NOYFOXAX5WM7I26Q3X2R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OKQ6F3NOYFOXAX5WM7I26Q3X2R/action/storage_attestation","attest_author":"https://pith.science/pith/OKQ6F3NOYFOXAX5WM7I26Q3X2R/action/author_attestation","sign_citation":"https://pith.science/pith/OKQ6F3NOYFOXAX5WM7I26Q3X2R/action/citation_signature","submit_replication":"https://pith.science/pith/OKQ6F3NOYFOXAX5WM7I26Q3X2R/action/replication_record"}},"created_at":"2026-05-17T23:51:49.366446+00:00","updated_at":"2026-05-17T23:51:49.366446+00:00"}