{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:EDRULIB2RGMYZI2JFMVOUJNJCE","short_pith_number":"pith:EDRULIB2","schema_version":"1.0","canonical_sha256":"20e345a03a89998ca3492b2aea25a9111491557691b811ee67a5e9ad6bea3014","source":{"kind":"arxiv","id":"1505.00919","version":3},"attestation_state":"computed","paper":{"title":"Constructions of High-Rate MSR Codes over Small Fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Natalia Silberstein, Netanel Raviv, Tuvi Etzion","submitted_at":"2015-05-05T08:42:25Z","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 "},"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":"1505.00919","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-05T08:42:25Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"09ed6744a717f79c068846976afd50e0aee62b5c18e2f7bf2debb438fcd57b16","abstract_canon_sha256":"b57246f7cf28f096b180780c389b94d3bea8be32e073d10b0fe01494dc3a62a2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:44.990748Z","signature_b64":"LmXyp+TupKUhb9FjUayeKYq1h02Ss9OweZ0OGlXoWRxqcQWtAWLeUnq9UFvvMle6wI5zSXv1vNtie3yVQOIRAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20e345a03a89998ca3492b2aea25a9111491557691b811ee67a5e9ad6bea3014","last_reissued_at":"2026-05-18T01:21:44.990229Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:44.990229Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constructions of High-Rate MSR Codes over Small Fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Natalia Silberstein, Netanel Raviv, Tuvi Etzion","submitted_at":"2015-05-05T08:42:25Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.00919","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1505.00919","created_at":"2026-05-18T01:21:44.990324+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.00919v3","created_at":"2026-05-18T01:21:44.990324+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.00919","created_at":"2026-05-18T01:21:44.990324+00:00"},{"alias_kind":"pith_short_12","alias_value":"EDRULIB2RGMY","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"EDRULIB2RGMYZI2J","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"EDRULIB2","created_at":"2026-05-18T12:29:19.899920+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/EDRULIB2RGMYZI2JFMVOUJNJCE","json":"https://pith.science/pith/EDRULIB2RGMYZI2JFMVOUJNJCE.json","graph_json":"https://pith.science/api/pith-number/EDRULIB2RGMYZI2JFMVOUJNJCE/graph.json","events_json":"https://pith.science/api/pith-number/EDRULIB2RGMYZI2JFMVOUJNJCE/events.json","paper":"https://pith.science/paper/EDRULIB2"},"agent_actions":{"view_html":"https://pith.science/pith/EDRULIB2RGMYZI2JFMVOUJNJCE","download_json":"https://pith.science/pith/EDRULIB2RGMYZI2JFMVOUJNJCE.json","view_paper":"https://pith.science/paper/EDRULIB2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.00919&json=true","fetch_graph":"https://pith.science/api/pith-number/EDRULIB2RGMYZI2JFMVOUJNJCE/graph.json","fetch_events":"https://pith.science/api/pith-number/EDRULIB2RGMYZI2JFMVOUJNJCE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EDRULIB2RGMYZI2JFMVOUJNJCE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EDRULIB2RGMYZI2JFMVOUJNJCE/action/storage_attestation","attest_author":"https://pith.science/pith/EDRULIB2RGMYZI2JFMVOUJNJCE/action/author_attestation","sign_citation":"https://pith.science/pith/EDRULIB2RGMYZI2JFMVOUJNJCE/action/citation_signature","submit_replication":"https://pith.science/pith/EDRULIB2RGMYZI2JFMVOUJNJCE/action/replication_record"}},"created_at":"2026-05-18T01:21:44.990324+00:00","updated_at":"2026-05-18T01:21:44.990324+00:00"}