{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:JLMBJ5N7ID6IAMVDRDBT2DXORY","short_pith_number":"pith:JLMBJ5N7","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"},"canonical_sha256":"4ad814f5bf40fc8032a388c33d0eee8e33675c0739d401e5534afa966776c676","source":{"kind":"arxiv","id":"1607.00800","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.00800","created_at":"2026-05-18T01:11:34Z"},{"alias_kind":"arxiv_version","alias_value":"1607.00800v1","created_at":"2026-05-18T01:11:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.00800","created_at":"2026-05-18T01:11:34Z"},{"alias_kind":"pith_short_12","alias_value":"JLMBJ5N7ID6I","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"JLMBJ5N7ID6IAMVD","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"JLMBJ5N7","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:JLMBJ5N7ID6IAMVDRDBT2DXORY","target":"record","payload":{"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"},"canonical_sha256":"4ad814f5bf40fc8032a388c33d0eee8e33675c0739d401e5534afa966776c676","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"},"source_kind":"arxiv","source_id":"1607.00800","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-18T01:11:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kUFdLoJbrBTArJybbEPT8TKg7JWrm2rWl3E194Ne7UCeiwd7Ucg/N7FOSEogD3xW8iInheswMbuTy1Kt0RdbAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:08:43.124025Z"},"content_sha256":"e6c7cb3eb06af5fd097ce6d60a4c516c9e4240182ab064740269310d758c395c","schema_version":"1.0","event_id":"sha256:e6c7cb3eb06af5fd097ce6d60a4c516c9e4240182ab064740269310d758c395c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:JLMBJ5N7ID6IAMVDRDBT2DXORY","target":"graph","payload":{"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"},"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-18T01:11:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ydjKw83jQBhtybzYzIqI5WxttCERz7HYBItkj7hD1OEv4HgJgssg086b6G/1iAkltFqUoo+ZJv3IPFjxrFzyAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:08:43.124384Z"},"content_sha256":"0f457fb6c60317752dac53c0cf201537152951a1b42be9e7385fc3fbb32307a0","schema_version":"1.0","event_id":"sha256:0f457fb6c60317752dac53c0cf201537152951a1b42be9e7385fc3fbb32307a0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JLMBJ5N7ID6IAMVDRDBT2DXORY/bundle.json","state_url":"https://pith.science/pith/JLMBJ5N7ID6IAMVDRDBT2DXORY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JLMBJ5N7ID6IAMVDRDBT2DXORY/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-05-31T02:08:43Z","links":{"resolver":"https://pith.science/pith/JLMBJ5N7ID6IAMVDRDBT2DXORY","bundle":"https://pith.science/pith/JLMBJ5N7ID6IAMVDRDBT2DXORY/bundle.json","state":"https://pith.science/pith/JLMBJ5N7ID6IAMVDRDBT2DXORY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JLMBJ5N7ID6IAMVDRDBT2DXORY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:JLMBJ5N7ID6IAMVDRDBT2DXORY","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":"665a0d6dba8946ed9e16b98ed99cae10d361dd4489a25c82161d2cbd22723e82","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-04T09:44:12Z","title_canon_sha256":"2806edd0272ddd8b8ced90c66c076a65b461f1a19b617b69442d6e839ab25b0a"},"schema_version":"1.0","source":{"id":"1607.00800","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.00800","created_at":"2026-05-18T01:11:34Z"},{"alias_kind":"arxiv_version","alias_value":"1607.00800v1","created_at":"2026-05-18T01:11:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.00800","created_at":"2026-05-18T01:11:34Z"},{"alias_kind":"pith_short_12","alias_value":"JLMBJ5N7ID6I","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"JLMBJ5N7ID6IAMVD","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"JLMBJ5N7","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:0f457fb6c60317752dac53c0cf201537152951a1b42be9e7385fc3fbb32307a0","target":"graph","created_at":"2026-05-18T01:11:34Z","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 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","authors_text":"Chau Yuen, Chongwen Huang, Lei Liu, Ying Li, Yong Liang Guan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-04T09:44:12Z","title":"Gaussian Message Passing Iterative Detection for MIMO-NOMA Systems with Massive Access"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.00800","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:e6c7cb3eb06af5fd097ce6d60a4c516c9e4240182ab064740269310d758c395c","target":"record","created_at":"2026-05-18T01:11:34Z","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":"665a0d6dba8946ed9e16b98ed99cae10d361dd4489a25c82161d2cbd22723e82","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-04T09:44:12Z","title_canon_sha256":"2806edd0272ddd8b8ced90c66c076a65b461f1a19b617b69442d6e839ab25b0a"},"schema_version":"1.0","source":{"id":"1607.00800","kind":"arxiv","version":1}},"canonical_sha256":"4ad814f5bf40fc8032a388c33d0eee8e33675c0739d401e5534afa966776c676","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4ad814f5bf40fc8032a388c33d0eee8e33675c0739d401e5534afa966776c676","first_computed_at":"2026-05-18T01:11:34.259339Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:34.259339Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hZvXfzUNftT2nKL52BvtRLkB5ag3+mhW2Uo7XXm9E07Rh3+PoPZL/thtFmrGNMnUkI9VYQNQrwMx8kZxJakmCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:34.259740Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.00800","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e6c7cb3eb06af5fd097ce6d60a4c516c9e4240182ab064740269310d758c395c","sha256:0f457fb6c60317752dac53c0cf201537152951a1b42be9e7385fc3fbb32307a0"],"state_sha256":"ccc008d89f3a22a918c765405ff737319e6e0c64f2be7b39d1827edb51dabc4c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WIn7Vjd5IhtjEujSqCaaChFnm+7OaEdyTPRwDtBZHcq8A1Oe7RbTBzaKPYNLcvU9+jGT1YghRM9sEPbzY8K1BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T02:08:43.126425Z","bundle_sha256":"ddcfb6b4b482af42fad6e570c77e95efd6626f7e92a9d17a5bb927c30eb4c418"}}