{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:TPQPSTUBTELKDPGJF6MHXFY4LE","short_pith_number":"pith:TPQPSTUB","schema_version":"1.0","canonical_sha256":"9be0f94e819916a1bcc92f987b971c59089da4d7f965d0b0d7c3dfc024478f2c","source":{"kind":"arxiv","id":"1705.05060","version":2},"attestation_state":"computed","paper":{"title":"Capacity of Some Index Coding Problems with Symmetric Neighboring 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":"2017-05-15T03:12:42Z","abstract_excerpt":"A single unicast index coding problem (SUICP) with symmetric neighboring interference (SNI) has equal number of $K$ messages and $K$ receivers, the $k$th receiver $R_{k}$ wanting the $k$th message $x_{k}$ and having the side-information $\\mathcal{K}_{k}=(\\mathcal{I}_{k} \\cup x_{k})^c,$ where ${I}_k= \\{x_{k-U},\\dots,x_{k-2},x_{k-1}\\}\\cup\\{x_{k+1}, x_{k+2},\\dots,x_{k+D}\\}$ is the interference with $D$ messages after and $U$ messages before its desired message. Maleki, Cadambe and Jafar obtained the capacity of this symmetric neighboring interference single unicast index coding problem (SNI-SUICP"},"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":"1705.05060","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-15T03:12:42Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8425f9c88787ed76c0308a283adca687a90725aebbbd6685da5769d23da96cda","abstract_canon_sha256":"2b631e6a77fce9a5292c346df5512942544358582a7f87095123499045cbcfa7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:15.168231Z","signature_b64":"cztwbk1ObEalC0piKZVcHLv129gxRC86UGDlnk5vZitnyT8LJa+TRGxnkIxll8zhGMwZj+I5zncElK5uqssLBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9be0f94e819916a1bcc92f987b971c59089da4d7f965d0b0d7c3dfc024478f2c","last_reissued_at":"2026-05-18T00:44:15.167602Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:15.167602Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Capacity of Some Index Coding Problems with Symmetric Neighboring 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":"2017-05-15T03:12:42Z","abstract_excerpt":"A single unicast index coding problem (SUICP) with symmetric neighboring interference (SNI) has equal number of $K$ messages and $K$ receivers, the $k$th receiver $R_{k}$ wanting the $k$th message $x_{k}$ and having the side-information $\\mathcal{K}_{k}=(\\mathcal{I}_{k} \\cup x_{k})^c,$ where ${I}_k= \\{x_{k-U},\\dots,x_{k-2},x_{k-1}\\}\\cup\\{x_{k+1}, x_{k+2},\\dots,x_{k+D}\\}$ is the interference with $D$ messages after and $U$ messages before its desired message. Maleki, Cadambe and Jafar obtained the capacity of this symmetric neighboring interference single unicast index coding problem (SNI-SUICP"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.05060","kind":"arxiv","version":2},"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":"1705.05060","created_at":"2026-05-18T00:44:15.167707+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.05060v2","created_at":"2026-05-18T00:44:15.167707+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.05060","created_at":"2026-05-18T00:44:15.167707+00:00"},{"alias_kind":"pith_short_12","alias_value":"TPQPSTUBTELK","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_16","alias_value":"TPQPSTUBTELKDPGJ","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_8","alias_value":"TPQPSTUB","created_at":"2026-05-18T12:31:46.661854+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/TPQPSTUBTELKDPGJF6MHXFY4LE","json":"https://pith.science/pith/TPQPSTUBTELKDPGJF6MHXFY4LE.json","graph_json":"https://pith.science/api/pith-number/TPQPSTUBTELKDPGJF6MHXFY4LE/graph.json","events_json":"https://pith.science/api/pith-number/TPQPSTUBTELKDPGJF6MHXFY4LE/events.json","paper":"https://pith.science/paper/TPQPSTUB"},"agent_actions":{"view_html":"https://pith.science/pith/TPQPSTUBTELKDPGJF6MHXFY4LE","download_json":"https://pith.science/pith/TPQPSTUBTELKDPGJF6MHXFY4LE.json","view_paper":"https://pith.science/paper/TPQPSTUB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.05060&json=true","fetch_graph":"https://pith.science/api/pith-number/TPQPSTUBTELKDPGJF6MHXFY4LE/graph.json","fetch_events":"https://pith.science/api/pith-number/TPQPSTUBTELKDPGJF6MHXFY4LE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TPQPSTUBTELKDPGJF6MHXFY4LE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TPQPSTUBTELKDPGJF6MHXFY4LE/action/storage_attestation","attest_author":"https://pith.science/pith/TPQPSTUBTELKDPGJF6MHXFY4LE/action/author_attestation","sign_citation":"https://pith.science/pith/TPQPSTUBTELKDPGJF6MHXFY4LE/action/citation_signature","submit_replication":"https://pith.science/pith/TPQPSTUBTELKDPGJF6MHXFY4LE/action/replication_record"}},"created_at":"2026-05-18T00:44:15.167707+00:00","updated_at":"2026-05-18T00:44:15.167707+00:00"}