{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:Q4A5YUZOIWTHHS7CNPOWPYARAS","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":"ac96d1e9561919b12c6449cdb3e0f8ad7ae0cc3df5023f6562052a0b3761c527","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-13T15:40:50Z","title_canon_sha256":"6c630a6f96f5daa6a84dc0c3643252d4b684aab901fb688defef932baa3ebf21"},"schema_version":"1.0","source":{"id":"1811.05794","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.05794","created_at":"2026-05-18T00:00:42Z"},{"alias_kind":"arxiv_version","alias_value":"1811.05794v1","created_at":"2026-05-18T00:00:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.05794","created_at":"2026-05-18T00:00:42Z"},{"alias_kind":"pith_short_12","alias_value":"Q4A5YUZOIWTH","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"Q4A5YUZOIWTHHS7C","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"Q4A5YUZO","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:a63ecaeb30122c994a99069b8e709f79c761a3da7fe97aa8df14689e9ac49b95","target":"graph","created_at":"2026-05-18T00:00:42Z","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) is called symmetric neighboring and consecutive (SNC) side-information problem if it has $K$ messages and $K$ receivers, the $k$th receiver $R_{k}$ wanting the $k$th message $x_{k}$ and having the side-information $D$ messages immediately after $x_k$ and $U$ ($D\\geq U$) messages immediately before $x_k$. Maleki, Cadambe and Jafar obtained the capacity of this SUICP(SNC) and proposed $(U+1)$-dimensional optimal length vector linear index codes by using Vandermonde matrices. However, for a $b$-dimensional vector linear index code, the transmitter nee","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-11-13T15:40:50Z","title":"Optimal Scalar Linear Index Codes for Symmetric and Neighboring Side-information Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.05794","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:2d83961e48d75130b787dd5325b85f9550f7c38dda9fe648e5917c0f7e97fabc","target":"record","created_at":"2026-05-18T00:00:42Z","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":"ac96d1e9561919b12c6449cdb3e0f8ad7ae0cc3df5023f6562052a0b3761c527","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-13T15:40:50Z","title_canon_sha256":"6c630a6f96f5daa6a84dc0c3643252d4b684aab901fb688defef932baa3ebf21"},"schema_version":"1.0","source":{"id":"1811.05794","kind":"arxiv","version":1}},"canonical_sha256":"8701dc532e45a673cbe26bdd67e011049c871850f56db6ea71ffab1a79affe01","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8701dc532e45a673cbe26bdd67e011049c871850f56db6ea71ffab1a79affe01","first_computed_at":"2026-05-18T00:00:42.079650Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:42.079650Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+bu/IffJnF1/X5dd5244sf5/9NFpyIjlk/eZ9ogXPg8jvrsLx6s0oM8aZJZpuLE7APClWVNr45SS36gdMdHCAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:42.080034Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.05794","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2d83961e48d75130b787dd5325b85f9550f7c38dda9fe648e5917c0f7e97fabc","sha256:a63ecaeb30122c994a99069b8e709f79c761a3da7fe97aa8df14689e9ac49b95"],"state_sha256":"58640cb63c19dae9369af50bc9308a6a8ce8d62e830be57ed2b8199fb9f5b4b1"}