{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:AEXZLOX3RVBM76VNAGI6MK3O35","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":"cc71093e014086c52d08d8091ab79cb4d21024b55049d9676b63e40bf483c6e3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-16T03:52:12Z","title_canon_sha256":"d0410e6e63b85164df8045d482d4f9c6d8b9eba87c7f667d60bfc5b37ac5f304"},"schema_version":"1.0","source":{"id":"1507.04443","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.04443","created_at":"2026-05-18T01:36:47Z"},{"alias_kind":"arxiv_version","alias_value":"1507.04443v1","created_at":"2026-05-18T01:36:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.04443","created_at":"2026-05-18T01:36:47Z"},{"alias_kind":"pith_short_12","alias_value":"AEXZLOX3RVBM","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"AEXZLOX3RVBM76VN","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"AEXZLOX3","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:807b269930d668359fd099a0e5904208e22694274eaedf31ff49d16e6d111546","target":"graph","created_at":"2026-05-18T01:36:47Z","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":"Minimum mean square error (MMSE) signal detection algorithm is near- optimal for uplink multi-user large-scale multiple input multiple output (MIMO) systems, but involves matrix inversion with high complexity. In this letter, we firstly prove that the MMSE filtering matrix for large- scale MIMO is symmetric positive definite, based on which we propose a low-complexity near-optimal signal detection algorithm by exploiting the Richardson method to avoid the matrix inversion. The complexity can be reduced from O(K3) to O(K2), where K is the number of users. We also provide the convergence proof o","authors_text":"Linglong Dai, Xinyu Gao, Yongkui Ma, Zhaocheng Wang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-16T03:52:12Z","title":"Low-complexity near-optimal signal detection for uplink large-scale MIMO systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.04443","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:b0b5f0193f975fc97317280e0d5140c9b67f65d8380bcd0a1cbf7e5a1b254136","target":"record","created_at":"2026-05-18T01:36:47Z","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":"cc71093e014086c52d08d8091ab79cb4d21024b55049d9676b63e40bf483c6e3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-16T03:52:12Z","title_canon_sha256":"d0410e6e63b85164df8045d482d4f9c6d8b9eba87c7f667d60bfc5b37ac5f304"},"schema_version":"1.0","source":{"id":"1507.04443","kind":"arxiv","version":1}},"canonical_sha256":"012f95bafb8d42cffaad0191e62b6edf6d4dfaab9a88002937c588d91832ff57","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"012f95bafb8d42cffaad0191e62b6edf6d4dfaab9a88002937c588d91832ff57","first_computed_at":"2026-05-18T01:36:47.356041Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:47.356041Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kueyt+9SKTOYdoZU44WVrQoP31+FEw53sd6LuGDjOWrr1vVKYrTGiRTp/NUG9cdHpYhxrk4Ji5TFugKf7xiyDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:47.356662Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.04443","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b0b5f0193f975fc97317280e0d5140c9b67f65d8380bcd0a1cbf7e5a1b254136","sha256:807b269930d668359fd099a0e5904208e22694274eaedf31ff49d16e6d111546"],"state_sha256":"3638c25adc67caf4e10f85d463153c8f014eb6f6d086e3b67be460ffc5fe50a8"}