{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:JLMBJ5N7ID6IAMVDRDBT2DXORY","short_pith_number":"pith:JLMBJ5N7","schema_version":"1.0","canonical_sha256":"4ad814f5bf40fc8032a388c33d0eee8e33675c0739d401e5534afa966776c676","source":{"kind":"arxiv","id":"1607.00800","version":1},"attestation_state":"computed","paper":{"title":"Gaussian Message Passing Iterative Detection for MIMO-NOMA Systems with Massive Access","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chau Yuen, Chongwen Huang, Lei Liu, Ying Li, Yong Liang Guan","submitted_at":"2016-07-04T09:44:12Z","abstract_excerpt":"This paper considers a low-complexity Gaussian Message Passing Iterative Detection (GMPID) algorithm for Multiple-Input Multiple-Output systems with Non-Orthogonal Multiple Access (MIMO-NOMA), in which a base station with $N_r$ antennas serves $N_u$ sources simultaneously. Both $N_u$ and $N_r$ are very large numbers and we consider the cases that $N_u>N_r$. The GMPID is based on a fully connected loopy graph, which is well understood to be not convergent in some cases. The large-scale property of the MIMO-NOMA is used to simplify the convergence analysis. Firstly, we prove that the variances o"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1607.00800","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-04T09:44:12Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2806edd0272ddd8b8ced90c66c076a65b461f1a19b617b69442d6e839ab25b0a","abstract_canon_sha256":"665a0d6dba8946ed9e16b98ed99cae10d361dd4489a25c82161d2cbd22723e82"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:34.259740Z","signature_b64":"hZvXfzUNftT2nKL52BvtRLkB5ag3+mhW2Uo7XXm9E07Rh3+PoPZL/thtFmrGNMnUkI9VYQNQrwMx8kZxJakmCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ad814f5bf40fc8032a388c33d0eee8e33675c0739d401e5534afa966776c676","last_reissued_at":"2026-05-18T01:11:34.259339Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:34.259339Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Gaussian Message Passing Iterative Detection for MIMO-NOMA Systems with Massive Access","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chau Yuen, Chongwen Huang, Lei Liu, Ying Li, Yong Liang Guan","submitted_at":"2016-07-04T09:44:12Z","abstract_excerpt":"This paper considers a low-complexity Gaussian Message Passing Iterative Detection (GMPID) algorithm for Multiple-Input Multiple-Output systems with Non-Orthogonal Multiple Access (MIMO-NOMA), in which a base station with $N_r$ antennas serves $N_u$ sources simultaneously. Both $N_u$ and $N_r$ are very large numbers and we consider the cases that $N_u>N_r$. The GMPID is based on a fully connected loopy graph, which is well understood to be not convergent in some cases. The large-scale property of the MIMO-NOMA is used to simplify the convergence analysis. Firstly, we prove that the variances o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.00800","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1607.00800","created_at":"2026-05-18T01:11:34.259408+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.00800v1","created_at":"2026-05-18T01:11:34.259408+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.00800","created_at":"2026-05-18T01:11:34.259408+00:00"},{"alias_kind":"pith_short_12","alias_value":"JLMBJ5N7ID6I","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_16","alias_value":"JLMBJ5N7ID6IAMVD","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_8","alias_value":"JLMBJ5N7","created_at":"2026-05-18T12:30:25.849896+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JLMBJ5N7ID6IAMVDRDBT2DXORY","json":"https://pith.science/pith/JLMBJ5N7ID6IAMVDRDBT2DXORY.json","graph_json":"https://pith.science/api/pith-number/JLMBJ5N7ID6IAMVDRDBT2DXORY/graph.json","events_json":"https://pith.science/api/pith-number/JLMBJ5N7ID6IAMVDRDBT2DXORY/events.json","paper":"https://pith.science/paper/JLMBJ5N7"},"agent_actions":{"view_html":"https://pith.science/pith/JLMBJ5N7ID6IAMVDRDBT2DXORY","download_json":"https://pith.science/pith/JLMBJ5N7ID6IAMVDRDBT2DXORY.json","view_paper":"https://pith.science/paper/JLMBJ5N7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.00800&json=true","fetch_graph":"https://pith.science/api/pith-number/JLMBJ5N7ID6IAMVDRDBT2DXORY/graph.json","fetch_events":"https://pith.science/api/pith-number/JLMBJ5N7ID6IAMVDRDBT2DXORY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JLMBJ5N7ID6IAMVDRDBT2DXORY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JLMBJ5N7ID6IAMVDRDBT2DXORY/action/storage_attestation","attest_author":"https://pith.science/pith/JLMBJ5N7ID6IAMVDRDBT2DXORY/action/author_attestation","sign_citation":"https://pith.science/pith/JLMBJ5N7ID6IAMVDRDBT2DXORY/action/citation_signature","submit_replication":"https://pith.science/pith/JLMBJ5N7ID6IAMVDRDBT2DXORY/action/replication_record"}},"created_at":"2026-05-18T01:11:34.259408+00:00","updated_at":"2026-05-18T01:11:34.259408+00:00"}