{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:VOT5KF4A3FRYXYOYTFJIBCRHUL","short_pith_number":"pith:VOT5KF4A","schema_version":"1.0","canonical_sha256":"aba7d51780d9638be1d89952808a27a2c9b257cbe5e27e2dedebe05840f636b0","source":{"kind":"arxiv","id":"1601.06153","version":1},"attestation_state":"computed","paper":{"title":"Codes with Unequal Locality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alex Sprintson, Swanand Kadhe","submitted_at":"2016-01-22T20:57:35Z","abstract_excerpt":"For a code $\\code$, its $i$-th symbol is said to have locality $r$ if its value can be recovered by accessing some other $r$ symbols of $\\code$. Locally repairable codes (LRCs) are the family of codes such that every symbol has locality $r$.\n  In this paper, we focus on (linear) codes whose individual symbols can be partitioned into disjoint subsets such that the symbols in one subset have different locality than the symbols in other. We call such codes as \"codes with unequal locality\". For codes with \"unequal information locality\", we compute a tight upper bound on the minimum distance as a f"},"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.06153","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-22T20:57:35Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ad34e385c937fcf8e13d8e2234e00d61d260c50ecca0c5a300ddc8eaa6b7f1a0","abstract_canon_sha256":"6765d906ae4dc1bb85bb253ae28b9892f99cbd2c9da8ecac5a6b01bc26651621"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:09.114446Z","signature_b64":"UC0y9YfMx/oc5NysJKgKyfYbJYR3Gx++GYfPej3/m8/AucxPSg3YK59t6viCNcRwfxYKp3ov+X04AZONasDuDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aba7d51780d9638be1d89952808a27a2c9b257cbe5e27e2dedebe05840f636b0","last_reissued_at":"2026-05-18T01:22:09.113777Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:09.113777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Codes with Unequal Locality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alex Sprintson, Swanand Kadhe","submitted_at":"2016-01-22T20:57:35Z","abstract_excerpt":"For a code $\\code$, its $i$-th symbol is said to have locality $r$ if its value can be recovered by accessing some other $r$ symbols of $\\code$. Locally repairable codes (LRCs) are the family of codes such that every symbol has locality $r$.\n  In this paper, we focus on (linear) codes whose individual symbols can be partitioned into disjoint subsets such that the symbols in one subset have different locality than the symbols in other. We call such codes as \"codes with unequal locality\". For codes with \"unequal information locality\", we compute a tight upper bound on the minimum distance as a f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.06153","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.06153","created_at":"2026-05-18T01:22:09.113885+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.06153v1","created_at":"2026-05-18T01:22:09.113885+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.06153","created_at":"2026-05-18T01:22:09.113885+00:00"},{"alias_kind":"pith_short_12","alias_value":"VOT5KF4A3FRY","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"VOT5KF4A3FRYXYOY","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"VOT5KF4A","created_at":"2026-05-18T12:30:48.956258+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/VOT5KF4A3FRYXYOYTFJIBCRHUL","json":"https://pith.science/pith/VOT5KF4A3FRYXYOYTFJIBCRHUL.json","graph_json":"https://pith.science/api/pith-number/VOT5KF4A3FRYXYOYTFJIBCRHUL/graph.json","events_json":"https://pith.science/api/pith-number/VOT5KF4A3FRYXYOYTFJIBCRHUL/events.json","paper":"https://pith.science/paper/VOT5KF4A"},"agent_actions":{"view_html":"https://pith.science/pith/VOT5KF4A3FRYXYOYTFJIBCRHUL","download_json":"https://pith.science/pith/VOT5KF4A3FRYXYOYTFJIBCRHUL.json","view_paper":"https://pith.science/paper/VOT5KF4A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.06153&json=true","fetch_graph":"https://pith.science/api/pith-number/VOT5KF4A3FRYXYOYTFJIBCRHUL/graph.json","fetch_events":"https://pith.science/api/pith-number/VOT5KF4A3FRYXYOYTFJIBCRHUL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VOT5KF4A3FRYXYOYTFJIBCRHUL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VOT5KF4A3FRYXYOYTFJIBCRHUL/action/storage_attestation","attest_author":"https://pith.science/pith/VOT5KF4A3FRYXYOYTFJIBCRHUL/action/author_attestation","sign_citation":"https://pith.science/pith/VOT5KF4A3FRYXYOYTFJIBCRHUL/action/citation_signature","submit_replication":"https://pith.science/pith/VOT5KF4A3FRYXYOYTFJIBCRHUL/action/replication_record"}},"created_at":"2026-05-18T01:22:09.113885+00:00","updated_at":"2026-05-18T01:22:09.113885+00:00"}