{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:CRERAQOWXPBWULOQHJTTLCZXYV","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":"e30dd2c3e124501d372b0495dd0e8f78e86c256f123ad3a050f213fd0e1bcff1","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-02T14:40:55Z","title_canon_sha256":"668a2e9c62f20730aea093aca593341a5262d11cb4bcda45db152beeb791d064"},"schema_version":"1.0","source":{"id":"1804.00564","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.00564","created_at":"2026-05-18T00:19:36Z"},{"alias_kind":"arxiv_version","alias_value":"1804.00564v1","created_at":"2026-05-18T00:19:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.00564","created_at":"2026-05-18T00:19:36Z"},{"alias_kind":"pith_short_12","alias_value":"CRERAQOWXPBW","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"CRERAQOWXPBWULOQ","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"CRERAQOW","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:ca6c6894a6256828af6aed832a9be49ebbb96aeb4fa31d36380994bf7a4a88b7","target":"graph","created_at":"2026-05-18T00:19:36Z","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":"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","authors_text":"Anantha Narayanan R., M. Nikhil Krishnan, P. Vijay Kumar","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-02T14:40:55Z","title":"Codes with Combined Locality and Regeneration Having Optimal Rate, $d_{\\text{min}}$ and Linear Field Size"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.00564","kind":"arxiv","version":1},"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:838a094f27456bafc0ebdd6cd573d8ba0e7e6b2d4dc4cb48bc78edfaa862f195","target":"record","created_at":"2026-05-18T00:19:36Z","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":"e30dd2c3e124501d372b0495dd0e8f78e86c256f123ad3a050f213fd0e1bcff1","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-02T14:40:55Z","title_canon_sha256":"668a2e9c62f20730aea093aca593341a5262d11cb4bcda45db152beeb791d064"},"schema_version":"1.0","source":{"id":"1804.00564","kind":"arxiv","version":1}},"canonical_sha256":"14491041d6bbc36a2dd03a67358b37c5615e0da74f0d61d04b24c3ad6f19183d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"14491041d6bbc36a2dd03a67358b37c5615e0da74f0d61d04b24c3ad6f19183d","first_computed_at":"2026-05-18T00:19:36.619378Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:36.619378Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iS7RCcABVYb/jjfMUBus2oZekzM+dEN1tAjrYllkUBBUF0/tLbLCrMmXtJR642PEBT0mPAewKItX4zAqLT31Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:36.619928Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.00564","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:838a094f27456bafc0ebdd6cd573d8ba0e7e6b2d4dc4cb48bc78edfaa862f195","sha256:ca6c6894a6256828af6aed832a9be49ebbb96aeb4fa31d36380994bf7a4a88b7"],"state_sha256":"3cbbc381e9b9c8c2f6dc69ed2d9a136169b3ba2cc9c1d0762caf6da914316554"}