{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:HZMLYPF4VZR226E3YE3HENGIOK","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":"96d0305023ee39ed39c92ddf90da4e71fe2506e12568736dcdfd9080b480db6b","cross_cats_sorted":["eess.SP","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-05T18:51:10Z","title_canon_sha256":"529bd08bdae2405e138c09a3294b2f4723c281ded1839db5718f8c23e6ce0575"},"schema_version":"1.0","source":{"id":"1811.01917","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.01917","created_at":"2026-05-18T00:01:32Z"},{"alias_kind":"arxiv_version","alias_value":"1811.01917v1","created_at":"2026-05-18T00:01:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01917","created_at":"2026-05-18T00:01:32Z"},{"alias_kind":"pith_short_12","alias_value":"HZMLYPF4VZR2","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HZMLYPF4VZR226E3","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HZMLYPF4","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:1c5cc8781135198e65013da387b906db4c489db44abb0593f32eef794b14cfd2","target":"graph","created_at":"2026-05-18T00:01:32Z","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":"Large multiple-input multiple-output (MIMO) appears in massive multi-user MIMO and randomly-spread code-division multiple access (CDMA)-based wireless systems. In order to cope with the excessively high complexity of optimal data detection in such systems, a variety of efficient yet sub-optimal algorithms have been proposed in the past. In this paper, we propose a data detection algorithm that is computationally efficient and optimal in a sense that it is able to achieve the same error-rate performance as the individually optimal (IO) data detector under certain assumptions on the MIMO system ","authors_text":"Arian Maleki, Charles Jeon, Christoph Studer, Ramina Ghods","cross_cats":["eess.SP","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-05T18:51:10Z","title":"Optimal Data Detection in Large MIMO"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.01917","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:d32846197018bd4c137c4dbf2bdbd1c0d8b96cbc8e9c3680914d73f31fdfae04","target":"record","created_at":"2026-05-18T00:01:32Z","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":"96d0305023ee39ed39c92ddf90da4e71fe2506e12568736dcdfd9080b480db6b","cross_cats_sorted":["eess.SP","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-05T18:51:10Z","title_canon_sha256":"529bd08bdae2405e138c09a3294b2f4723c281ded1839db5718f8c23e6ce0575"},"schema_version":"1.0","source":{"id":"1811.01917","kind":"arxiv","version":1}},"canonical_sha256":"3e58bc3cbcae63ad789bc1367234c8728d3d67e4c4fb4e250d6677de658441c2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3e58bc3cbcae63ad789bc1367234c8728d3d67e4c4fb4e250d6677de658441c2","first_computed_at":"2026-05-18T00:01:32.943470Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:32.943470Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gRFpShshH5qmegYj5qQY6hZ+DZJ9SHEIMkEfmW1Y+deImLntH2qeUXSjfcOvxMc2h0QRXkxvBbeG4pURjiN3Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:32.943972Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.01917","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d32846197018bd4c137c4dbf2bdbd1c0d8b96cbc8e9c3680914d73f31fdfae04","sha256:1c5cc8781135198e65013da387b906db4c489db44abb0593f32eef794b14cfd2"],"state_sha256":"7d52db062997f2b16b0c31cbb807e23131724567c5680ebf99cd9c5e632f2681"}