{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:FJC6XXN5UBAEVNXWMXLQ6JKTBE","short_pith_number":"pith:FJC6XXN5","canonical_record":{"source":{"id":"1810.10745","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-25T07:31:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7dcd06c0eda5ecfeb7e455820d86fe14ede6bedba4d5b737e386691987651fc3","abstract_canon_sha256":"9063265f3ab50b785f3af2759b452a8ed8bdc2edfc3f06a00a1d63e36e078766"},"schema_version":"1.0"},"canonical_sha256":"2a45ebddbda0404ab6f665d70f2553092d0414640cb49f291a7d37d81dd2eb0f","source":{"kind":"arxiv","id":"1810.10745","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.10745","created_at":"2026-05-18T00:02:19Z"},{"alias_kind":"arxiv_version","alias_value":"1810.10745v1","created_at":"2026-05-18T00:02:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.10745","created_at":"2026-05-18T00:02:19Z"},{"alias_kind":"pith_short_12","alias_value":"FJC6XXN5UBAE","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"FJC6XXN5UBAEVNXW","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"FJC6XXN5","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:FJC6XXN5UBAEVNXWMXLQ6JKTBE","target":"record","payload":{"canonical_record":{"source":{"id":"1810.10745","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-25T07:31:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7dcd06c0eda5ecfeb7e455820d86fe14ede6bedba4d5b737e386691987651fc3","abstract_canon_sha256":"9063265f3ab50b785f3af2759b452a8ed8bdc2edfc3f06a00a1d63e36e078766"},"schema_version":"1.0"},"canonical_sha256":"2a45ebddbda0404ab6f665d70f2553092d0414640cb49f291a7d37d81dd2eb0f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:19.775590Z","signature_b64":"NfL1D5ByAyMD/45Ozvo8F8G+sltQ7X8meR6ZAU5AqHSJaNTOwYQYNeYnOGuiCRR+ncRBSjrEJ76gjl0k4KEBCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a45ebddbda0404ab6f665d70f2553092d0414640cb49f291a7d37d81dd2eb0f","last_reissued_at":"2026-05-18T00:02:19.775224Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:19.775224Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.10745","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:02:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4CymbiEGDz2SoUBik+gSEOi/RE9iQM63aRkrkXiSjLNLUUNsBMbFkdvnGoUTIa9c4PoTaRFTN1JudX00wh/yAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:19:40.366532Z"},"content_sha256":"55eb5efb2e767f98f6aac641a8d997aa78289478d6132eff055a581621d6657b","schema_version":"1.0","event_id":"sha256:55eb5efb2e767f98f6aac641a8d997aa78289478d6132eff055a581621d6657b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:FJC6XXN5UBAEVNXWMXLQ6JKTBE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Gaussian Message Passing for Overloaded Massive MIMO-NOMA","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":"2018-10-25T07:31:58Z","abstract_excerpt":"This paper considers a low-complexity Gaussian Message Passing (GMP) scheme for a coded massive Multiple-Input Multiple-Output (MIMO) systems with Non-Orthogonal Multiple Access (massive MIMO-NOMA), in which a base station with $N_s$ antennas serves $N_u$ sources simultaneously in the same frequency. Both $N_u$ and $N_s$ are large numbers, and we consider the overloaded cases with $N_u>N_s$. The GMP for MIMO-NOMA is a message passing algorithm operating on a fully-connected loopy factor graph, which is well understood to fail to converge due to the correlation problem. In this paper, we utiliz"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.10745","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:02:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mu/St/+qUSdiFajRGgHti0Vy+MyFG9LNuUIngXkmCZD6sd+TifDCsv+V9PgsApmePbTZssGTxldWkQ8zR8qrDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:19:40.366878Z"},"content_sha256":"ea3ca76cd03ab6fda4102f329fe391aba10162ac87ef26e08ee4453172d42e9b","schema_version":"1.0","event_id":"sha256:ea3ca76cd03ab6fda4102f329fe391aba10162ac87ef26e08ee4453172d42e9b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FJC6XXN5UBAEVNXWMXLQ6JKTBE/bundle.json","state_url":"https://pith.science/pith/FJC6XXN5UBAEVNXWMXLQ6JKTBE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FJC6XXN5UBAEVNXWMXLQ6JKTBE/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-31T03:19:40Z","links":{"resolver":"https://pith.science/pith/FJC6XXN5UBAEVNXWMXLQ6JKTBE","bundle":"https://pith.science/pith/FJC6XXN5UBAEVNXWMXLQ6JKTBE/bundle.json","state":"https://pith.science/pith/FJC6XXN5UBAEVNXWMXLQ6JKTBE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FJC6XXN5UBAEVNXWMXLQ6JKTBE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:FJC6XXN5UBAEVNXWMXLQ6JKTBE","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":"9063265f3ab50b785f3af2759b452a8ed8bdc2edfc3f06a00a1d63e36e078766","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-25T07:31:58Z","title_canon_sha256":"7dcd06c0eda5ecfeb7e455820d86fe14ede6bedba4d5b737e386691987651fc3"},"schema_version":"1.0","source":{"id":"1810.10745","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.10745","created_at":"2026-05-18T00:02:19Z"},{"alias_kind":"arxiv_version","alias_value":"1810.10745v1","created_at":"2026-05-18T00:02:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.10745","created_at":"2026-05-18T00:02:19Z"},{"alias_kind":"pith_short_12","alias_value":"FJC6XXN5UBAE","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"FJC6XXN5UBAEVNXW","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"FJC6XXN5","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:ea3ca76cd03ab6fda4102f329fe391aba10162ac87ef26e08ee4453172d42e9b","target":"graph","created_at":"2026-05-18T00:02:19Z","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 (GMP) scheme for a coded massive Multiple-Input Multiple-Output (MIMO) systems with Non-Orthogonal Multiple Access (massive MIMO-NOMA), in which a base station with $N_s$ antennas serves $N_u$ sources simultaneously in the same frequency. Both $N_u$ and $N_s$ are large numbers, and we consider the overloaded cases with $N_u>N_s$. The GMP for MIMO-NOMA is a message passing algorithm operating on a fully-connected loopy factor graph, which is well understood to fail to converge due to the correlation problem. In this paper, we utiliz","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":"2018-10-25T07:31:58Z","title":"Gaussian Message Passing for Overloaded Massive MIMO-NOMA"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.10745","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:55eb5efb2e767f98f6aac641a8d997aa78289478d6132eff055a581621d6657b","target":"record","created_at":"2026-05-18T00:02:19Z","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":"9063265f3ab50b785f3af2759b452a8ed8bdc2edfc3f06a00a1d63e36e078766","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-25T07:31:58Z","title_canon_sha256":"7dcd06c0eda5ecfeb7e455820d86fe14ede6bedba4d5b737e386691987651fc3"},"schema_version":"1.0","source":{"id":"1810.10745","kind":"arxiv","version":1}},"canonical_sha256":"2a45ebddbda0404ab6f665d70f2553092d0414640cb49f291a7d37d81dd2eb0f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2a45ebddbda0404ab6f665d70f2553092d0414640cb49f291a7d37d81dd2eb0f","first_computed_at":"2026-05-18T00:02:19.775224Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:19.775224Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NfL1D5ByAyMD/45Ozvo8F8G+sltQ7X8meR6ZAU5AqHSJaNTOwYQYNeYnOGuiCRR+ncRBSjrEJ76gjl0k4KEBCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:19.775590Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.10745","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:55eb5efb2e767f98f6aac641a8d997aa78289478d6132eff055a581621d6657b","sha256:ea3ca76cd03ab6fda4102f329fe391aba10162ac87ef26e08ee4453172d42e9b"],"state_sha256":"e41594b5758371d8a19f115656806549b7544526ca8ae187dbeb0aeae40cc9da"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A+MbT0MQyaCDR3Ah0DMxxPqrF2sR/AalvP026mwBo3gjPFuJuT3E+o2QriHNN4krkPVH4Zb1lLE3DZg9JDYXDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T03:19:40.368819Z","bundle_sha256":"6340a20f6187b9df6996f7a63e70f9f8db277241a618bab94073bc55c81de508"}}