{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:BIMVZB7SAXPXGSLCW4HI7Z53UD","short_pith_number":"pith:BIMVZB7S","schema_version":"1.0","canonical_sha256":"0a195c87f205df734962b70e8fe7bba0ef864fc9eeaff346fd7c522e37a099ee","source":{"kind":"arxiv","id":"1607.07335","version":3},"attestation_state":"computed","paper":{"title":"An Explicit, Coupled-Layer Construction of a High-Rate MSR Code with Low Sub-Packetization Level, Small Field Size and All-Node Repair","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Birenjith Sasidharan, Myna Vajha, P. Vijay Kumar","submitted_at":"2016-07-25T16:08:07Z","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"},"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":"1607.07335","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-25T16:08:07Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a4562c7b14cc16154e0241aac97fa4a53a98bdf1ee499462c7ed8b66b4a1cca8","abstract_canon_sha256":"344bd5433036e67c6875909e75723a5835695f785048c6c6fe81de8e58e9951c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:27.221956Z","signature_b64":"Z1McYCP/Ac3mMiBLs0d3Dd97RQBr12tNIHF3mWd7XleiR9UFmQbeqG/Abi0fBhB8EeVJszYlPuMRHZFtl2EHDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0a195c87f205df734962b70e8fe7bba0ef864fc9eeaff346fd7c522e37a099ee","last_reissued_at":"2026-05-18T01:04:27.221327Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:27.221327Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Explicit, Coupled-Layer Construction of a High-Rate MSR Code with Low Sub-Packetization Level, Small Field Size and All-Node Repair","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Birenjith Sasidharan, Myna Vajha, P. Vijay Kumar","submitted_at":"2016-07-25T16:08:07Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.07335","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":"1607.07335","created_at":"2026-05-18T01:04:27.221419+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.07335v3","created_at":"2026-05-18T01:04:27.221419+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.07335","created_at":"2026-05-18T01:04:27.221419+00:00"},{"alias_kind":"pith_short_12","alias_value":"BIMVZB7SAXPX","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_16","alias_value":"BIMVZB7SAXPXGSLC","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_8","alias_value":"BIMVZB7S","created_at":"2026-05-18T12:30:07.202191+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.03931","citing_title":"Near-optimal Repair of Reed-Solomon Codes with Low Sub-packetization","ref_index":11,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BIMVZB7SAXPXGSLCW4HI7Z53UD","json":"https://pith.science/pith/BIMVZB7SAXPXGSLCW4HI7Z53UD.json","graph_json":"https://pith.science/api/pith-number/BIMVZB7SAXPXGSLCW4HI7Z53UD/graph.json","events_json":"https://pith.science/api/pith-number/BIMVZB7SAXPXGSLCW4HI7Z53UD/events.json","paper":"https://pith.science/paper/BIMVZB7S"},"agent_actions":{"view_html":"https://pith.science/pith/BIMVZB7SAXPXGSLCW4HI7Z53UD","download_json":"https://pith.science/pith/BIMVZB7SAXPXGSLCW4HI7Z53UD.json","view_paper":"https://pith.science/paper/BIMVZB7S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.07335&json=true","fetch_graph":"https://pith.science/api/pith-number/BIMVZB7SAXPXGSLCW4HI7Z53UD/graph.json","fetch_events":"https://pith.science/api/pith-number/BIMVZB7SAXPXGSLCW4HI7Z53UD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BIMVZB7SAXPXGSLCW4HI7Z53UD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BIMVZB7SAXPXGSLCW4HI7Z53UD/action/storage_attestation","attest_author":"https://pith.science/pith/BIMVZB7SAXPXGSLCW4HI7Z53UD/action/author_attestation","sign_citation":"https://pith.science/pith/BIMVZB7SAXPXGSLCW4HI7Z53UD/action/citation_signature","submit_replication":"https://pith.science/pith/BIMVZB7SAXPXGSLCW4HI7Z53UD/action/replication_record"}},"created_at":"2026-05-18T01:04:27.221419+00:00","updated_at":"2026-05-18T01:04:27.221419+00:00"}