{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:Q4A5YUZOIWTHHS7CNPOWPYARAS","short_pith_number":"pith:Q4A5YUZO","schema_version":"1.0","canonical_sha256":"8701dc532e45a673cbe26bdd67e011049c871850f56db6ea71ffab1a79affe01","source":{"kind":"arxiv","id":"1811.05794","version":1},"attestation_state":"computed","paper":{"title":"Optimal Scalar Linear Index Codes for Symmetric and Neighboring Side-information Problems","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-11-13T15:40:50Z","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"},"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":"1811.05794","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-13T15:40:50Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6c630a6f96f5daa6a84dc0c3643252d4b684aab901fb688defef932baa3ebf21","abstract_canon_sha256":"ac96d1e9561919b12c6449cdb3e0f8ad7ae0cc3df5023f6562052a0b3761c527"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:42.080034Z","signature_b64":"+bu/IffJnF1/X5dd5244sf5/9NFpyIjlk/eZ9ogXPg8jvrsLx6s0oM8aZJZpuLE7APClWVNr45SS36gdMdHCAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8701dc532e45a673cbe26bdd67e011049c871850f56db6ea71ffab1a79affe01","last_reissued_at":"2026-05-18T00:00:42.079650Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:42.079650Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Scalar Linear Index Codes for Symmetric and Neighboring Side-information Problems","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-11-13T15:40:50Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.05794","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":"1811.05794","created_at":"2026-05-18T00:00:42.079708+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.05794v1","created_at":"2026-05-18T00:00:42.079708+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.05794","created_at":"2026-05-18T00:00:42.079708+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q4A5YUZOIWTH","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q4A5YUZOIWTHHS7C","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q4A5YUZO","created_at":"2026-05-18T12:32:46.962924+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/Q4A5YUZOIWTHHS7CNPOWPYARAS","json":"https://pith.science/pith/Q4A5YUZOIWTHHS7CNPOWPYARAS.json","graph_json":"https://pith.science/api/pith-number/Q4A5YUZOIWTHHS7CNPOWPYARAS/graph.json","events_json":"https://pith.science/api/pith-number/Q4A5YUZOIWTHHS7CNPOWPYARAS/events.json","paper":"https://pith.science/paper/Q4A5YUZO"},"agent_actions":{"view_html":"https://pith.science/pith/Q4A5YUZOIWTHHS7CNPOWPYARAS","download_json":"https://pith.science/pith/Q4A5YUZOIWTHHS7CNPOWPYARAS.json","view_paper":"https://pith.science/paper/Q4A5YUZO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.05794&json=true","fetch_graph":"https://pith.science/api/pith-number/Q4A5YUZOIWTHHS7CNPOWPYARAS/graph.json","fetch_events":"https://pith.science/api/pith-number/Q4A5YUZOIWTHHS7CNPOWPYARAS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q4A5YUZOIWTHHS7CNPOWPYARAS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q4A5YUZOIWTHHS7CNPOWPYARAS/action/storage_attestation","attest_author":"https://pith.science/pith/Q4A5YUZOIWTHHS7CNPOWPYARAS/action/author_attestation","sign_citation":"https://pith.science/pith/Q4A5YUZOIWTHHS7CNPOWPYARAS/action/citation_signature","submit_replication":"https://pith.science/pith/Q4A5YUZOIWTHHS7CNPOWPYARAS/action/replication_record"}},"created_at":"2026-05-18T00:00:42.079708+00:00","updated_at":"2026-05-18T00:00:42.079708+00:00"}