{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:BHK3EZQXPXV574PNY4TPMJXSEG","short_pith_number":"pith:BHK3EZQX","canonical_record":{"source":{"id":"1402.3895","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-02-17T05:38:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"95e714419a9ff92af6291f5683e74185d52058d4644fcf682694f67d27cd0dd5","abstract_canon_sha256":"01b14a00883f9731553e4fc8751b91d076f927eaca600ff27be7fd4c83a03435"},"schema_version":"1.0"},"canonical_sha256":"09d5b266177debdff1edc726f626f221a893f5cad5f5734305a8e456be55ca37","source":{"kind":"arxiv","id":"1402.3895","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.3895","created_at":"2026-05-18T02:58:55Z"},{"alias_kind":"arxiv_version","alias_value":"1402.3895v1","created_at":"2026-05-18T02:58:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.3895","created_at":"2026-05-18T02:58:55Z"},{"alias_kind":"pith_short_12","alias_value":"BHK3EZQXPXV5","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"BHK3EZQXPXV574PN","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"BHK3EZQX","created_at":"2026-05-18T12:28:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:BHK3EZQXPXV574PNY4TPMJXSEG","target":"record","payload":{"canonical_record":{"source":{"id":"1402.3895","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-02-17T05:38:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"95e714419a9ff92af6291f5683e74185d52058d4644fcf682694f67d27cd0dd5","abstract_canon_sha256":"01b14a00883f9731553e4fc8751b91d076f927eaca600ff27be7fd4c83a03435"},"schema_version":"1.0"},"canonical_sha256":"09d5b266177debdff1edc726f626f221a893f5cad5f5734305a8e456be55ca37","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:58:55.287862Z","signature_b64":"xq10kUF0B4ZrUe6cDqkvLsD30/upRNnj/TLY1v5v5XkRh09dbPuHmSyUy3TQHHkE4tjIiBMq6bjdk/mmULqgCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"09d5b266177debdff1edc726f626f221a893f5cad5f5734305a8e456be55ca37","last_reissued_at":"2026-05-18T02:58:55.287211Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:58:55.287211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.3895","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-18T02:58:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"geof10w/50ege2MSLxYJjYcc8Jg1ZPCj0+H7mfw8Oa46mfq93aOR617h+0NVR4n7AE5oe2w07DAih+xwA4b5BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T07:01:19.495771Z"},"content_sha256":"7c341b8ce0ff1a331169270f4eee35a54c94402c01f6b9e5bab3005022662de7","schema_version":"1.0","event_id":"sha256:7c341b8ce0ff1a331169270f4eee35a54c94402c01f6b9e5bab3005022662de7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:BHK3EZQXPXV574PNY4TPMJXSEG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bounding Multiple Unicasts through Index Coding and Locally Repairable Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandros G. Dimakis, Karthikeyan Shanmugam","submitted_at":"2014-02-17T05:38:58Z","abstract_excerpt":"We establish a duality result between linear index coding and Locally Repairable Codes (LRCs). Specifically, we show that a natural extension of LRCs we call Generalized Locally Repairable Codes (GLCRs) are exactly dual to linear index codes. In a GLRC, every node is decodable from a specific set of other nodes and these sets induce a recoverability directed graph. We show that the dual linear subspace of a GLRC is a solution to an index coding instance where the side information graph is this GLRC recoverability graph. We show that the GLRC rate is equivalent to the complementary index coding"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.3895","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-18T02:58:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C7KrPTfS7kOnwxFe6PFH2NAzqD7Ta8VhZ0zZM1+tUI7pD4uhw5LZDdY+zxHFs+i4ujq4hOdY/YpaOPeYd27DAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T07:01:19.496110Z"},"content_sha256":"7c8d8604f4dcf2b36d4140b8246e7b140810fb07d034d43fdbd3138aa12bb0ce","schema_version":"1.0","event_id":"sha256:7c8d8604f4dcf2b36d4140b8246e7b140810fb07d034d43fdbd3138aa12bb0ce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BHK3EZQXPXV574PNY4TPMJXSEG/bundle.json","state_url":"https://pith.science/pith/BHK3EZQXPXV574PNY4TPMJXSEG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BHK3EZQXPXV574PNY4TPMJXSEG/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-01T07:01:19Z","links":{"resolver":"https://pith.science/pith/BHK3EZQXPXV574PNY4TPMJXSEG","bundle":"https://pith.science/pith/BHK3EZQXPXV574PNY4TPMJXSEG/bundle.json","state":"https://pith.science/pith/BHK3EZQXPXV574PNY4TPMJXSEG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BHK3EZQXPXV574PNY4TPMJXSEG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:BHK3EZQXPXV574PNY4TPMJXSEG","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":"01b14a00883f9731553e4fc8751b91d076f927eaca600ff27be7fd4c83a03435","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-02-17T05:38:58Z","title_canon_sha256":"95e714419a9ff92af6291f5683e74185d52058d4644fcf682694f67d27cd0dd5"},"schema_version":"1.0","source":{"id":"1402.3895","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.3895","created_at":"2026-05-18T02:58:55Z"},{"alias_kind":"arxiv_version","alias_value":"1402.3895v1","created_at":"2026-05-18T02:58:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.3895","created_at":"2026-05-18T02:58:55Z"},{"alias_kind":"pith_short_12","alias_value":"BHK3EZQXPXV5","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"BHK3EZQXPXV574PN","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"BHK3EZQX","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:7c8d8604f4dcf2b36d4140b8246e7b140810fb07d034d43fdbd3138aa12bb0ce","target":"graph","created_at":"2026-05-18T02:58:55Z","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":"We establish a duality result between linear index coding and Locally Repairable Codes (LRCs). Specifically, we show that a natural extension of LRCs we call Generalized Locally Repairable Codes (GLCRs) are exactly dual to linear index codes. In a GLRC, every node is decodable from a specific set of other nodes and these sets induce a recoverability directed graph. We show that the dual linear subspace of a GLRC is a solution to an index coding instance where the side information graph is this GLRC recoverability graph. We show that the GLRC rate is equivalent to the complementary index coding","authors_text":"Alexandros G. Dimakis, Karthikeyan Shanmugam","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-02-17T05:38:58Z","title":"Bounding Multiple Unicasts through Index Coding and Locally Repairable Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.3895","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:7c341b8ce0ff1a331169270f4eee35a54c94402c01f6b9e5bab3005022662de7","target":"record","created_at":"2026-05-18T02:58:55Z","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":"01b14a00883f9731553e4fc8751b91d076f927eaca600ff27be7fd4c83a03435","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-02-17T05:38:58Z","title_canon_sha256":"95e714419a9ff92af6291f5683e74185d52058d4644fcf682694f67d27cd0dd5"},"schema_version":"1.0","source":{"id":"1402.3895","kind":"arxiv","version":1}},"canonical_sha256":"09d5b266177debdff1edc726f626f221a893f5cad5f5734305a8e456be55ca37","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"09d5b266177debdff1edc726f626f221a893f5cad5f5734305a8e456be55ca37","first_computed_at":"2026-05-18T02:58:55.287211Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:58:55.287211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xq10kUF0B4ZrUe6cDqkvLsD30/upRNnj/TLY1v5v5XkRh09dbPuHmSyUy3TQHHkE4tjIiBMq6bjdk/mmULqgCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:58:55.287862Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.3895","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7c341b8ce0ff1a331169270f4eee35a54c94402c01f6b9e5bab3005022662de7","sha256:7c8d8604f4dcf2b36d4140b8246e7b140810fb07d034d43fdbd3138aa12bb0ce"],"state_sha256":"e63a023f782fb6a8686530885eee2406560df5bfb27d252e86b9ba9da31150f5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6VAXQWXoEwTM6Kh5/Nl98JI5AV4Nfz7V7M64fG+/LQKXvLpJoU2u8SLyuph6tFRdJEViUMRv65Ibbc6mh43DDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T07:01:19.498090Z","bundle_sha256":"6330e4377be093c5297bfc1943e0144e24475e640f5315b85d7853ee3005ee85"}}