{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:FSJM2ATTEUBSEYPKQIKTOPZXF4","short_pith_number":"pith:FSJM2ATT","canonical_record":{"source":{"id":"1801.08865","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-25T15:55:36Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"cab7c6d5bd137b5620bfb39c6d3d9a09d719d34401c30886fef0841beeba913a","abstract_canon_sha256":"dcc2bb72fd6aa57195f27a1897afd76d880f85f723614aaa227738ba9b6be651"},"schema_version":"1.0"},"canonical_sha256":"2c92cd027325032261ea8215373f372f3366862b7d02bb9ea454c1067b94467d","source":{"kind":"arxiv","id":"1801.08865","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.08865","created_at":"2026-05-18T00:25:02Z"},{"alias_kind":"arxiv_version","alias_value":"1801.08865v1","created_at":"2026-05-18T00:25:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.08865","created_at":"2026-05-18T00:25:02Z"},{"alias_kind":"pith_short_12","alias_value":"FSJM2ATTEUBS","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"FSJM2ATTEUBSEYPK","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"FSJM2ATT","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:FSJM2ATTEUBSEYPKQIKTOPZXF4","target":"record","payload":{"canonical_record":{"source":{"id":"1801.08865","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-25T15:55:36Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"cab7c6d5bd137b5620bfb39c6d3d9a09d719d34401c30886fef0841beeba913a","abstract_canon_sha256":"dcc2bb72fd6aa57195f27a1897afd76d880f85f723614aaa227738ba9b6be651"},"schema_version":"1.0"},"canonical_sha256":"2c92cd027325032261ea8215373f372f3366862b7d02bb9ea454c1067b94467d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:02.818244Z","signature_b64":"5pB/lgVrMlgbNM5cei7pc6Q+OumgLP8STNOONi2lzJkwe8LSt6uvmsQuBlqvx4x+BpdCGsasrtMHbHgftsOYBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c92cd027325032261ea8215373f372f3366862b7d02bb9ea454c1067b94467d","last_reissued_at":"2026-05-18T00:25:02.817733Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:02.817733Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.08865","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:25:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"37q1QuMaciVMSnJat3LyDoDNcgMSZV3bVTT+MhPMwUxSKYdCiXu8Vh5Xc1jtlWlVA4RFncItsH5l8nMJkQx0Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T17:56:42.385482Z"},"content_sha256":"653b8164c11f2255bcae15686fe72317189027670d8044ab853753e735a20dc5","schema_version":"1.0","event_id":"sha256:653b8164c11f2255bcae15686fe72317189027670d8044ab853753e735a20dc5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:FSJM2ATTEUBSEYPKQIKTOPZXF4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Broadcast Rate of Index Coding Problems with Symmetric and Consecutive Interference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"B. Sundar Rajan, Mahesh Babu Vaddi","submitted_at":"2018-01-25T15:55:36Z","abstract_excerpt":"A single unicast index coding problem (SUICP) with symmetric and consecutive interference (SCI) has $K$ messages and $K$ receivers, the $k$th receiver $R_k$ wanting the $k$th message $x_k$ and having interference $\\mathcal{I}_k= \\{x_{k-U-m},\\dots,x_{k-m-2},x_{k-m-1}\\}\\cup\\{x_{k+m+1}, x_{k+m+2},\\dots,x_{k+m+D}\\}$ and side-information $\\mathcal{K}_k=(\\mathcal{I}_k \\cup x_k)^c$. In this paper, we derive a lowerbound on the broadcast rate of single unicast index coding problem with symmetric and consecutive interference (SUICP(SCI)). In the SUICP(SCI), if $m=0$, we refer this as single unicast ind"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.08865","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:25:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LHFZ4J5NEOGV3bSeJUNAzFw2qnTgeMDMdRU1pphr1gwfAbJWRvrTJcHi8bkAflqDNHATitqOs+n08JV4uLJLAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T17:56:42.385823Z"},"content_sha256":"9df06c1d2a96a9ce225b4588d392c3778e22cd1e2b6b889df5958039f4588670","schema_version":"1.0","event_id":"sha256:9df06c1d2a96a9ce225b4588d392c3778e22cd1e2b6b889df5958039f4588670"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FSJM2ATTEUBSEYPKQIKTOPZXF4/bundle.json","state_url":"https://pith.science/pith/FSJM2ATTEUBSEYPKQIKTOPZXF4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FSJM2ATTEUBSEYPKQIKTOPZXF4/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-04T17:56:42Z","links":{"resolver":"https://pith.science/pith/FSJM2ATTEUBSEYPKQIKTOPZXF4","bundle":"https://pith.science/pith/FSJM2ATTEUBSEYPKQIKTOPZXF4/bundle.json","state":"https://pith.science/pith/FSJM2ATTEUBSEYPKQIKTOPZXF4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FSJM2ATTEUBSEYPKQIKTOPZXF4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:FSJM2ATTEUBSEYPKQIKTOPZXF4","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":"dcc2bb72fd6aa57195f27a1897afd76d880f85f723614aaa227738ba9b6be651","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-25T15:55:36Z","title_canon_sha256":"cab7c6d5bd137b5620bfb39c6d3d9a09d719d34401c30886fef0841beeba913a"},"schema_version":"1.0","source":{"id":"1801.08865","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.08865","created_at":"2026-05-18T00:25:02Z"},{"alias_kind":"arxiv_version","alias_value":"1801.08865v1","created_at":"2026-05-18T00:25:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.08865","created_at":"2026-05-18T00:25:02Z"},{"alias_kind":"pith_short_12","alias_value":"FSJM2ATTEUBS","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"FSJM2ATTEUBSEYPK","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"FSJM2ATT","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:9df06c1d2a96a9ce225b4588d392c3778e22cd1e2b6b889df5958039f4588670","target":"graph","created_at":"2026-05-18T00:25:02Z","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 single unicast index coding problem (SUICP) with symmetric and consecutive interference (SCI) has $K$ messages and $K$ receivers, the $k$th receiver $R_k$ wanting the $k$th message $x_k$ and having interference $\\mathcal{I}_k= \\{x_{k-U-m},\\dots,x_{k-m-2},x_{k-m-1}\\}\\cup\\{x_{k+m+1}, x_{k+m+2},\\dots,x_{k+m+D}\\}$ and side-information $\\mathcal{K}_k=(\\mathcal{I}_k \\cup x_k)^c$. In this paper, we derive a lowerbound on the broadcast rate of single unicast index coding problem with symmetric and consecutive interference (SUICP(SCI)). In the SUICP(SCI), if $m=0$, we refer this as single unicast ind","authors_text":"B. Sundar Rajan, Mahesh Babu Vaddi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-25T15:55:36Z","title":"On the Broadcast Rate of Index Coding Problems with Symmetric and Consecutive Interference"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.08865","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:653b8164c11f2255bcae15686fe72317189027670d8044ab853753e735a20dc5","target":"record","created_at":"2026-05-18T00:25:02Z","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":"dcc2bb72fd6aa57195f27a1897afd76d880f85f723614aaa227738ba9b6be651","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-25T15:55:36Z","title_canon_sha256":"cab7c6d5bd137b5620bfb39c6d3d9a09d719d34401c30886fef0841beeba913a"},"schema_version":"1.0","source":{"id":"1801.08865","kind":"arxiv","version":1}},"canonical_sha256":"2c92cd027325032261ea8215373f372f3366862b7d02bb9ea454c1067b94467d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2c92cd027325032261ea8215373f372f3366862b7d02bb9ea454c1067b94467d","first_computed_at":"2026-05-18T00:25:02.817733Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:25:02.817733Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5pB/lgVrMlgbNM5cei7pc6Q+OumgLP8STNOONi2lzJkwe8LSt6uvmsQuBlqvx4x+BpdCGsasrtMHbHgftsOYBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:25:02.818244Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.08865","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:653b8164c11f2255bcae15686fe72317189027670d8044ab853753e735a20dc5","sha256:9df06c1d2a96a9ce225b4588d392c3778e22cd1e2b6b889df5958039f4588670"],"state_sha256":"da12258c48e1df6691aea57dc0fb507dd7ae00135d918453575cf2350fb6dec0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NQ3wXm3dXDxu3hARjEXHBVTT7I1sB4ezrNolgQO/aWEJif8/6KG4DnSB8kCY5NHYwHJYzhrNBNL8JzJ/RiTGDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T17:56:42.388302Z","bundle_sha256":"24550eef1ae5e2148b16756b9e5df66aac4a8465d531c4425258e3bfa5b68d84"}}