{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:4XCWFP425JTBBQQNRJH7PGYDLI","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":"1e21574c2e74bf0b0f070e5cc39cfe505cd8f7cd25d8b35a90ccb96f280395fb","cross_cats_sorted":["cs.DM","cs.NI","math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-12T08:27:06Z","title_canon_sha256":"4a307e108a09dc8687cd9351ad620c3132e6089febf69f391f0b3f2decaecb47"},"schema_version":"1.0","source":{"id":"1601.02763","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.02763","created_at":"2026-05-18T01:22:59Z"},{"alias_kind":"arxiv_version","alias_value":"1601.02763v1","created_at":"2026-05-18T01:22:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.02763","created_at":"2026-05-18T01:22:59Z"},{"alias_kind":"pith_short_12","alias_value":"4XCWFP425JTB","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4XCWFP425JTBBQQN","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4XCWFP42","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:abe00021dc3a3e70bb94c27e559a9a809d35951c196083749695b69bfd08c7a7","target":"graph","created_at":"2026-05-18T01:22:59Z","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":"This paper studies bounds and constructions of locally repairable codes (LRCs) with multiple localities so-called multiple-locality LRCs (ML-LRCs). In the simplest case of two localities some code symbols of an ML-LRC have a certain locality while the remaining code symbols have another one. We extend two bounds, the Singleton and the alphabet-dependent upper bound on the dimension of Cadambe--Mazumdar for LRCs, to the case of ML-LRCs with more than two localities. Furthermore, we construct Singleton-optimal ML-LRCs as well as codes that achieve the extended alphabet-dependent bound. We give a","authors_text":"Alexander Zeh, Eitan Yaakobi","cross_cats":["cs.DM","cs.NI","math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-12T08:27:06Z","title":"Bounds and Constructions of Codes with Multiple Localities"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.02763","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:2f117c30b0749c998909425ad49b59e41dbe59034eeb87bf5d0ee015d3a65dcb","target":"record","created_at":"2026-05-18T01:22:59Z","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":"1e21574c2e74bf0b0f070e5cc39cfe505cd8f7cd25d8b35a90ccb96f280395fb","cross_cats_sorted":["cs.DM","cs.NI","math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-12T08:27:06Z","title_canon_sha256":"4a307e108a09dc8687cd9351ad620c3132e6089febf69f391f0b3f2decaecb47"},"schema_version":"1.0","source":{"id":"1601.02763","kind":"arxiv","version":1}},"canonical_sha256":"e5c562bf9aea6610c20d8a4ff79b035a3667a81f925ecb8ff5e93991a5e4784f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e5c562bf9aea6610c20d8a4ff79b035a3667a81f925ecb8ff5e93991a5e4784f","first_computed_at":"2026-05-18T01:22:59.689208Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:22:59.689208Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PhBtMDgAHpyYyn9+ZBZKc3ixx5tIt7KZXi/r+6w8Fw0/cZO/3ZAv9uIxkeZ3a0sfamtWiV9YbSSgRwS6Kx73BA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:22:59.689686Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.02763","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2f117c30b0749c998909425ad49b59e41dbe59034eeb87bf5d0ee015d3a65dcb","sha256:abe00021dc3a3e70bb94c27e559a9a809d35951c196083749695b69bfd08c7a7"],"state_sha256":"81a4c5e63fe34cfcb5fd9f23142b70279f8485d17b803cb4669955a18e723558"}