{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:746BHGVKBH2HKTAURC2LM5CW6V","short_pith_number":"pith:746BHGVK","schema_version":"1.0","canonical_sha256":"ff3c139aaa09f4754c1488b4b67456f55930520e6b0cbe438243761eb2d698d4","source":{"kind":"arxiv","id":"1804.09120","version":1},"attestation_state":"computed","paper":{"title":"On Optimal Index Codes for Interlinked Cycle Structures with Outer Cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"B. Sundar Rajan, Shanuja Sasi","submitted_at":"2018-04-24T16:25:32Z","abstract_excerpt":"For index coding problems with special structure on the side-information graphs called Interlinked Cycle (IC) structures index codes have been proposed in the literature (C. Thapa, L. Ong, and S. Johnson, \"Interlinked Cycles for Index Coding: Generalizing Cycles and Cliques\", in \\textit{IEEE Trans. Inf. Theory, vol. 63, no. 6, Jun. 2017} with a correction in \"Interlinked Cycles for Index Coding: Generalizing Cycles and Cliques\", in arxiv (arxiv:1603.00092v2 [cs.IT] 25 Feb 2018)). In this paper we consider a generalization of IC structures called {\\it IC structures with interlocked outer cycles"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1804.09120","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-24T16:25:32Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"99e06bda9232cafd0841d3865b1feab4295e162d75c48d88333753180d84267f","abstract_canon_sha256":"081677673a89c0d2c9abe8fee04a56e87e7c33cdc8d05d88bc1d618e12551b03"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:36.281338Z","signature_b64":"Rvvzaf065Gehs/n0L5HYC74pnFG+sdpbrNPPD0E6tm0upx5WzeeM9D8hOsAViNxrvVJhIC93N61UP6MWf6wRDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff3c139aaa09f4754c1488b4b67456f55930520e6b0cbe438243761eb2d698d4","last_reissued_at":"2026-05-18T00:17:36.280541Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:36.280541Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Optimal Index Codes for Interlinked Cycle Structures with Outer Cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"B. Sundar Rajan, Shanuja Sasi","submitted_at":"2018-04-24T16:25:32Z","abstract_excerpt":"For index coding problems with special structure on the side-information graphs called Interlinked Cycle (IC) structures index codes have been proposed in the literature (C. Thapa, L. Ong, and S. Johnson, \"Interlinked Cycles for Index Coding: Generalizing Cycles and Cliques\", in \\textit{IEEE Trans. Inf. Theory, vol. 63, no. 6, Jun. 2017} with a correction in \"Interlinked Cycles for Index Coding: Generalizing Cycles and Cliques\", in arxiv (arxiv:1603.00092v2 [cs.IT] 25 Feb 2018)). In this paper we consider a generalization of IC structures called {\\it IC structures with interlocked outer cycles"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.09120","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1804.09120","created_at":"2026-05-18T00:17:36.280676+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.09120v1","created_at":"2026-05-18T00:17:36.280676+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.09120","created_at":"2026-05-18T00:17:36.280676+00:00"},{"alias_kind":"pith_short_12","alias_value":"746BHGVKBH2H","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"746BHGVKBH2HKTAU","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"746BHGVK","created_at":"2026-05-18T12:32:11.075285+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/746BHGVKBH2HKTAURC2LM5CW6V","json":"https://pith.science/pith/746BHGVKBH2HKTAURC2LM5CW6V.json","graph_json":"https://pith.science/api/pith-number/746BHGVKBH2HKTAURC2LM5CW6V/graph.json","events_json":"https://pith.science/api/pith-number/746BHGVKBH2HKTAURC2LM5CW6V/events.json","paper":"https://pith.science/paper/746BHGVK"},"agent_actions":{"view_html":"https://pith.science/pith/746BHGVKBH2HKTAURC2LM5CW6V","download_json":"https://pith.science/pith/746BHGVKBH2HKTAURC2LM5CW6V.json","view_paper":"https://pith.science/paper/746BHGVK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.09120&json=true","fetch_graph":"https://pith.science/api/pith-number/746BHGVKBH2HKTAURC2LM5CW6V/graph.json","fetch_events":"https://pith.science/api/pith-number/746BHGVKBH2HKTAURC2LM5CW6V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/746BHGVKBH2HKTAURC2LM5CW6V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/746BHGVKBH2HKTAURC2LM5CW6V/action/storage_attestation","attest_author":"https://pith.science/pith/746BHGVKBH2HKTAURC2LM5CW6V/action/author_attestation","sign_citation":"https://pith.science/pith/746BHGVKBH2HKTAURC2LM5CW6V/action/citation_signature","submit_replication":"https://pith.science/pith/746BHGVKBH2HKTAURC2LM5CW6V/action/replication_record"}},"created_at":"2026-05-18T00:17:36.280676+00:00","updated_at":"2026-05-18T00:17:36.280676+00:00"}