{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:QUGKVNKINFJCEJU4DHIXHE3TN4","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":"b460e57d65b14a3a56391ad2930d533991e9294c31573de31e5af855481bb0b8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-19T07:33:16Z","title_canon_sha256":"d3dd42b38eef34097bc478ebde8e05c7562f950f3c80d4902d3e2e4ed42bfdce"},"schema_version":"1.0","source":{"id":"1504.04806","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.04806","created_at":"2026-05-18T00:42:39Z"},{"alias_kind":"arxiv_version","alias_value":"1504.04806v3","created_at":"2026-05-18T00:42:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.04806","created_at":"2026-05-18T00:42:39Z"},{"alias_kind":"pith_short_12","alias_value":"QUGKVNKINFJC","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"QUGKVNKINFJCEJU4","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"QUGKVNKI","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:7a002115902183591111a6b0f9f9f84f95ca962b4d6438bf5b58fd7650e042c6","target":"graph","created_at":"2026-05-18T00:42:39Z","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":"A source coding problem over a noiseless broadcast channel where the source is pre-informed about the contents of the cache of all receivers, is an index coding problem. Furthermore, if each message is requested by one receiver, then we call this an index coding problem with a unicast message setting. This problem can be represented by a directed graph. In this paper, we first define a structure (we call generalized interlinked cycles (GIC)) in directed graphs. A GIC consists of cycles which are interlinked in some manner (i.e., not disjoint), and it turns out that the GIC is a generalization ","authors_text":"Chandra Thapa, Lawrence Ong, Sarah J. Johnson","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-19T07:33:16Z","title":"Generalized Interlinked Cycle Cover for Index Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.04806","kind":"arxiv","version":3},"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:aa9e0957967cdbbe3ade76066e6ef1631ea4e70a24c2330ba0bbcbce0a2b98c9","target":"record","created_at":"2026-05-18T00:42:39Z","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":"b460e57d65b14a3a56391ad2930d533991e9294c31573de31e5af855481bb0b8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-19T07:33:16Z","title_canon_sha256":"d3dd42b38eef34097bc478ebde8e05c7562f950f3c80d4902d3e2e4ed42bfdce"},"schema_version":"1.0","source":{"id":"1504.04806","kind":"arxiv","version":3}},"canonical_sha256":"850caab548695222269c19d17393736f3b4213d948c0bf245583ed3c0fb24988","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"850caab548695222269c19d17393736f3b4213d948c0bf245583ed3c0fb24988","first_computed_at":"2026-05-18T00:42:39.812410Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:39.812410Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6H4TRXMAMf3/OCFMHxii/7e82c6Wm81zQmdu6tqJHsGZ53+rDhIdSCeLDQ1TAHeEwUNIQDarBPBKzlUHfTQKDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:39.813134Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.04806","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aa9e0957967cdbbe3ade76066e6ef1631ea4e70a24c2330ba0bbcbce0a2b98c9","sha256:7a002115902183591111a6b0f9f9f84f95ca962b4d6438bf5b58fd7650e042c6"],"state_sha256":"619e8418210ad70a916e65e25246c12b567e8d280dda5d4bd7f3ca353de2d08d"}