{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:IJUPPVNP5UOLADMCPNBVMVCAEJ","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":"0a26de36220727c6423554be91648ff212faf56db21a11a397875accd483c758","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-09T06:06:52Z","title_canon_sha256":"ae93d451448ce8f15fa937ee75a206c45c9baf1a8c544306dee16a8036529beb"},"schema_version":"1.0","source":{"id":"1705.03192","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.03192","created_at":"2026-05-18T00:44:22Z"},{"alias_kind":"arxiv_version","alias_value":"1705.03192v2","created_at":"2026-05-18T00:44:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.03192","created_at":"2026-05-18T00:44:22Z"},{"alias_kind":"pith_short_12","alias_value":"IJUPPVNP5UOL","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IJUPPVNP5UOLADMC","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IJUPPVNP","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:03b3d764e21bb095ff90145deb2e776f3d2a1aec087775202219c4a89e712d01","target":"graph","created_at":"2026-05-18T00:44:22Z","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, neighboring and consecutive side-information single unicast index coding problems (SNC-SUICP) with number of messages equal to the number of receivers was given by Maleki, Cadambe and Jafar. For these index coding problems, an optimal index code construction by using Vandermonde matrices was proposed. This construction requires all the side-information at the receivers to decode their wanted messages and also requires large field size. In an earlier work, we constructed binary matrices of size $m \\times n (m\\geq n)$ such that any $n$ adjacent rows of the matrix are l","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-09T06:06:52Z","title":"Low-Complexity Decoding for Symmetric, Neighboring and Consecutive Side-information Index Coding Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.03192","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:668ad078b164084cae140de2354e9bf3bb384b9ac1162d0f345f9f915acf4a07","target":"record","created_at":"2026-05-18T00:44:22Z","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":"0a26de36220727c6423554be91648ff212faf56db21a11a397875accd483c758","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-09T06:06:52Z","title_canon_sha256":"ae93d451448ce8f15fa937ee75a206c45c9baf1a8c544306dee16a8036529beb"},"schema_version":"1.0","source":{"id":"1705.03192","kind":"arxiv","version":2}},"canonical_sha256":"4268f7d5afed1cb00d827b435654402247a56a8260020c971fcf030cffcc7dfa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4268f7d5afed1cb00d827b435654402247a56a8260020c971fcf030cffcc7dfa","first_computed_at":"2026-05-18T00:44:22.969766Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:22.969766Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kY6Nf/FiL95E3XNBsnD3KqSFaiBLsKkeHWWio6RYelEf7Gr7PGz1XqBBpp8Kqc4hG/QhEaEZiAdQzmI+M5CJAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:22.970386Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.03192","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:668ad078b164084cae140de2354e9bf3bb384b9ac1162d0f345f9f915acf4a07","sha256:03b3d764e21bb095ff90145deb2e776f3d2a1aec087775202219c4a89e712d01"],"state_sha256":"8ee80db2f8adc4c4c8ad4ff7cd0bfc270c383f5d6ed6c4d441f8698ee97212c4"}