{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:BIMVZB7SAXPXGSLCW4HI7Z53UD","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":"344bd5433036e67c6875909e75723a5835695f785048c6c6fe81de8e58e9951c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-25T16:08:07Z","title_canon_sha256":"a4562c7b14cc16154e0241aac97fa4a53a98bdf1ee499462c7ed8b66b4a1cca8"},"schema_version":"1.0","source":{"id":"1607.07335","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.07335","created_at":"2026-05-18T01:04:27Z"},{"alias_kind":"arxiv_version","alias_value":"1607.07335v3","created_at":"2026-05-18T01:04:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.07335","created_at":"2026-05-18T01:04:27Z"},{"alias_kind":"pith_short_12","alias_value":"BIMVZB7SAXPX","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"BIMVZB7SAXPXGSLC","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"BIMVZB7S","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:31c81cd33b88e4082b74e6ea70269997fa640be61de4ac118f7b2b6b874263cf","target":"graph","created_at":"2026-05-18T01:04:27Z","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 an explicit construction for an $((n,k,d=n-1), (\\alpha,\\beta))$ regenerating code over a field $\\mathbb{F}_Q$ operating at the Minimum Storage Regeneration (MSR) point. The MSR code can be constructed to have rate $k/n$ as close to $1$ as desired, sub-packetization given by $r^{\\frac{n}{r}}$, for $r=(n-k)$, field size no larger than $n$ and where all code symbols can be repaired with the same minimum data download. The construction modifies a prior construction by Sasidharan et. al. which required far larger field-size. A building block appearing in the construction is a sc","authors_text":"Birenjith Sasidharan, Myna Vajha, P. Vijay Kumar","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-25T16:08:07Z","title":"An Explicit, Coupled-Layer Construction of a High-Rate MSR Code with Low Sub-Packetization Level, Small Field Size and All-Node Repair"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.07335","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:3e4275b5f49fa2f8bada99749b589f5ee410ce0c57c501a7c602665c805e302c","target":"record","created_at":"2026-05-18T01:04:27Z","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":"344bd5433036e67c6875909e75723a5835695f785048c6c6fe81de8e58e9951c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-25T16:08:07Z","title_canon_sha256":"a4562c7b14cc16154e0241aac97fa4a53a98bdf1ee499462c7ed8b66b4a1cca8"},"schema_version":"1.0","source":{"id":"1607.07335","kind":"arxiv","version":3}},"canonical_sha256":"0a195c87f205df734962b70e8fe7bba0ef864fc9eeaff346fd7c522e37a099ee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0a195c87f205df734962b70e8fe7bba0ef864fc9eeaff346fd7c522e37a099ee","first_computed_at":"2026-05-18T01:04:27.221327Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:27.221327Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Z1McYCP/Ac3mMiBLs0d3Dd97RQBr12tNIHF3mWd7XleiR9UFmQbeqG/Abi0fBhB8EeVJszYlPuMRHZFtl2EHDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:27.221956Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.07335","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3e4275b5f49fa2f8bada99749b589f5ee410ce0c57c501a7c602665c805e302c","sha256:31c81cd33b88e4082b74e6ea70269997fa640be61de4ac118f7b2b6b874263cf"],"state_sha256":"010459c76cc2ba09e33b48b4cf2c7013d11083f50fa2e63246cd344f7df4e5e6"}