{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:4XCWFP425JTBBQQNRJH7PGYDLI","short_pith_number":"pith:4XCWFP42","schema_version":"1.0","canonical_sha256":"e5c562bf9aea6610c20d8a4ff79b035a3667a81f925ecb8ff5e93991a5e4784f","source":{"kind":"arxiv","id":"1601.02763","version":1},"attestation_state":"computed","paper":{"title":"Bounds and Constructions of Codes with Multiple Localities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.NI","math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Alexander Zeh, Eitan Yaakobi","submitted_at":"2016-01-12T08:27:06Z","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"},"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":"1601.02763","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-12T08:27:06Z","cross_cats_sorted":["cs.DM","cs.NI","math.CO","math.IT"],"title_canon_sha256":"4a307e108a09dc8687cd9351ad620c3132e6089febf69f391f0b3f2decaecb47","abstract_canon_sha256":"1e21574c2e74bf0b0f070e5cc39cfe505cd8f7cd25d8b35a90ccb96f280395fb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:59.689686Z","signature_b64":"PhBtMDgAHpyYyn9+ZBZKc3ixx5tIt7KZXi/r+6w8Fw0/cZO/3ZAv9uIxkeZ3a0sfamtWiV9YbSSgRwS6Kx73BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e5c562bf9aea6610c20d8a4ff79b035a3667a81f925ecb8ff5e93991a5e4784f","last_reissued_at":"2026-05-18T01:22:59.689208Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:59.689208Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounds and Constructions of Codes with Multiple Localities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.NI","math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Alexander Zeh, Eitan Yaakobi","submitted_at":"2016-01-12T08:27:06Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.02763","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":"1601.02763","created_at":"2026-05-18T01:22:59.689281+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.02763v1","created_at":"2026-05-18T01:22:59.689281+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.02763","created_at":"2026-05-18T01:22:59.689281+00:00"},{"alias_kind":"pith_short_12","alias_value":"4XCWFP425JTB","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"4XCWFP425JTBBQQN","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"4XCWFP42","created_at":"2026-05-18T12:29:58.707656+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/4XCWFP425JTBBQQNRJH7PGYDLI","json":"https://pith.science/pith/4XCWFP425JTBBQQNRJH7PGYDLI.json","graph_json":"https://pith.science/api/pith-number/4XCWFP425JTBBQQNRJH7PGYDLI/graph.json","events_json":"https://pith.science/api/pith-number/4XCWFP425JTBBQQNRJH7PGYDLI/events.json","paper":"https://pith.science/paper/4XCWFP42"},"agent_actions":{"view_html":"https://pith.science/pith/4XCWFP425JTBBQQNRJH7PGYDLI","download_json":"https://pith.science/pith/4XCWFP425JTBBQQNRJH7PGYDLI.json","view_paper":"https://pith.science/paper/4XCWFP42","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.02763&json=true","fetch_graph":"https://pith.science/api/pith-number/4XCWFP425JTBBQQNRJH7PGYDLI/graph.json","fetch_events":"https://pith.science/api/pith-number/4XCWFP425JTBBQQNRJH7PGYDLI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4XCWFP425JTBBQQNRJH7PGYDLI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4XCWFP425JTBBQQNRJH7PGYDLI/action/storage_attestation","attest_author":"https://pith.science/pith/4XCWFP425JTBBQQNRJH7PGYDLI/action/author_attestation","sign_citation":"https://pith.science/pith/4XCWFP425JTBBQQNRJH7PGYDLI/action/citation_signature","submit_replication":"https://pith.science/pith/4XCWFP425JTBBQQNRJH7PGYDLI/action/replication_record"}},"created_at":"2026-05-18T01:22:59.689281+00:00","updated_at":"2026-05-18T01:22:59.689281+00:00"}