{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:NQ5GVNLIBXIT7BNLLYCVOX6SHS","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":"ccf4d21059e8d3aa83977a7d0db54cc5afbd934f22e8dba1b8e9c8bbaabcc1b6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-24T09:31:24Z","title_canon_sha256":"8e241c827a1e48f6ab85eb3fd4474ad4021c1f130087aaf93cd40fa7d119328d"},"schema_version":"1.0","source":{"id":"1601.06362","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.06362","created_at":"2026-05-18T01:22:04Z"},{"alias_kind":"arxiv_version","alias_value":"1601.06362v1","created_at":"2026-05-18T01:22:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.06362","created_at":"2026-05-18T01:22:04Z"},{"alias_kind":"pith_short_12","alias_value":"NQ5GVNLIBXIT","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"NQ5GVNLIBXIT7BNL","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"NQ5GVNLI","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:e0d98baa22983e68e0708f7f53baf000ba18b2d2a14b868e5daf3bcd89e5a507","target":"graph","created_at":"2026-05-18T01:22:04Z","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"},"paper":{"abstract_excerpt":"This paper presents a construction for high-rate MDS codes that enable bandwidth-efficient repair of a single node. Such MDS codes are also referred to as the minimum storage regenerating (MSR) codes in the distributed storage literature. The construction presented in this paper generates MSR codes for all possible number of helper nodes $d$ as $d$ is a design parameter in the construction. Furthermore, the obtained MSR codes have polynomial sub-packetization (a.k.a. node size) $\\alpha$. The construction is built on the recent code proposed by Sasidharan et al. [1], which works only for $d = n","authors_text":"Ankit Singh Rawat, O. Ozan Koyluoglu, Sriram Vishwanath","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-24T09:31:24Z","title":"Progress on High-rate MSR Codes: Enabling Arbitrary Number of Helper Nodes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.06362","kind":"arxiv","version":1},"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:298fb541d23af0c165f6f924a5de6aeac97df63566816a76dd288507ac0230ca","target":"record","created_at":"2026-05-18T01:22:04Z","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":"ccf4d21059e8d3aa83977a7d0db54cc5afbd934f22e8dba1b8e9c8bbaabcc1b6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-24T09:31:24Z","title_canon_sha256":"8e241c827a1e48f6ab85eb3fd4474ad4021c1f130087aaf93cd40fa7d119328d"},"schema_version":"1.0","source":{"id":"1601.06362","kind":"arxiv","version":1}},"canonical_sha256":"6c3a6ab5680dd13f85ab5e05575fd23c8b2898456aefc49f3274e440173663ea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c3a6ab5680dd13f85ab5e05575fd23c8b2898456aefc49f3274e440173663ea","first_computed_at":"2026-05-18T01:22:04.641940Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:22:04.641940Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZKzIxb1ETZR/oeqUG6dVxo5tFA+AxDMuZv/Axl5gFbRt1UOwHt6NMZNxJRQ7PP+TbsZsHQ7Tcbzb7010XgdmBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:22:04.642344Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.06362","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:298fb541d23af0c165f6f924a5de6aeac97df63566816a76dd288507ac0230ca","sha256:e0d98baa22983e68e0708f7f53baf000ba18b2d2a14b868e5daf3bcd89e5a507"],"state_sha256":"36571a2e1b66872b12c31060e59ac86793db00db821560fc3a60a5f08b627937"}