{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:2E37SZAULFVVLSH37OCJIQBXYY","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":"5cef67a90454bea067ec21d568d3fdd3244a6672cf7d05d273511dfcbff0ff2b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-28T10:20:09Z","title_canon_sha256":"59ca8e8dd96b4e5f56b0af3a84a189b629d1e8a3a3c1164ca2d12bd33ef0d8df"},"schema_version":"1.0","source":{"id":"1705.10614","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.10614","created_at":"2026-05-18T00:43:24Z"},{"alias_kind":"arxiv_version","alias_value":"1705.10614v1","created_at":"2026-05-18T00:43:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.10614","created_at":"2026-05-18T00:43:24Z"},{"alias_kind":"pith_short_12","alias_value":"2E37SZAULFVV","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2E37SZAULFVVLSH3","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2E37SZAU","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:ebe2b74afa0d712dd724afe6f9a48e4b28bbcc4117633d7abd2d8b0bd1d91cd7","target":"graph","created_at":"2026-05-18T00:43:24Z","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 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","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":"2017-05-28T10:20:09Z","title":"Near-Optimal Vector Linear Index Codes For Single Unicast Index Coding Problems with Symmetric Neighboring Interference"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.10614","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:6edebcad57f13ecb64b2d970182184ba46d9db8117bd8a78bffe19d782547d13","target":"record","created_at":"2026-05-18T00:43:24Z","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":"5cef67a90454bea067ec21d568d3fdd3244a6672cf7d05d273511dfcbff0ff2b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-28T10:20:09Z","title_canon_sha256":"59ca8e8dd96b4e5f56b0af3a84a189b629d1e8a3a3c1164ca2d12bd33ef0d8df"},"schema_version":"1.0","source":{"id":"1705.10614","kind":"arxiv","version":1}},"canonical_sha256":"d137f96414596b55c8fbfb84944037c62761e1c5fa90a617eed5165371341f18","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d137f96414596b55c8fbfb84944037c62761e1c5fa90a617eed5165371341f18","first_computed_at":"2026-05-18T00:43:24.043022Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:24.043022Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WQ1dDg0mgKf3UqVhZi0c2ijQl1B+eq5oj75gZId6PsBUr+uglyDtJwQEy/PyPD2zmQxDQe1Dvi5BBkGKfrKeBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:24.043619Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.10614","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6edebcad57f13ecb64b2d970182184ba46d9db8117bd8a78bffe19d782547d13","sha256:ebe2b74afa0d712dd724afe6f9a48e4b28bbcc4117633d7abd2d8b0bd1d91cd7"],"state_sha256":"8fe58fe057d907767f4b520835676d3fd7c43295160cd4b0ef848c357eb48231"}