{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:JXMMUYXCCUQOG4ZPIRLVJDT6B3","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":"a1bfe058e29cfdef9e9ecd7d83ac55f42d63b86ba662b38d3aeba0d2846f402a","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2022-08-08T13:59:11Z","title_canon_sha256":"3d60a975af28775f7b277d098b058c825fe0c46877907b5912b45b9cd0471d28"},"schema_version":"1.0","source":{"id":"2208.04159","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2208.04159","created_at":"2026-07-05T06:11:56Z"},{"alias_kind":"arxiv_version","alias_value":"2208.04159v2","created_at":"2026-07-05T06:11:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.04159","created_at":"2026-07-05T06:11:56Z"},{"alias_kind":"pith_short_12","alias_value":"JXMMUYXCCUQO","created_at":"2026-07-05T06:11:56Z"},{"alias_kind":"pith_short_16","alias_value":"JXMMUYXCCUQOG4ZP","created_at":"2026-07-05T06:11:56Z"},{"alias_kind":"pith_short_8","alias_value":"JXMMUYXC","created_at":"2026-07-05T06:11:56Z"}],"graph_snapshots":[{"event_id":"sha256:858d242427a899f34633bc93968e495d837fae47b850f0e1d893bbd2b12e63ba","target":"graph","created_at":"2026-07-05T06:11:56Z","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/2208.04159/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Wang et al. (IEEE Transactions on Information Theory, vol. 62, no. 8, 2016) proposed an explicit construction of an $(n=k+2,k)$ Minimum Storage Regenerating (MSR) code with $2$ parity nodes and subpacketization $2^{k/3}$. The number of helper nodes for this code is $d=k+1=n-1$, and this code has the smallest subpacketization among all the existing explicit constructions of MSR codes with the same $n,k$ and $d$. In this paper, we present a new construction of MSR codes for a wider range of parameters. More precisely, we still fix $d=k+1$, but we allow the code length $n$ to be any integer satis","authors_text":"Guodong Li, Min Ye, Ningning Wang, Sihuang Hu","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2022-08-08T13:59:11Z","title":"Constructing MSR codes with subpacketization $2^{n/3}$ for $k+1$ helper nodes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.04159","kind":"arxiv","version":2},"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:db90d99c8998349491ab4ef1c75b5915c19e9600a97e60f5f4a8eb3e3123daf4","target":"record","created_at":"2026-07-05T06:11:56Z","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":"a1bfe058e29cfdef9e9ecd7d83ac55f42d63b86ba662b38d3aeba0d2846f402a","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2022-08-08T13:59:11Z","title_canon_sha256":"3d60a975af28775f7b277d098b058c825fe0c46877907b5912b45b9cd0471d28"},"schema_version":"1.0","source":{"id":"2208.04159","kind":"arxiv","version":2}},"canonical_sha256":"4dd8ca62e21520e3732f4457548e7e0eeba5931dbdb566d26caccbc291bb367c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4dd8ca62e21520e3732f4457548e7e0eeba5931dbdb566d26caccbc291bb367c","first_computed_at":"2026-07-05T06:11:56.413427Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:11:56.413427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6FIobMuZ4nv3Lg9eeoGJA+6ZdII/7G0gmLK61LZxKtMvql0cv/CJXQBEnb5dvzBfBWz3GaPa9SCmxTgIGDpbCA==","signature_status":"signed_v1","signed_at":"2026-07-05T06:11:56.413780Z","signed_message":"canonical_sha256_bytes"},"source_id":"2208.04159","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:db90d99c8998349491ab4ef1c75b5915c19e9600a97e60f5f4a8eb3e3123daf4","sha256:858d242427a899f34633bc93968e495d837fae47b850f0e1d893bbd2b12e63ba"],"state_sha256":"53125d4974207a6ea3585d3182558705d1d00f2ba98dbe172d88e3cc882f4778"}