{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:QGV57PKOPATGJZTULFAD4SCC7Q","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":"0fe348ce831dd081dee86d8309fd6b5d0ceada135f80dd17444adc483d07dc29","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-16T14:15:13Z","title_canon_sha256":"5e718cc1e7e3efd2ddea51a0a002371484f9cfaa070e02ba3234d67a0ad9c6f4"},"schema_version":"1.0","source":{"id":"1507.04588","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.04588","created_at":"2026-05-18T01:36:46Z"},{"alias_kind":"arxiv_version","alias_value":"1507.04588v1","created_at":"2026-05-18T01:36:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.04588","created_at":"2026-05-18T01:36:46Z"},{"alias_kind":"pith_short_12","alias_value":"QGV57PKOPATG","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"QGV57PKOPATGJZTU","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"QGV57PKO","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:23bfe786c09a5552509719ce0581644a2557ccc43c056ea4bd656036a740455e","target":"graph","created_at":"2026-05-18T01:36:46Z","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":"For uplink large-scale MIMO systems, linear minimum mean square error (MMSE) signal detection algorithm is near-optimal but involves matrix inversion with high complexity. In this paper, we propose a low-complexity signal detection algorithm based on the successive overrelaxation (SOR) method to avoid the complicated matrix inversion. We first prove a special property that the MMSE filtering matrix is symmetric positive definite for uplink large-scale MIMO systems, which is the premise for the SOR method. Then a low-complexity iterative signal detection algorithm based on the SOR method as wel","authors_text":"Linglong Dai, Xinyu Gao, Yuting Hu, Zhaocheng Wang, Zhongxu Wang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-16T14:15:13Z","title":"Matrix Inversion-Less Signal Detection Using SOR Method for Uplink Large-Scale MIMO Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.04588","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:1b401c729a8ed9c84e5f3a8a7be72799a43d8d096dc906ddcb04bba67ec77eed","target":"record","created_at":"2026-05-18T01:36:46Z","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":"0fe348ce831dd081dee86d8309fd6b5d0ceada135f80dd17444adc483d07dc29","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-16T14:15:13Z","title_canon_sha256":"5e718cc1e7e3efd2ddea51a0a002371484f9cfaa070e02ba3234d67a0ad9c6f4"},"schema_version":"1.0","source":{"id":"1507.04588","kind":"arxiv","version":1}},"canonical_sha256":"81abdfbd4e782664e67459403e4842fc228c1ef9dd528852e1519f4de4f7477f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"81abdfbd4e782664e67459403e4842fc228c1ef9dd528852e1519f4de4f7477f","first_computed_at":"2026-05-18T01:36:46.949398Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:46.949398Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cAIPdaxRcBMqUI/dM1aEsJalnimvROQ3mov/z+EJJ+vDemXKK/nPggzfp5SnZ63535oXKJrZcK/5X2TCQarvCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:46.949927Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.04588","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1b401c729a8ed9c84e5f3a8a7be72799a43d8d096dc906ddcb04bba67ec77eed","sha256:23bfe786c09a5552509719ce0581644a2557ccc43c056ea4bd656036a740455e"],"state_sha256":"5832195ac07d9fdd85bf8cc8e588c2d05ab2ff993934baef86bb5163ef002482"}