{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:FSJM2ATTEUBSEYPKQIKTOPZXF4","short_pith_number":"pith:FSJM2ATT","schema_version":"1.0","canonical_sha256":"2c92cd027325032261ea8215373f372f3366862b7d02bb9ea454c1067b94467d","source":{"kind":"arxiv","id":"1801.08865","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1801.08865","created_at":"2026-05-18T00:25:02.817805+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.08865v1","created_at":"2026-05-18T00:25:02.817805+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.08865","created_at":"2026-05-18T00:25:02.817805+00:00"},{"alias_kind":"pith_short_12","alias_value":"FSJM2ATTEUBS","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"FSJM2ATTEUBSEYPK","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"FSJM2ATT","created_at":"2026-05-18T12:32:25.280505+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/FSJM2ATTEUBSEYPKQIKTOPZXF4","json":"https://pith.science/pith/FSJM2ATTEUBSEYPKQIKTOPZXF4.json","graph_json":"https://pith.science/api/pith-number/FSJM2ATTEUBSEYPKQIKTOPZXF4/graph.json","events_json":"https://pith.science/api/pith-number/FSJM2ATTEUBSEYPKQIKTOPZXF4/events.json","paper":"https://pith.science/paper/FSJM2ATT"},"agent_actions":{"view_html":"https://pith.science/pith/FSJM2ATTEUBSEYPKQIKTOPZXF4","download_json":"https://pith.science/pith/FSJM2ATTEUBSEYPKQIKTOPZXF4.json","view_paper":"https://pith.science/paper/FSJM2ATT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.08865&json=true","fetch_graph":"https://pith.science/api/pith-number/FSJM2ATTEUBSEYPKQIKTOPZXF4/graph.json","fetch_events":"https://pith.science/api/pith-number/FSJM2ATTEUBSEYPKQIKTOPZXF4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FSJM2ATTEUBSEYPKQIKTOPZXF4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FSJM2ATTEUBSEYPKQIKTOPZXF4/action/storage_attestation","attest_author":"https://pith.science/pith/FSJM2ATTEUBSEYPKQIKTOPZXF4/action/author_attestation","sign_citation":"https://pith.science/pith/FSJM2ATTEUBSEYPKQIKTOPZXF4/action/citation_signature","submit_replication":"https://pith.science/pith/FSJM2ATTEUBSEYPKQIKTOPZXF4/action/replication_record"}},"created_at":"2026-05-18T00:25:02.817805+00:00","updated_at":"2026-05-18T00:25:02.817805+00:00"}