{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:PFTSIY54JPCZOJCTWOJNPM6E65","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":"e934fc3527fb436b9d75e2891eea7898b89637e0a5f1355a28ab99ab750ace52","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-26T02:49:04Z","title_canon_sha256":"b2022d12f2a64ff33f5d612c7d2add13fdcd6b71e5b6060779579634536712d6"},"schema_version":"1.0","source":{"id":"1510.07355","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.07355","created_at":"2026-05-18T00:58:10Z"},{"alias_kind":"arxiv_version","alias_value":"1510.07355v1","created_at":"2026-05-18T00:58:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.07355","created_at":"2026-05-18T00:58:10Z"},{"alias_kind":"pith_short_12","alias_value":"PFTSIY54JPCZ","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PFTSIY54JPCZOJCT","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PFTSIY54","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:f1ccb0938621317467116c8bfee2116a31acf4d518b09a95ac02dd1f44e40907","target":"graph","created_at":"2026-05-18T00:58:10Z","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":"This paper considers a low-complexity Gaussian Message Passing Iterative Detection (GMPID) method over a pairwise graph for a massive Multiuser Multiple-Input Multiple-Output (MU-MIMO) system, in which a base station with M antennas serves K Gaussian sources simultaneously. Both K and M are large numbers and we consider the cases that K<M in this paper. The GMPID is a message passing algorithm based on a fully connected loopy graph, which is well known that it is not convergent in some cases. In this paper, we first analyse the convergence of GMPID. Two sufficient conditions that the GMPID con","authors_text":"Chau Yuen, Lei Liu, Ying Li, Yong Liang Guan, Yuping Su","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-26T02:49:04Z","title":"A Low-Complexity Gaussian Message Passing Iterative Detector for Massive MU-MIMO Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.07355","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:46d2d799fc73839fd7cee8320f0e36d20a067b89072691663fcc83ea10588d01","target":"record","created_at":"2026-05-18T00:58:10Z","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":"e934fc3527fb436b9d75e2891eea7898b89637e0a5f1355a28ab99ab750ace52","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-26T02:49:04Z","title_canon_sha256":"b2022d12f2a64ff33f5d612c7d2add13fdcd6b71e5b6060779579634536712d6"},"schema_version":"1.0","source":{"id":"1510.07355","kind":"arxiv","version":1}},"canonical_sha256":"79672463bc4bc5972453b392d7b3c4f750e1a4af278c7d0406fb10a1bc1f7fd9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"79672463bc4bc5972453b392d7b3c4f750e1a4af278c7d0406fb10a1bc1f7fd9","first_computed_at":"2026-05-18T00:58:10.182373Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:10.182373Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"I3uBBdEkaCbMi5J4ywyphIYa1fUAHc7zXS2xq8VzAnTY1CIpdDSfM57lVY273gII1q/xc/cRvXN5TzMy83C1Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:10.182916Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.07355","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:46d2d799fc73839fd7cee8320f0e36d20a067b89072691663fcc83ea10588d01","sha256:f1ccb0938621317467116c8bfee2116a31acf4d518b09a95ac02dd1f44e40907"],"state_sha256":"e625f3996452e8377d9b30d3cc21d541f25336105f57bf534e12d64b0c5dadad"}