{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:JWSPRVTNNGZIN36OJB6BIRO645","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"726976237f3409eac35deb35c00323e6c9a3b21933bebff9294be418f9e14d66","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-03-18T18:30:31Z","title_canon_sha256":"6c8b673371dde5e4f24bf98c0d070d46734d6b1938c38c4585456ac21aa174a4"},"schema_version":"1.0","source":{"id":"2303.10467","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2303.10467","created_at":"2026-07-05T09:28:08Z"},{"alias_kind":"arxiv_version","alias_value":"2303.10467v3","created_at":"2026-07-05T09:28:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.10467","created_at":"2026-07-05T09:28:08Z"},{"alias_kind":"pith_short_12","alias_value":"JWSPRVTNNGZI","created_at":"2026-07-05T09:28:08Z"},{"alias_kind":"pith_short_16","alias_value":"JWSPRVTNNGZIN36O","created_at":"2026-07-05T09:28:08Z"},{"alias_kind":"pith_short_8","alias_value":"JWSPRVTN","created_at":"2026-07-05T09:28:08Z"}],"graph_snapshots":[{"event_id":"sha256:6742ab6821b070b2f06a61b65224e4ee8709a41ee57a667c6f8a2d97601e54d3","target":"graph","created_at":"2026-07-05T09:28:08Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2303.10467/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Guodong Li, Min Ye, Ningning Wang, Sihuang Hu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-03-18T18:30:31Z","title":"MSR Codes with Linear Field Size and Smallest Sub-packetization for Any Number of Helper Nodes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.10467","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:5cb62c4caf18189816e5c49ea05b4462c6defbe45731495da21099f744a57eec","target":"record","created_at":"2026-07-05T09:28:08Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"726976237f3409eac35deb35c00323e6c9a3b21933bebff9294be418f9e14d66","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-03-18T18:30:31Z","title_canon_sha256":"6c8b673371dde5e4f24bf98c0d070d46734d6b1938c38c4585456ac21aa174a4"},"schema_version":"1.0","source":{"id":"2303.10467","kind":"arxiv","version":3}},"canonical_sha256":"4da4f8d66d69b286efce487c1445dee7606254660711a4df23b9688fc6e36fe6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4da4f8d66d69b286efce487c1445dee7606254660711a4df23b9688fc6e36fe6","first_computed_at":"2026-07-05T09:28:08.820647Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:28:08.820647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Lb8HrcQBUW6kcJgbgu6MdQX/j3p2TefPf4a68sJp007Yo4gGiis9Vdm0Ri/i5MjUyKju/6hIrN4aDApzG2u7BA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:28:08.821068Z","signed_message":"canonical_sha256_bytes"},"source_id":"2303.10467","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5cb62c4caf18189816e5c49ea05b4462c6defbe45731495da21099f744a57eec","sha256:6742ab6821b070b2f06a61b65224e4ee8709a41ee57a667c6f8a2d97601e54d3"],"state_sha256":"bdfc15d83d372ba2d52decc05ac97110f0972e76476624a7352ce4c409ad062c"}