{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:JWSPRVTNNGZIN36OJB6BIRO645","short_pith_number":"pith:JWSPRVTN","schema_version":"1.0","canonical_sha256":"4da4f8d66d69b286efce487c1445dee7606254660711a4df23b9688fc6e36fe6","source":{"kind":"arxiv","id":"2303.10467","version":3},"attestation_state":"computed","paper":{"title":"MSR Codes with Linear Field Size and Smallest Sub-packetization for Any Number of Helper Nodes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Guodong Li, Min Ye, Ningning Wang, Sihuang Hu","submitted_at":"2023-03-18T18:30:31Z","abstract_excerpt":"The sub-packetization $\\ell$ and the field size $q$ are of paramount importance in the MSR array code constructions. For optimal-access MSR codes, Balaji et al. proved that $\\ell\\geq s^{\\left\\lceil n/s \\right\\rceil}$, where $s = d-k+1$. Rawat et al. showed that this lower bound is attainable for all admissible values of $d$ when the field size is exponential in $n$. After that, tremendous efforts have been devoted to reducing the field size. However, till now, reduction to linear field size is only available for $d\\in\\{k+1,k+2,k+3\\}$ and $d=n-1$. In this paper, we construct the first class of "},"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":"2303.10467","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-03-18T18:30:31Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6c8b673371dde5e4f24bf98c0d070d46734d6b1938c38c4585456ac21aa174a4","abstract_canon_sha256":"726976237f3409eac35deb35c00323e6c9a3b21933bebff9294be418f9e14d66"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:28:08.821068Z","signature_b64":"Lb8HrcQBUW6kcJgbgu6MdQX/j3p2TefPf4a68sJp007Yo4gGiis9Vdm0Ri/i5MjUyKju/6hIrN4aDApzG2u7BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4da4f8d66d69b286efce487c1445dee7606254660711a4df23b9688fc6e36fe6","last_reissued_at":"2026-07-05T09:28:08.820647Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:28:08.820647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"MSR Codes with Linear Field Size and Smallest Sub-packetization for Any Number of Helper Nodes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Guodong Li, Min Ye, Ningning Wang, Sihuang Hu","submitted_at":"2023-03-18T18:30:31Z","abstract_excerpt":"The sub-packetization $\\ell$ and the field size $q$ are of paramount importance in the MSR array code constructions. For optimal-access MSR codes, Balaji et al. proved that $\\ell\\geq s^{\\left\\lceil n/s \\right\\rceil}$, where $s = d-k+1$. Rawat et al. showed that this lower bound is attainable for all admissible values of $d$ when the field size is exponential in $n$. After that, tremendous efforts have been devoted to reducing the field size. However, till now, reduction to linear field size is only available for $d\\in\\{k+1,k+2,k+3\\}$ and $d=n-1$. In this paper, we construct the first class of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.10467","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2303.10467/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2303.10467","created_at":"2026-07-05T09:28:08.820704+00:00"},{"alias_kind":"arxiv_version","alias_value":"2303.10467v3","created_at":"2026-07-05T09:28:08.820704+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.10467","created_at":"2026-07-05T09:28:08.820704+00:00"},{"alias_kind":"pith_short_12","alias_value":"JWSPRVTNNGZI","created_at":"2026-07-05T09:28:08.820704+00:00"},{"alias_kind":"pith_short_16","alias_value":"JWSPRVTNNGZIN36O","created_at":"2026-07-05T09:28:08.820704+00:00"},{"alias_kind":"pith_short_8","alias_value":"JWSPRVTN","created_at":"2026-07-05T09:28:08.820704+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/JWSPRVTNNGZIN36OJB6BIRO645","json":"https://pith.science/pith/JWSPRVTNNGZIN36OJB6BIRO645.json","graph_json":"https://pith.science/api/pith-number/JWSPRVTNNGZIN36OJB6BIRO645/graph.json","events_json":"https://pith.science/api/pith-number/JWSPRVTNNGZIN36OJB6BIRO645/events.json","paper":"https://pith.science/paper/JWSPRVTN"},"agent_actions":{"view_html":"https://pith.science/pith/JWSPRVTNNGZIN36OJB6BIRO645","download_json":"https://pith.science/pith/JWSPRVTNNGZIN36OJB6BIRO645.json","view_paper":"https://pith.science/paper/JWSPRVTN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2303.10467&json=true","fetch_graph":"https://pith.science/api/pith-number/JWSPRVTNNGZIN36OJB6BIRO645/graph.json","fetch_events":"https://pith.science/api/pith-number/JWSPRVTNNGZIN36OJB6BIRO645/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JWSPRVTNNGZIN36OJB6BIRO645/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JWSPRVTNNGZIN36OJB6BIRO645/action/storage_attestation","attest_author":"https://pith.science/pith/JWSPRVTNNGZIN36OJB6BIRO645/action/author_attestation","sign_citation":"https://pith.science/pith/JWSPRVTNNGZIN36OJB6BIRO645/action/citation_signature","submit_replication":"https://pith.science/pith/JWSPRVTNNGZIN36OJB6BIRO645/action/replication_record"}},"created_at":"2026-07-05T09:28:08.820704+00:00","updated_at":"2026-07-05T09:28:08.820704+00:00"}