{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:CRERAQOWXPBWULOQHJTTLCZXYV","short_pith_number":"pith:CRERAQOW","schema_version":"1.0","canonical_sha256":"14491041d6bbc36a2dd03a67358b37c5615e0da74f0d61d04b24c3ad6f19183d","source":{"kind":"arxiv","id":"1804.00564","version":1},"attestation_state":"computed","paper":{"title":"Codes with Combined Locality and Regeneration Having Optimal Rate, $d_{\\text{min}}$ and Linear Field Size","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anantha Narayanan R., M. Nikhil Krishnan, P. Vijay Kumar","submitted_at":"2018-04-02T14:40:55Z","abstract_excerpt":"In this paper, we study vector codes with all-symbol locality, where the local code is either a Minimum Bandwidth Regenerating (MBR) code or a Minimum Storage Regenerating (MSR) code. In the first part, we present vector codes with all-symbol MBR locality, for all parameters, that have both optimal minimum-distance and optimal rate. These codes combine ideas from two popular codes in the distributed storage literature, Product-Matrix codes and Tamo-Barg codes. In the second part which deals with codes having all-symbol MSR locality, we follow a Pairwise Coupling Transform-based approach to arr"},"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":"1804.00564","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-02T14:40:55Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"668a2e9c62f20730aea093aca593341a5262d11cb4bcda45db152beeb791d064","abstract_canon_sha256":"e30dd2c3e124501d372b0495dd0e8f78e86c256f123ad3a050f213fd0e1bcff1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:36.619928Z","signature_b64":"iS7RCcABVYb/jjfMUBus2oZekzM+dEN1tAjrYllkUBBUF0/tLbLCrMmXtJR642PEBT0mPAewKItX4zAqLT31Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"14491041d6bbc36a2dd03a67358b37c5615e0da74f0d61d04b24c3ad6f19183d","last_reissued_at":"2026-05-18T00:19:36.619378Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:36.619378Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Codes with Combined Locality and Regeneration Having Optimal Rate, $d_{\\text{min}}$ and Linear Field Size","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anantha Narayanan R., M. Nikhil Krishnan, P. Vijay Kumar","submitted_at":"2018-04-02T14:40:55Z","abstract_excerpt":"In this paper, we study vector codes with all-symbol locality, where the local code is either a Minimum Bandwidth Regenerating (MBR) code or a Minimum Storage Regenerating (MSR) code. In the first part, we present vector codes with all-symbol MBR locality, for all parameters, that have both optimal minimum-distance and optimal rate. These codes combine ideas from two popular codes in the distributed storage literature, Product-Matrix codes and Tamo-Barg codes. In the second part which deals with codes having all-symbol MSR locality, we follow a Pairwise Coupling Transform-based approach to arr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.00564","kind":"arxiv","version":1},"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":"1804.00564","created_at":"2026-05-18T00:19:36.619468+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.00564v1","created_at":"2026-05-18T00:19:36.619468+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.00564","created_at":"2026-05-18T00:19:36.619468+00:00"},{"alias_kind":"pith_short_12","alias_value":"CRERAQOWXPBW","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"CRERAQOWXPBWULOQ","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"CRERAQOW","created_at":"2026-05-18T12:32:16.446611+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/CRERAQOWXPBWULOQHJTTLCZXYV","json":"https://pith.science/pith/CRERAQOWXPBWULOQHJTTLCZXYV.json","graph_json":"https://pith.science/api/pith-number/CRERAQOWXPBWULOQHJTTLCZXYV/graph.json","events_json":"https://pith.science/api/pith-number/CRERAQOWXPBWULOQHJTTLCZXYV/events.json","paper":"https://pith.science/paper/CRERAQOW"},"agent_actions":{"view_html":"https://pith.science/pith/CRERAQOWXPBWULOQHJTTLCZXYV","download_json":"https://pith.science/pith/CRERAQOWXPBWULOQHJTTLCZXYV.json","view_paper":"https://pith.science/paper/CRERAQOW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.00564&json=true","fetch_graph":"https://pith.science/api/pith-number/CRERAQOWXPBWULOQHJTTLCZXYV/graph.json","fetch_events":"https://pith.science/api/pith-number/CRERAQOWXPBWULOQHJTTLCZXYV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CRERAQOWXPBWULOQHJTTLCZXYV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CRERAQOWXPBWULOQHJTTLCZXYV/action/storage_attestation","attest_author":"https://pith.science/pith/CRERAQOWXPBWULOQHJTTLCZXYV/action/author_attestation","sign_citation":"https://pith.science/pith/CRERAQOWXPBWULOQHJTTLCZXYV/action/citation_signature","submit_replication":"https://pith.science/pith/CRERAQOWXPBWULOQHJTTLCZXYV/action/replication_record"}},"created_at":"2026-05-18T00:19:36.619468+00:00","updated_at":"2026-05-18T00:19:36.619468+00:00"}