{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:WBCWNS666V5NU6EX6S67ZBE2Z3","short_pith_number":"pith:WBCWNS66","schema_version":"1.0","canonical_sha256":"b04566cbdef57ada7897f4bdfc849acef706c5a98dbbaea006794d101e8b67ee","source":{"kind":"arxiv","id":"1804.06703","version":1},"attestation_state":"computed","paper":{"title":"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, K. Vikas Bharadwaj","submitted_at":"2018-04-18T13:15:13Z","abstract_excerpt":"Index code construction for a class of side-information graphs called interlinked cycle (IC) structures without outer cycles is given by Thapa, Ong and Johnson (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}, \"Interlinked Cycles for Index Coding: Generalizing Cycles and Cliques\", in arxiv (arxiv:1603.00092v2 [cs.IT] 25 Feb 2018)). In this paper, construction of index codes for interlinked cycle (IC) structures with outer cycles is given along with a decoding algorithm."},"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.06703","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-18T13:15:13Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c405f0a0940e8d232ab4d63c9cbc4d9aace0f9a2ea88c806433ddc83317887f7","abstract_canon_sha256":"c38069199a9b4a847824e50978173502a668325b41602d1c5149dc77edb9a33d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:05.983576Z","signature_b64":"itNKaOu4084p2VLHN71ony0qeWo8U0/VeYvx6Mn/apnHrk1B6CoGKlq5UroP94dWCXORLvUJbKkAw7RsaYypCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b04566cbdef57ada7897f4bdfc849acef706c5a98dbbaea006794d101e8b67ee","last_reissued_at":"2026-05-18T00:18:05.982832Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:05.982832Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"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, K. Vikas Bharadwaj","submitted_at":"2018-04-18T13:15:13Z","abstract_excerpt":"Index code construction for a class of side-information graphs called interlinked cycle (IC) structures without outer cycles is given by Thapa, Ong and Johnson (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}, \"Interlinked Cycles for Index Coding: Generalizing Cycles and Cliques\", in arxiv (arxiv:1603.00092v2 [cs.IT] 25 Feb 2018)). In this paper, construction of index codes for interlinked cycle (IC) structures with outer cycles is given along with a decoding algorithm."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.06703","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.06703","created_at":"2026-05-18T00:18:05.982942+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.06703v1","created_at":"2026-05-18T00:18:05.982942+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.06703","created_at":"2026-05-18T00:18:05.982942+00:00"},{"alias_kind":"pith_short_12","alias_value":"WBCWNS666V5N","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"WBCWNS666V5NU6EX","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"WBCWNS66","created_at":"2026-05-18T12:32:59.047623+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/WBCWNS666V5NU6EX6S67ZBE2Z3","json":"https://pith.science/pith/WBCWNS666V5NU6EX6S67ZBE2Z3.json","graph_json":"https://pith.science/api/pith-number/WBCWNS666V5NU6EX6S67ZBE2Z3/graph.json","events_json":"https://pith.science/api/pith-number/WBCWNS666V5NU6EX6S67ZBE2Z3/events.json","paper":"https://pith.science/paper/WBCWNS66"},"agent_actions":{"view_html":"https://pith.science/pith/WBCWNS666V5NU6EX6S67ZBE2Z3","download_json":"https://pith.science/pith/WBCWNS666V5NU6EX6S67ZBE2Z3.json","view_paper":"https://pith.science/paper/WBCWNS66","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.06703&json=true","fetch_graph":"https://pith.science/api/pith-number/WBCWNS666V5NU6EX6S67ZBE2Z3/graph.json","fetch_events":"https://pith.science/api/pith-number/WBCWNS666V5NU6EX6S67ZBE2Z3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WBCWNS666V5NU6EX6S67ZBE2Z3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WBCWNS666V5NU6EX6S67ZBE2Z3/action/storage_attestation","attest_author":"https://pith.science/pith/WBCWNS666V5NU6EX6S67ZBE2Z3/action/author_attestation","sign_citation":"https://pith.science/pith/WBCWNS666V5NU6EX6S67ZBE2Z3/action/citation_signature","submit_replication":"https://pith.science/pith/WBCWNS666V5NU6EX6S67ZBE2Z3/action/replication_record"}},"created_at":"2026-05-18T00:18:05.982942+00:00","updated_at":"2026-05-18T00:18:05.982942+00:00"}