{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:I67VC4M6ZZC65LCNFBH3TDNJWA","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":"aa31b2fbba0543779795b41e82edc538765020ae2fdd1f527921fb75c5d3c2f3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-29T12:55:07Z","title_canon_sha256":"080eb9bd46415c63fc1ccd1c7e97b55f1a6d5c4292164c2235470b8b37f90bfb"},"schema_version":"1.0","source":{"id":"1605.08998","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.08998","created_at":"2026-05-18T01:12:54Z"},{"alias_kind":"arxiv_version","alias_value":"1605.08998v2","created_at":"2026-05-18T01:12:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.08998","created_at":"2026-05-18T01:12:54Z"},{"alias_kind":"pith_short_12","alias_value":"I67VC4M6ZZC6","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"I67VC4M6ZZC65LCN","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"I67VC4M6","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:58cbfd05c7efea4a9c268e22b09a54a1994d323fec9109b1a129c8cdee428f51","target":"graph","created_at":"2026-05-18T01:12:54Z","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":"The capacity of symmetric instance of the multiple unicast index coding problem with neighboring antidotes (side-information) with number of messages equal to the number of receivers was given by Maleki \\textit{et al.} In this paper, we construct matrices of size $ m \\times n (m \\geq n)$ over $F_q$ such that any $n$ adjacent rows of the matrix are linearly independent. By using such matrices, we give an optimal scalar linear index codes over $F_q$ for the symmetric one-sided antidote problems considered by Maleki \\textit{et al.} for any given number of messages and one-sided antidotes. The con","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":"2016-05-29T12:55:07Z","title":"Optimal Scalar Linear Index Codes for One-Sided Neighboring Side-Information Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.08998","kind":"arxiv","version":2},"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:8c49b6ff2827167431b19bec12ed8c448f1a2b1d7b940ba5f3a34379fff1b2b0","target":"record","created_at":"2026-05-18T01:12:54Z","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":"aa31b2fbba0543779795b41e82edc538765020ae2fdd1f527921fb75c5d3c2f3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-29T12:55:07Z","title_canon_sha256":"080eb9bd46415c63fc1ccd1c7e97b55f1a6d5c4292164c2235470b8b37f90bfb"},"schema_version":"1.0","source":{"id":"1605.08998","kind":"arxiv","version":2}},"canonical_sha256":"47bf51719ece45eeac4d284fb98da9b0113fee48065840568a82add1971eec14","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"47bf51719ece45eeac4d284fb98da9b0113fee48065840568a82add1971eec14","first_computed_at":"2026-05-18T01:12:54.588501Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:54.588501Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZNdKJ3V7DGGGsV6WcBHDW5M5UnDjgRXpQaNqHMn2o+80DSdhfQYYqzDVkiGt6Syv72UPr4nZtz0NgMpFV2fXDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:54.588855Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.08998","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8c49b6ff2827167431b19bec12ed8c448f1a2b1d7b940ba5f3a34379fff1b2b0","sha256:58cbfd05c7efea4a9c268e22b09a54a1994d323fec9109b1a129c8cdee428f51"],"state_sha256":"d4db96f073eba9d7b9d588a46faedcadb023b3090c76d9d3236d04dea2fb47c2"}