{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:6SYGKRZZDTYNV3Q3SNCS7HJPJS","short_pith_number":"pith:6SYGKRZZ","canonical_record":{"source":{"id":"1606.06408","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-06-21T03:24:57Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ac9bddf26d51cd764e5fe9764fcd55edce0d89e93a136df4ddb7f751df7c611a","abstract_canon_sha256":"c97985de093747c02affae057d496b76ae229ee63599d5872783c03a495f2d8e"},"schema_version":"1.0"},"canonical_sha256":"f4b06547391cf0daee1b93452f9d2f4cae4c107ea96a0de71d931fa3b9ed1872","source":{"kind":"arxiv","id":"1606.06408","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.06408","created_at":"2026-05-18T00:58:09Z"},{"alias_kind":"arxiv_version","alias_value":"1606.06408v1","created_at":"2026-05-18T00:58:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.06408","created_at":"2026-05-18T00:58:09Z"},{"alias_kind":"pith_short_12","alias_value":"6SYGKRZZDTYN","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"6SYGKRZZDTYNV3Q3","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"6SYGKRZZ","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:6SYGKRZZDTYNV3Q3SNCS7HJPJS","target":"record","payload":{"canonical_record":{"source":{"id":"1606.06408","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-06-21T03:24:57Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ac9bddf26d51cd764e5fe9764fcd55edce0d89e93a136df4ddb7f751df7c611a","abstract_canon_sha256":"c97985de093747c02affae057d496b76ae229ee63599d5872783c03a495f2d8e"},"schema_version":"1.0"},"canonical_sha256":"f4b06547391cf0daee1b93452f9d2f4cae4c107ea96a0de71d931fa3b9ed1872","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:09.275007Z","signature_b64":"Xf+6lDKWDFI+kCzHEgL+j01abHXbTaiyxCaV767slVQri6Zxd5/R3bfco+jLDSGmGP2yVoyB5YGbIwGyq4ZOCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f4b06547391cf0daee1b93452f9d2f4cae4c107ea96a0de71d931fa3b9ed1872","last_reissued_at":"2026-05-18T00:58:09.274492Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:09.274492Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.06408","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:58:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HFkmI5d+mDNwbtIKxXUy4wfVQn80FPGnmdXPutus5W5Yh1KWeNsTcspoYQkjII2pHjkMs3LH622TcLZ8Xw1XCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T10:31:22.564498Z"},"content_sha256":"8bb3fea7417c02458c658ee7abdde7bd94c306432728765d91c6c6473be21440","schema_version":"1.0","event_id":"sha256:8bb3fea7417c02458c658ee7abdde7bd94c306432728765d91c6c6473be21440"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:6SYGKRZZDTYNV3Q3SNCS7HJPJS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Convergence Analysis and Assurance for Gaussian Message Passing Iterative Detector in Massive MU-MIMO Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chau Yuen, Lei Liu, Ying Li, Yong Liang Guan, Yuping Su","submitted_at":"2016-06-21T03:24:57Z","abstract_excerpt":"This paper considers a low-complexity Gaussian Message Passing Iterative Detection (GMPID) algorithm for 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 very large numbers, and we consider the cases that $K<M$. The GMPID is a low-complexity message passing algorithm based on a fully connected loopy graph, which is well understood to be not convergent in some cases. As it is hard to analyse the GMPID directly, the large-scale property of the massive MU-MIMO is used to si"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.06408","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:58:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1coVGQnQVkQ6EyIpHM9MlE/mmBvo4XBOYWTlVWwdLoKFxO44xMOigCKD1OTmhYH/Q//rgmCwSIbeG+Aqdg4+Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T10:31:22.564838Z"},"content_sha256":"be77fd40837141fd41585586b383fbc924cb45ff0747d251a1a1a85511c71099","schema_version":"1.0","event_id":"sha256:be77fd40837141fd41585586b383fbc924cb45ff0747d251a1a1a85511c71099"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6SYGKRZZDTYNV3Q3SNCS7HJPJS/bundle.json","state_url":"https://pith.science/pith/6SYGKRZZDTYNV3Q3SNCS7HJPJS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6SYGKRZZDTYNV3Q3SNCS7HJPJS/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-25T10:31:22Z","links":{"resolver":"https://pith.science/pith/6SYGKRZZDTYNV3Q3SNCS7HJPJS","bundle":"https://pith.science/pith/6SYGKRZZDTYNV3Q3SNCS7HJPJS/bundle.json","state":"https://pith.science/pith/6SYGKRZZDTYNV3Q3SNCS7HJPJS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6SYGKRZZDTYNV3Q3SNCS7HJPJS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:6SYGKRZZDTYNV3Q3SNCS7HJPJS","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":"c97985de093747c02affae057d496b76ae229ee63599d5872783c03a495f2d8e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-06-21T03:24:57Z","title_canon_sha256":"ac9bddf26d51cd764e5fe9764fcd55edce0d89e93a136df4ddb7f751df7c611a"},"schema_version":"1.0","source":{"id":"1606.06408","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.06408","created_at":"2026-05-18T00:58:09Z"},{"alias_kind":"arxiv_version","alias_value":"1606.06408v1","created_at":"2026-05-18T00:58:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.06408","created_at":"2026-05-18T00:58:09Z"},{"alias_kind":"pith_short_12","alias_value":"6SYGKRZZDTYN","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"6SYGKRZZDTYNV3Q3","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"6SYGKRZZ","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:be77fd40837141fd41585586b383fbc924cb45ff0747d251a1a1a85511c71099","target":"graph","created_at":"2026-05-18T00:58:09Z","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) algorithm for 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 very large numbers, and we consider the cases that $K<M$. The GMPID is a low-complexity message passing algorithm based on a fully connected loopy graph, which is well understood to be not convergent in some cases. As it is hard to analyse the GMPID directly, the large-scale property of the massive MU-MIMO is used to si","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":"2016-06-21T03:24:57Z","title":"Convergence Analysis and Assurance for Gaussian Message Passing Iterative Detector in Massive MU-MIMO Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.06408","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:8bb3fea7417c02458c658ee7abdde7bd94c306432728765d91c6c6473be21440","target":"record","created_at":"2026-05-18T00:58:09Z","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":"c97985de093747c02affae057d496b76ae229ee63599d5872783c03a495f2d8e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-06-21T03:24:57Z","title_canon_sha256":"ac9bddf26d51cd764e5fe9764fcd55edce0d89e93a136df4ddb7f751df7c611a"},"schema_version":"1.0","source":{"id":"1606.06408","kind":"arxiv","version":1}},"canonical_sha256":"f4b06547391cf0daee1b93452f9d2f4cae4c107ea96a0de71d931fa3b9ed1872","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f4b06547391cf0daee1b93452f9d2f4cae4c107ea96a0de71d931fa3b9ed1872","first_computed_at":"2026-05-18T00:58:09.274492Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:09.274492Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Xf+6lDKWDFI+kCzHEgL+j01abHXbTaiyxCaV767slVQri6Zxd5/R3bfco+jLDSGmGP2yVoyB5YGbIwGyq4ZOCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:09.275007Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.06408","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8bb3fea7417c02458c658ee7abdde7bd94c306432728765d91c6c6473be21440","sha256:be77fd40837141fd41585586b383fbc924cb45ff0747d251a1a1a85511c71099"],"state_sha256":"caf3a10b9fca56bf99488a2169cc3ceb4d638eb3c51e4f62e4ef7c61454817de"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BNEljxPce/sbuKbzJbLcyXucQsX1dIiYc4MKNHtvaAm/4e4yMl23vx0o9E4r+taw+aG+WFN8FXKiKLGvGgyDDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T10:31:22.566791Z","bundle_sha256":"6a01fbd3f98be0d8db0de03ba83fbbfd0ba919dcb8dbff2706da1e41b6639d87"}}