{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:2E37SZAULFVVLSH37OCJIQBXYY","short_pith_number":"pith:2E37SZAU","schema_version":"1.0","canonical_sha256":"d137f96414596b55c8fbfb84944037c62761e1c5fa90a617eed5165371341f18","source":{"kind":"arxiv","id":"1705.10614","version":1},"attestation_state":"computed","paper":{"title":"Near-Optimal Vector Linear Index Codes For Single Unicast 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-28T10:20:09Z","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 single unicast index coding problem with symmetric neighboring interference (SUIC"},"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.10614","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-28T10:20:09Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"59ca8e8dd96b4e5f56b0af3a84a189b629d1e8a3a3c1164ca2d12bd33ef0d8df","abstract_canon_sha256":"5cef67a90454bea067ec21d568d3fdd3244a6672cf7d05d273511dfcbff0ff2b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:24.043619Z","signature_b64":"WQ1dDg0mgKf3UqVhZi0c2ijQl1B+eq5oj75gZId6PsBUr+uglyDtJwQEy/PyPD2zmQxDQe1Dvi5BBkGKfrKeBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d137f96414596b55c8fbfb84944037c62761e1c5fa90a617eed5165371341f18","last_reissued_at":"2026-05-18T00:43:24.043022Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:24.043022Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near-Optimal Vector Linear Index Codes For Single Unicast 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-28T10:20:09Z","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 single unicast index coding problem with symmetric neighboring interference (SUIC"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.10614","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":"1705.10614","created_at":"2026-05-18T00:43:24.043108+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.10614v1","created_at":"2026-05-18T00:43:24.043108+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.10614","created_at":"2026-05-18T00:43:24.043108+00:00"},{"alias_kind":"pith_short_12","alias_value":"2E37SZAULFVV","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"2E37SZAULFVVLSH3","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"2E37SZAU","created_at":"2026-05-18T12:30:55.937587+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/2E37SZAULFVVLSH37OCJIQBXYY","json":"https://pith.science/pith/2E37SZAULFVVLSH37OCJIQBXYY.json","graph_json":"https://pith.science/api/pith-number/2E37SZAULFVVLSH37OCJIQBXYY/graph.json","events_json":"https://pith.science/api/pith-number/2E37SZAULFVVLSH37OCJIQBXYY/events.json","paper":"https://pith.science/paper/2E37SZAU"},"agent_actions":{"view_html":"https://pith.science/pith/2E37SZAULFVVLSH37OCJIQBXYY","download_json":"https://pith.science/pith/2E37SZAULFVVLSH37OCJIQBXYY.json","view_paper":"https://pith.science/paper/2E37SZAU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.10614&json=true","fetch_graph":"https://pith.science/api/pith-number/2E37SZAULFVVLSH37OCJIQBXYY/graph.json","fetch_events":"https://pith.science/api/pith-number/2E37SZAULFVVLSH37OCJIQBXYY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2E37SZAULFVVLSH37OCJIQBXYY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2E37SZAULFVVLSH37OCJIQBXYY/action/storage_attestation","attest_author":"https://pith.science/pith/2E37SZAULFVVLSH37OCJIQBXYY/action/author_attestation","sign_citation":"https://pith.science/pith/2E37SZAULFVVLSH37OCJIQBXYY/action/citation_signature","submit_replication":"https://pith.science/pith/2E37SZAULFVVLSH37OCJIQBXYY/action/replication_record"}},"created_at":"2026-05-18T00:43:24.043108+00:00","updated_at":"2026-05-18T00:43:24.043108+00:00"}