{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:EUS34CMHKXFBRV3RK7IWQD2OB2","short_pith_number":"pith:EUS34CMH","schema_version":"1.0","canonical_sha256":"2525be098755ca18d77157d1680f4e0ebb2abf3b101f39b24e658d17ffc9e0ff","source":{"kind":"arxiv","id":"1501.06662","version":1},"attestation_state":"computed","paper":{"title":"A High-Rate MSR Code With Polynomial Sub-Packetization Level","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Birenjith Sasidharan, Gaurav Kumar Agarwal, P. Vijay Kumar","submitted_at":"2015-01-27T06:02:45Z","abstract_excerpt":"We present a high-rate $(n,k,d=n-1)$-MSR code with a sub-packetization level that is polynomial in the dimension $k$ of the code. While polynomial sub-packetization level was achieved earlier for vector MDS codes that repair systematic nodes optimally, no such MSR code construction is known. In the low-rate regime (i. e., rates less than one-half), MSR code constructions with a linear sub-packetization level are available. But in the high-rate regime (i. e., rates greater than one-half), the known MSR code constructions required a sub-packetization level that is exponential in $k$. In the pres"},"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":"1501.06662","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-27T06:02:45Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7d478d53715045ee6659877b10a7613d62fc22313fe0e60de6f18ec7e0e4e869","abstract_canon_sha256":"cf9bb0bac9cdd4279bc0c010e391c5a1d7b87d3feb17d99256ccf6f499c6154d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:39.424480Z","signature_b64":"CAEFVNj3y4ab/gbiVWqK93Gjt/eqZpLF3nfp6+re+4PiFFjIOrgxv3DEc1HkgiaiFdN0cJCHWuScZaCxfQdJDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2525be098755ca18d77157d1680f4e0ebb2abf3b101f39b24e658d17ffc9e0ff","last_reissued_at":"2026-05-18T02:28:39.423770Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:39.423770Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A High-Rate MSR Code With Polynomial Sub-Packetization Level","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Birenjith Sasidharan, Gaurav Kumar Agarwal, P. Vijay Kumar","submitted_at":"2015-01-27T06:02:45Z","abstract_excerpt":"We present a high-rate $(n,k,d=n-1)$-MSR code with a sub-packetization level that is polynomial in the dimension $k$ of the code. While polynomial sub-packetization level was achieved earlier for vector MDS codes that repair systematic nodes optimally, no such MSR code construction is known. In the low-rate regime (i. e., rates less than one-half), MSR code constructions with a linear sub-packetization level are available. But in the high-rate regime (i. e., rates greater than one-half), the known MSR code constructions required a sub-packetization level that is exponential in $k$. In the pres"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.06662","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":"1501.06662","created_at":"2026-05-18T02:28:39.423877+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.06662v1","created_at":"2026-05-18T02:28:39.423877+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.06662","created_at":"2026-05-18T02:28:39.423877+00:00"},{"alias_kind":"pith_short_12","alias_value":"EUS34CMHKXFB","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"EUS34CMHKXFBRV3R","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"EUS34CMH","created_at":"2026-05-18T12:29:19.899920+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/EUS34CMHKXFBRV3RK7IWQD2OB2","json":"https://pith.science/pith/EUS34CMHKXFBRV3RK7IWQD2OB2.json","graph_json":"https://pith.science/api/pith-number/EUS34CMHKXFBRV3RK7IWQD2OB2/graph.json","events_json":"https://pith.science/api/pith-number/EUS34CMHKXFBRV3RK7IWQD2OB2/events.json","paper":"https://pith.science/paper/EUS34CMH"},"agent_actions":{"view_html":"https://pith.science/pith/EUS34CMHKXFBRV3RK7IWQD2OB2","download_json":"https://pith.science/pith/EUS34CMHKXFBRV3RK7IWQD2OB2.json","view_paper":"https://pith.science/paper/EUS34CMH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.06662&json=true","fetch_graph":"https://pith.science/api/pith-number/EUS34CMHKXFBRV3RK7IWQD2OB2/graph.json","fetch_events":"https://pith.science/api/pith-number/EUS34CMHKXFBRV3RK7IWQD2OB2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EUS34CMHKXFBRV3RK7IWQD2OB2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EUS34CMHKXFBRV3RK7IWQD2OB2/action/storage_attestation","attest_author":"https://pith.science/pith/EUS34CMHKXFBRV3RK7IWQD2OB2/action/author_attestation","sign_citation":"https://pith.science/pith/EUS34CMHKXFBRV3RK7IWQD2OB2/action/citation_signature","submit_replication":"https://pith.science/pith/EUS34CMHKXFBRV3RK7IWQD2OB2/action/replication_record"}},"created_at":"2026-05-18T02:28:39.423877+00:00","updated_at":"2026-05-18T02:28:39.423877+00:00"}