{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:3CJJWWHHJUEFAVOFIJIHP6OZQT","short_pith_number":"pith:3CJJWWHH","schema_version":"1.0","canonical_sha256":"d8929b58e74d085055c5425077f9d984f5bc5209632b71bec36aae5cd03e891f","source":{"kind":"arxiv","id":"1605.08630","version":4},"attestation_state":"computed","paper":{"title":"Explicit constructions of optimal-access MDS codes with nearly optimal sub-packetization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexander Barg, Min Ye","submitted_at":"2016-05-27T13:28:05Z","abstract_excerpt":"An $(n,k,l)$ MDS array code of length $n,$ dimension $k=n-r$ and sub-packetization $l$ is formed of $l\\times n$ matrices over a finite field $F,$ with every column of the matrix stored on a separate node in a distributed storage system and viewed as a coordinate of the codeword. Repair of a failed node can be performed by accessing a set of $d\\le n-1$ helper nodes. The code is said to have the optimal access property if the amount of data accessed at each of the helper nodes meets a lower bound on this quantity. For optimal-access MDS codes with $d=n-1,$ the sub-packetization $l$ satisfies the"},"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":"1605.08630","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-27T13:28:05Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b84d832bb54a9f882968d874c9af9a26b05486c310274a4cf12cfcb75a8cbc7b","abstract_canon_sha256":"6ac89a92f01733246dd87d103e50d8231ba55e2ba0d94538eed7d0a78cec96cd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:18.358575Z","signature_b64":"tj4Pqekl+X3/DGdgxNMhhP4EzLbLH1R1xkEy1qPrfRfOkJ9KyLYTaQE537QQfB2J2qEJwY+YkHgBhTp1oszRDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d8929b58e74d085055c5425077f9d984f5bc5209632b71bec36aae5cd03e891f","last_reissued_at":"2026-05-18T00:39:18.357941Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:18.357941Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Explicit constructions of optimal-access MDS codes with nearly optimal sub-packetization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexander Barg, Min Ye","submitted_at":"2016-05-27T13:28:05Z","abstract_excerpt":"An $(n,k,l)$ MDS array code of length $n,$ dimension $k=n-r$ and sub-packetization $l$ is formed of $l\\times n$ matrices over a finite field $F,$ with every column of the matrix stored on a separate node in a distributed storage system and viewed as a coordinate of the codeword. Repair of a failed node can be performed by accessing a set of $d\\le n-1$ helper nodes. The code is said to have the optimal access property if the amount of data accessed at each of the helper nodes meets a lower bound on this quantity. For optimal-access MDS codes with $d=n-1,$ the sub-packetization $l$ satisfies the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.08630","kind":"arxiv","version":4},"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":"1605.08630","created_at":"2026-05-18T00:39:18.358017+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.08630v4","created_at":"2026-05-18T00:39:18.358017+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.08630","created_at":"2026-05-18T00:39:18.358017+00:00"},{"alias_kind":"pith_short_12","alias_value":"3CJJWWHHJUEF","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"3CJJWWHHJUEFAVOF","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"3CJJWWHH","created_at":"2026-05-18T12:29:55.572404+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/3CJJWWHHJUEFAVOFIJIHP6OZQT","json":"https://pith.science/pith/3CJJWWHHJUEFAVOFIJIHP6OZQT.json","graph_json":"https://pith.science/api/pith-number/3CJJWWHHJUEFAVOFIJIHP6OZQT/graph.json","events_json":"https://pith.science/api/pith-number/3CJJWWHHJUEFAVOFIJIHP6OZQT/events.json","paper":"https://pith.science/paper/3CJJWWHH"},"agent_actions":{"view_html":"https://pith.science/pith/3CJJWWHHJUEFAVOFIJIHP6OZQT","download_json":"https://pith.science/pith/3CJJWWHHJUEFAVOFIJIHP6OZQT.json","view_paper":"https://pith.science/paper/3CJJWWHH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.08630&json=true","fetch_graph":"https://pith.science/api/pith-number/3CJJWWHHJUEFAVOFIJIHP6OZQT/graph.json","fetch_events":"https://pith.science/api/pith-number/3CJJWWHHJUEFAVOFIJIHP6OZQT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3CJJWWHHJUEFAVOFIJIHP6OZQT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3CJJWWHHJUEFAVOFIJIHP6OZQT/action/storage_attestation","attest_author":"https://pith.science/pith/3CJJWWHHJUEFAVOFIJIHP6OZQT/action/author_attestation","sign_citation":"https://pith.science/pith/3CJJWWHHJUEFAVOFIJIHP6OZQT/action/citation_signature","submit_replication":"https://pith.science/pith/3CJJWWHHJUEFAVOFIJIHP6OZQT/action/replication_record"}},"created_at":"2026-05-18T00:39:18.358017+00:00","updated_at":"2026-05-18T00:39:18.358017+00:00"}