{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:EDRULIB2RGMYZI2JFMVOUJNJCE","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":"b57246f7cf28f096b180780c389b94d3bea8be32e073d10b0fe01494dc3a62a2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-05T08:42:25Z","title_canon_sha256":"09ed6744a717f79c068846976afd50e0aee62b5c18e2f7bf2debb438fcd57b16"},"schema_version":"1.0","source":{"id":"1505.00919","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.00919","created_at":"2026-05-18T01:21:44Z"},{"alias_kind":"arxiv_version","alias_value":"1505.00919v3","created_at":"2026-05-18T01:21:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.00919","created_at":"2026-05-18T01:21:44Z"},{"alias_kind":"pith_short_12","alias_value":"EDRULIB2RGMY","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EDRULIB2RGMYZI2J","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EDRULIB2","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:df2520794a482b038e8ad1858411b4dfc4f11d9cc46fb650342e6dff3f807eaf","target":"graph","created_at":"2026-05-18T01:21:44Z","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":"A novel technique for construction of minimum storage regenerating (MSR) codes is presented. Based on this technique, three explicit constructions of MSR codes are given. The first two constructions provide access-optimal MSR codes, with two and three parities, respectively, which attain the sub-packetization bound for access-optimal codes. The third construction provides longer MSR codes with three parities, which are not access-optimal, and do not necessarily attain the sub-packetization bound.\n  In addition to a minimum storage in a node, all three constructions allow the entire data to be ","authors_text":"Natalia Silberstein, Netanel Raviv, Tuvi Etzion","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-05T08:42:25Z","title":"Constructions of High-Rate MSR Codes over Small Fields"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.00919","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:3f4a6814fa2f20894bed557c7b9aaa53a338a7d577bd2694902ddceff22c2487","target":"record","created_at":"2026-05-18T01:21:44Z","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":"b57246f7cf28f096b180780c389b94d3bea8be32e073d10b0fe01494dc3a62a2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-05T08:42:25Z","title_canon_sha256":"09ed6744a717f79c068846976afd50e0aee62b5c18e2f7bf2debb438fcd57b16"},"schema_version":"1.0","source":{"id":"1505.00919","kind":"arxiv","version":3}},"canonical_sha256":"20e345a03a89998ca3492b2aea25a9111491557691b811ee67a5e9ad6bea3014","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"20e345a03a89998ca3492b2aea25a9111491557691b811ee67a5e9ad6bea3014","first_computed_at":"2026-05-18T01:21:44.990229Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:44.990229Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LmXyp+TupKUhb9FjUayeKYq1h02Ss9OweZ0OGlXoWRxqcQWtAWLeUnq9UFvvMle6wI5zSXv1vNtie3yVQOIRAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:44.990748Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.00919","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3f4a6814fa2f20894bed557c7b9aaa53a338a7d577bd2694902ddceff22c2487","sha256:df2520794a482b038e8ad1858411b4dfc4f11d9cc46fb650342e6dff3f807eaf"],"state_sha256":"645133727c8641a03f119a9153d8e9a1b8c430ea0400fa7c49e0770fcb266951"}