{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:VOT5KF4A3FRYXYOYTFJIBCRHUL","short_pith_number":"pith:VOT5KF4A","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"},"canonical_sha256":"aba7d51780d9638be1d89952808a27a2c9b257cbe5e27e2dedebe05840f636b0","source":{"kind":"arxiv","id":"1601.06153","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.06153","created_at":"2026-05-18T01:22:09Z"},{"alias_kind":"arxiv_version","alias_value":"1601.06153v1","created_at":"2026-05-18T01:22:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.06153","created_at":"2026-05-18T01:22:09Z"},{"alias_kind":"pith_short_12","alias_value":"VOT5KF4A3FRY","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VOT5KF4A3FRYXYOY","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VOT5KF4A","created_at":"2026-05-18T12:30:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:VOT5KF4A3FRYXYOYTFJIBCRHUL","target":"record","payload":{"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"},"canonical_sha256":"aba7d51780d9638be1d89952808a27a2c9b257cbe5e27e2dedebe05840f636b0","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"},"source_kind":"arxiv","source_id":"1601.06153","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:22:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vVmw66xgJkKuOXaw6J2cjBQwHgITeZT1CcJS36yHW1y/bIzH2z0HnaJnka0Cve5Lu3RZylN/GjHXLM8j6wNLAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T00:21:52.891889Z"},"content_sha256":"28c8b78bc3a07888d3848806e64c1139ddf9b722ca7c98e2e712fbd7e3358421","schema_version":"1.0","event_id":"sha256:28c8b78bc3a07888d3848806e64c1139ddf9b722ca7c98e2e712fbd7e3358421"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:VOT5KF4A3FRYXYOYTFJIBCRHUL","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:22:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PfWhLIyx73HqjBL2HAVNmcfZmRWgaeEi2aSyg4cYDQnPEHnS8ShH0F1YWgss3V+zw4d9DnMWKxpgB39hejifBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T00:21:52.892245Z"},"content_sha256":"6fd4e67de94d42a28f2bf360c11fe1f106b1aef0f034d68afdfe7440832b7062","schema_version":"1.0","event_id":"sha256:6fd4e67de94d42a28f2bf360c11fe1f106b1aef0f034d68afdfe7440832b7062"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VOT5KF4A3FRYXYOYTFJIBCRHUL/bundle.json","state_url":"https://pith.science/pith/VOT5KF4A3FRYXYOYTFJIBCRHUL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VOT5KF4A3FRYXYOYTFJIBCRHUL/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-03T00:21:52Z","links":{"resolver":"https://pith.science/pith/VOT5KF4A3FRYXYOYTFJIBCRHUL","bundle":"https://pith.science/pith/VOT5KF4A3FRYXYOYTFJIBCRHUL/bundle.json","state":"https://pith.science/pith/VOT5KF4A3FRYXYOYTFJIBCRHUL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VOT5KF4A3FRYXYOYTFJIBCRHUL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:VOT5KF4A3FRYXYOYTFJIBCRHUL","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":"6765d906ae4dc1bb85bb253ae28b9892f99cbd2c9da8ecac5a6b01bc26651621","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-22T20:57:35Z","title_canon_sha256":"ad34e385c937fcf8e13d8e2234e00d61d260c50ecca0c5a300ddc8eaa6b7f1a0"},"schema_version":"1.0","source":{"id":"1601.06153","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.06153","created_at":"2026-05-18T01:22:09Z"},{"alias_kind":"arxiv_version","alias_value":"1601.06153v1","created_at":"2026-05-18T01:22:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.06153","created_at":"2026-05-18T01:22:09Z"},{"alias_kind":"pith_short_12","alias_value":"VOT5KF4A3FRY","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VOT5KF4A3FRYXYOY","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VOT5KF4A","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:6fd4e67de94d42a28f2bf360c11fe1f106b1aef0f034d68afdfe7440832b7062","target":"graph","created_at":"2026-05-18T01:22:09Z","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":"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","authors_text":"Alex Sprintson, Swanand Kadhe","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-22T20:57:35Z","title":"Codes with Unequal Locality"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.06153","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:28c8b78bc3a07888d3848806e64c1139ddf9b722ca7c98e2e712fbd7e3358421","target":"record","created_at":"2026-05-18T01:22:09Z","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":"6765d906ae4dc1bb85bb253ae28b9892f99cbd2c9da8ecac5a6b01bc26651621","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-22T20:57:35Z","title_canon_sha256":"ad34e385c937fcf8e13d8e2234e00d61d260c50ecca0c5a300ddc8eaa6b7f1a0"},"schema_version":"1.0","source":{"id":"1601.06153","kind":"arxiv","version":1}},"canonical_sha256":"aba7d51780d9638be1d89952808a27a2c9b257cbe5e27e2dedebe05840f636b0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aba7d51780d9638be1d89952808a27a2c9b257cbe5e27e2dedebe05840f636b0","first_computed_at":"2026-05-18T01:22:09.113777Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:22:09.113777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UC0y9YfMx/oc5NysJKgKyfYbJYR3Gx++GYfPej3/m8/AucxPSg3YK59t6viCNcRwfxYKp3ov+X04AZONasDuDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:22:09.114446Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.06153","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:28c8b78bc3a07888d3848806e64c1139ddf9b722ca7c98e2e712fbd7e3358421","sha256:6fd4e67de94d42a28f2bf360c11fe1f106b1aef0f034d68afdfe7440832b7062"],"state_sha256":"19bc8a4193534acaf718738508832dae41f32bc0e1dd9b33ecfe03f21df13f6b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4L42G6x6ufd7qkne7UPuZRsAdoPAgHQIXHlJlBrlk9n0eK/oTRga1YyI+DvdpCLrg+u27fmnQAPCkZtsB+FPCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T00:21:52.894265Z","bundle_sha256":"bc88ac80b13ced74aa738c15415d68aa5f180017b94ab3a5ff1e4a0821d9005c"}}