{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:AIGYF6NKYY6NANAL67KLZ33ALD","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":"7f7c913c03ffc25a77d4b179d2c43d318d105de23c7d3270ca9a5320a4c2af8e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-29T23:27:26Z","title_canon_sha256":"e7653d3ec293b05e3add64e3a4750b7d56e24a7a0141bd45f926032b3c6d40a0"},"schema_version":"1.0","source":{"id":"1603.00092","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.00092","created_at":"2026-05-18T00:22:40Z"},{"alias_kind":"arxiv_version","alias_value":"1603.00092v2","created_at":"2026-05-18T00:22:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.00092","created_at":"2026-05-18T00:22:40Z"},{"alias_kind":"pith_short_12","alias_value":"AIGYF6NKYY6N","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"AIGYF6NKYY6NANAL","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"AIGYF6NK","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:aa864355e7b428f2d713cf562f5fd587d54f41885734068cde45631fd72bf3b2","target":"graph","created_at":"2026-05-18T00:22:40Z","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 consider a graphical approach to index coding. While cycles have been shown to provide coding gain, only disjoint cycles and cliques (a specific type of overlapping cycles) have been exploited in existing literature. In this paper, we define a more general form of overlapping cycles, called the interlinked-cycle (IC) structure, that generalizes cycles and cliques. We propose a scheme, called the interlinked-cycle-cover (ICC) scheme, that leverages IC structures in digraphs to construct scalar linear index codes. We characterize a class of infinitely many digraphs where our proposed scheme i","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":"2016-02-29T23:27:26Z","title":"Interlinked Cycles for Index Coding: Generalizing Cycles and Cliques"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.00092","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:2900f13f3b9413bf0b6814bc6dfbc2bd59af664dc0aabc3462e4fc5da3bbc29e","target":"record","created_at":"2026-05-18T00:22:40Z","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":"7f7c913c03ffc25a77d4b179d2c43d318d105de23c7d3270ca9a5320a4c2af8e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-29T23:27:26Z","title_canon_sha256":"e7653d3ec293b05e3add64e3a4750b7d56e24a7a0141bd45f926032b3c6d40a0"},"schema_version":"1.0","source":{"id":"1603.00092","kind":"arxiv","version":2}},"canonical_sha256":"020d82f9aac63cd0340bf7d4bcef6058f9e1aa0017566ebb84b155e5f3641e8b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"020d82f9aac63cd0340bf7d4bcef6058f9e1aa0017566ebb84b155e5f3641e8b","first_computed_at":"2026-05-18T00:22:40.497736Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:40.497736Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RU+L/9+K/afqWTerd61fWUp1wr5IWAxWBOed7wDKfxlq1J2SbNCG6AiaYQ+gjs+zxZxEavGEM+6N4Lsw5eL3Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:40.498138Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.00092","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2900f13f3b9413bf0b6814bc6dfbc2bd59af664dc0aabc3462e4fc5da3bbc29e","sha256:aa864355e7b428f2d713cf562f5fd587d54f41885734068cde45631fd72bf3b2"],"state_sha256":"3f18aead6574172661c2c757d91521611d577a8ab1bb51684f0178396bd75a5b"}