{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:746BHGVKBH2HKTAURC2LM5CW6V","short_pith_number":"pith:746BHGVK","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"},"canonical_sha256":"ff3c139aaa09f4754c1488b4b67456f55930520e6b0cbe438243761eb2d698d4","source":{"kind":"arxiv","id":"1804.09120","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.09120","created_at":"2026-05-18T00:17:36Z"},{"alias_kind":"arxiv_version","alias_value":"1804.09120v1","created_at":"2026-05-18T00:17:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.09120","created_at":"2026-05-18T00:17:36Z"},{"alias_kind":"pith_short_12","alias_value":"746BHGVKBH2H","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"746BHGVKBH2HKTAU","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"746BHGVK","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:746BHGVKBH2HKTAURC2LM5CW6V","target":"record","payload":{"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"},"canonical_sha256":"ff3c139aaa09f4754c1488b4b67456f55930520e6b0cbe438243761eb2d698d4","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"},"source_kind":"arxiv","source_id":"1804.09120","source_version":1,"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-18T00:17:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KqChfGqg0nhbRB8VuCTgnPeTH6BjaeGUwTmjy/TcvGJeiJs+1jcj47rBJmbr/ubirWJIDD4oSe6dQJRs0K5jCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T21:59:32.594648Z"},"content_sha256":"dd24e7e0af5875944d03e0eee08364cc18ae879b735db904a5d29c78da271a79","schema_version":"1.0","event_id":"sha256:dd24e7e0af5875944d03e0eee08364cc18ae879b735db904a5d29c78da271a79"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:746BHGVKBH2HKTAURC2LM5CW6V","target":"graph","payload":{"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"},"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-18T00:17:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bGOZ5V7FHmmPBQ1QDaxVzUOGtSfVPMkIkOuCUYIazs+DjswtmlWo5cBiO0nVOiM7JLI2ZCA7j8XRBQMeteBwBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T21:59:32.595006Z"},"content_sha256":"828f76b39cc19273ca205ab90d95a6c5955e519bcc1d12ad35684091e98665fd","schema_version":"1.0","event_id":"sha256:828f76b39cc19273ca205ab90d95a6c5955e519bcc1d12ad35684091e98665fd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/746BHGVKBH2HKTAURC2LM5CW6V/bundle.json","state_url":"https://pith.science/pith/746BHGVKBH2HKTAURC2LM5CW6V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/746BHGVKBH2HKTAURC2LM5CW6V/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-04T21:59:32Z","links":{"resolver":"https://pith.science/pith/746BHGVKBH2HKTAURC2LM5CW6V","bundle":"https://pith.science/pith/746BHGVKBH2HKTAURC2LM5CW6V/bundle.json","state":"https://pith.science/pith/746BHGVKBH2HKTAURC2LM5CW6V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/746BHGVKBH2HKTAURC2LM5CW6V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:746BHGVKBH2HKTAURC2LM5CW6V","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":"081677673a89c0d2c9abe8fee04a56e87e7c33cdc8d05d88bc1d618e12551b03","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-24T16:25:32Z","title_canon_sha256":"99e06bda9232cafd0841d3865b1feab4295e162d75c48d88333753180d84267f"},"schema_version":"1.0","source":{"id":"1804.09120","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.09120","created_at":"2026-05-18T00:17:36Z"},{"alias_kind":"arxiv_version","alias_value":"1804.09120v1","created_at":"2026-05-18T00:17:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.09120","created_at":"2026-05-18T00:17:36Z"},{"alias_kind":"pith_short_12","alias_value":"746BHGVKBH2H","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"746BHGVKBH2HKTAU","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"746BHGVK","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:828f76b39cc19273ca205ab90d95a6c5955e519bcc1d12ad35684091e98665fd","target":"graph","created_at":"2026-05-18T00:17:36Z","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":"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","authors_text":"B. Sundar Rajan, Shanuja Sasi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-24T16:25:32Z","title":"On Optimal Index Codes for Interlinked Cycle Structures with Outer Cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.09120","kind":"arxiv","version":1},"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:dd24e7e0af5875944d03e0eee08364cc18ae879b735db904a5d29c78da271a79","target":"record","created_at":"2026-05-18T00:17:36Z","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":"081677673a89c0d2c9abe8fee04a56e87e7c33cdc8d05d88bc1d618e12551b03","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-24T16:25:32Z","title_canon_sha256":"99e06bda9232cafd0841d3865b1feab4295e162d75c48d88333753180d84267f"},"schema_version":"1.0","source":{"id":"1804.09120","kind":"arxiv","version":1}},"canonical_sha256":"ff3c139aaa09f4754c1488b4b67456f55930520e6b0cbe438243761eb2d698d4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ff3c139aaa09f4754c1488b4b67456f55930520e6b0cbe438243761eb2d698d4","first_computed_at":"2026-05-18T00:17:36.280541Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:36.280541Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Rvvzaf065Gehs/n0L5HYC74pnFG+sdpbrNPPD0E6tm0upx5WzeeM9D8hOsAViNxrvVJhIC93N61UP6MWf6wRDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:36.281338Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.09120","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dd24e7e0af5875944d03e0eee08364cc18ae879b735db904a5d29c78da271a79","sha256:828f76b39cc19273ca205ab90d95a6c5955e519bcc1d12ad35684091e98665fd"],"state_sha256":"c3b7fea0e09323395816860e83e3fe79256aa99f9c1370817c0fc2fe1f0e6570"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"avSr2yMHXQnuMFIk5KBfSYGmzgdm05AAEpzqzbzKNgD7jyDZ54pfAf1L0/jQcBIS1/HqP0m9nK6F33xb6YX6CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T21:59:32.597116Z","bundle_sha256":"a3bfaa53a4b1b2a80d9e8aefce036e92a03d0a73de181b7738455a0cfce93553"}}