{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:7VUBUBTUBRVQAIT6OJKPLAISML","short_pith_number":"pith:7VUBUBTU","canonical_record":{"source":{"id":"1603.02366","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-08T03:09:21Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c710e8da7c9d5e592c11ecde2c341def75558ade5834da71b1827daadc81e95b","abstract_canon_sha256":"c9a2771ee66a8e44de2384243a8d57ed0d7d42311aac5c1a85f7eafa083c9955"},"schema_version":"1.0"},"canonical_sha256":"fd681a06740c6b00227e7254f5811262d9643479c7618e40cc57c27d61ca6747","source":{"kind":"arxiv","id":"1603.02366","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.02366","created_at":"2026-05-18T01:16:02Z"},{"alias_kind":"arxiv_version","alias_value":"1603.02366v2","created_at":"2026-05-18T01:16:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.02366","created_at":"2026-05-18T01:16:02Z"},{"alias_kind":"pith_short_12","alias_value":"7VUBUBTUBRVQ","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7VUBUBTUBRVQAIT6","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7VUBUBTU","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:7VUBUBTUBRVQAIT6OJKPLAISML","target":"record","payload":{"canonical_record":{"source":{"id":"1603.02366","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-08T03:09:21Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c710e8da7c9d5e592c11ecde2c341def75558ade5834da71b1827daadc81e95b","abstract_canon_sha256":"c9a2771ee66a8e44de2384243a8d57ed0d7d42311aac5c1a85f7eafa083c9955"},"schema_version":"1.0"},"canonical_sha256":"fd681a06740c6b00227e7254f5811262d9643479c7618e40cc57c27d61ca6747","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:02.357285Z","signature_b64":"fLBPrisA6vv1XhlinrXOP8Ic19UksjWiCyATj3csmXcKDNSpjG91ulXb47OSD8IAzHXeW+LlEQMZWV5/i1uvCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd681a06740c6b00227e7254f5811262d9643479c7618e40cc57c27d61ca6747","last_reissued_at":"2026-05-18T01:16:02.356522Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:02.356522Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.02366","source_version":2,"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:16:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RLh8TT6GHMjiTbshzl3PSR5npNc9V0y8xW0GkG2hy7hKLEBGbcQNpeNLuR41Kl4pH03xD4Si5CvzaomqiglzBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T17:19:01.121210Z"},"content_sha256":"89921b83a97e6249f002645a3859c89b44a5f4fdc3393e2aeedfe7f5c0ffb3c9","schema_version":"1.0","event_id":"sha256:89921b83a97e6249f002645a3859c89b44a5f4fdc3393e2aeedfe7f5c0ffb3c9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:7VUBUBTUBRVQAIT6OJKPLAISML","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Local Partial Clique Covers for Index Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Abhishek Agarwal, Arya Mazumdar","submitted_at":"2016-03-08T03:09:21Z","abstract_excerpt":"Index coding, or broadcasting with side information, is a network coding problem of most fundamental importance. In this problem, given a directed graph, each vertex represents a user with a need of information, and the neighborhood of each vertex represents the side information availability to that user. The aim is to find an encoding to minimum number of bits (optimal rate) that, when broadcasted, will be sufficient to the need of every user. Not only the optimal rate is intractable, but it is also very hard to characterize with some other well-studied graph parameter or with a simpler formu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.02366","kind":"arxiv","version":2},"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:16:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bQnxFNTEmWHphL+sjCnL/hG12Ws6Mj6GigsBl+AXRlpPqPZlS2VB2w9Co7kXTk0k02jhLSj2uORre6msMookBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T17:19:01.121576Z"},"content_sha256":"612fcca43d656c59fd34df68163ee67f8ec6d02e65e3c6db8da6d45afbd0c362","schema_version":"1.0","event_id":"sha256:612fcca43d656c59fd34df68163ee67f8ec6d02e65e3c6db8da6d45afbd0c362"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7VUBUBTUBRVQAIT6OJKPLAISML/bundle.json","state_url":"https://pith.science/pith/7VUBUBTUBRVQAIT6OJKPLAISML/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7VUBUBTUBRVQAIT6OJKPLAISML/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-03T17:19:01Z","links":{"resolver":"https://pith.science/pith/7VUBUBTUBRVQAIT6OJKPLAISML","bundle":"https://pith.science/pith/7VUBUBTUBRVQAIT6OJKPLAISML/bundle.json","state":"https://pith.science/pith/7VUBUBTUBRVQAIT6OJKPLAISML/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7VUBUBTUBRVQAIT6OJKPLAISML/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:7VUBUBTUBRVQAIT6OJKPLAISML","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":"c9a2771ee66a8e44de2384243a8d57ed0d7d42311aac5c1a85f7eafa083c9955","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-08T03:09:21Z","title_canon_sha256":"c710e8da7c9d5e592c11ecde2c341def75558ade5834da71b1827daadc81e95b"},"schema_version":"1.0","source":{"id":"1603.02366","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.02366","created_at":"2026-05-18T01:16:02Z"},{"alias_kind":"arxiv_version","alias_value":"1603.02366v2","created_at":"2026-05-18T01:16:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.02366","created_at":"2026-05-18T01:16:02Z"},{"alias_kind":"pith_short_12","alias_value":"7VUBUBTUBRVQ","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7VUBUBTUBRVQAIT6","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7VUBUBTU","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:612fcca43d656c59fd34df68163ee67f8ec6d02e65e3c6db8da6d45afbd0c362","target":"graph","created_at":"2026-05-18T01:16:02Z","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":"Index coding, or broadcasting with side information, is a network coding problem of most fundamental importance. In this problem, given a directed graph, each vertex represents a user with a need of information, and the neighborhood of each vertex represents the side information availability to that user. The aim is to find an encoding to minimum number of bits (optimal rate) that, when broadcasted, will be sufficient to the need of every user. Not only the optimal rate is intractable, but it is also very hard to characterize with some other well-studied graph parameter or with a simpler formu","authors_text":"Abhishek Agarwal, Arya Mazumdar","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-08T03:09:21Z","title":"Local Partial Clique Covers for Index Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.02366","kind":"arxiv","version":2},"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:89921b83a97e6249f002645a3859c89b44a5f4fdc3393e2aeedfe7f5c0ffb3c9","target":"record","created_at":"2026-05-18T01:16:02Z","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":"c9a2771ee66a8e44de2384243a8d57ed0d7d42311aac5c1a85f7eafa083c9955","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-08T03:09:21Z","title_canon_sha256":"c710e8da7c9d5e592c11ecde2c341def75558ade5834da71b1827daadc81e95b"},"schema_version":"1.0","source":{"id":"1603.02366","kind":"arxiv","version":2}},"canonical_sha256":"fd681a06740c6b00227e7254f5811262d9643479c7618e40cc57c27d61ca6747","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fd681a06740c6b00227e7254f5811262d9643479c7618e40cc57c27d61ca6747","first_computed_at":"2026-05-18T01:16:02.356522Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:16:02.356522Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fLBPrisA6vv1XhlinrXOP8Ic19UksjWiCyATj3csmXcKDNSpjG91ulXb47OSD8IAzHXeW+LlEQMZWV5/i1uvCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:16:02.357285Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.02366","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:89921b83a97e6249f002645a3859c89b44a5f4fdc3393e2aeedfe7f5c0ffb3c9","sha256:612fcca43d656c59fd34df68163ee67f8ec6d02e65e3c6db8da6d45afbd0c362"],"state_sha256":"51564c68868a67ba8030587967e852fba1021a6506e6e50936dc3649454a7322"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WanxeNBxfQ+89mIqnzEy/n16RSrhTAxjhEqCMngV6Mevl/UW8JFWIBSZbw1x2ox44dU41OIM3Xh4zie5Bj41Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T17:19:01.123469Z","bundle_sha256":"0863bc332c8b50e2aecc1b26af04e55e47700e3cbdb814f025434ceb573856c4"}}