{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:JXMMUYXCCUQOG4ZPIRLVJDT6B3","short_pith_number":"pith:JXMMUYXC","schema_version":"1.0","canonical_sha256":"4dd8ca62e21520e3732f4457548e7e0eeba5931dbdb566d26caccbc291bb367c","source":{"kind":"arxiv","id":"2208.04159","version":2},"attestation_state":"computed","paper":{"title":"Constructing MSR codes with subpacketization $2^{n/3}$ for $k+1$ helper nodes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Guodong Li, Min Ye, Ningning Wang, Sihuang Hu","submitted_at":"2022-08-08T13:59:11Z","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"},"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":"2208.04159","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2022-08-08T13:59:11Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3d60a975af28775f7b277d098b058c825fe0c46877907b5912b45b9cd0471d28","abstract_canon_sha256":"a1bfe058e29cfdef9e9ecd7d83ac55f42d63b86ba662b38d3aeba0d2846f402a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:11:56.413780Z","signature_b64":"6FIobMuZ4nv3Lg9eeoGJA+6ZdII/7G0gmLK61LZxKtMvql0cv/CJXQBEnb5dvzBfBWz3GaPa9SCmxTgIGDpbCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4dd8ca62e21520e3732f4457548e7e0eeba5931dbdb566d26caccbc291bb367c","last_reissued_at":"2026-07-05T06:11:56.413427Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:11:56.413427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constructing MSR codes with subpacketization $2^{n/3}$ for $k+1$ helper nodes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Guodong Li, Min Ye, Ningning Wang, Sihuang Hu","submitted_at":"2022-08-08T13:59:11Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.04159","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2208.04159/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":"2208.04159","created_at":"2026-07-05T06:11:56.413484+00:00"},{"alias_kind":"arxiv_version","alias_value":"2208.04159v2","created_at":"2026-07-05T06:11:56.413484+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.04159","created_at":"2026-07-05T06:11:56.413484+00:00"},{"alias_kind":"pith_short_12","alias_value":"JXMMUYXCCUQO","created_at":"2026-07-05T06:11:56.413484+00:00"},{"alias_kind":"pith_short_16","alias_value":"JXMMUYXCCUQOG4ZP","created_at":"2026-07-05T06:11:56.413484+00:00"},{"alias_kind":"pith_short_8","alias_value":"JXMMUYXC","created_at":"2026-07-05T06:11:56.413484+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/JXMMUYXCCUQOG4ZPIRLVJDT6B3","json":"https://pith.science/pith/JXMMUYXCCUQOG4ZPIRLVJDT6B3.json","graph_json":"https://pith.science/api/pith-number/JXMMUYXCCUQOG4ZPIRLVJDT6B3/graph.json","events_json":"https://pith.science/api/pith-number/JXMMUYXCCUQOG4ZPIRLVJDT6B3/events.json","paper":"https://pith.science/paper/JXMMUYXC"},"agent_actions":{"view_html":"https://pith.science/pith/JXMMUYXCCUQOG4ZPIRLVJDT6B3","download_json":"https://pith.science/pith/JXMMUYXCCUQOG4ZPIRLVJDT6B3.json","view_paper":"https://pith.science/paper/JXMMUYXC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2208.04159&json=true","fetch_graph":"https://pith.science/api/pith-number/JXMMUYXCCUQOG4ZPIRLVJDT6B3/graph.json","fetch_events":"https://pith.science/api/pith-number/JXMMUYXCCUQOG4ZPIRLVJDT6B3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JXMMUYXCCUQOG4ZPIRLVJDT6B3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JXMMUYXCCUQOG4ZPIRLVJDT6B3/action/storage_attestation","attest_author":"https://pith.science/pith/JXMMUYXCCUQOG4ZPIRLVJDT6B3/action/author_attestation","sign_citation":"https://pith.science/pith/JXMMUYXCCUQOG4ZPIRLVJDT6B3/action/citation_signature","submit_replication":"https://pith.science/pith/JXMMUYXCCUQOG4ZPIRLVJDT6B3/action/replication_record"}},"created_at":"2026-07-05T06:11:56.413484+00:00","updated_at":"2026-07-05T06:11:56.413484+00:00"}