{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:B55MGB26Q6VDRNN2KHMGJYZ7YG","short_pith_number":"pith:B55MGB26","canonical_record":{"source":{"id":"1602.07423","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-24T07:32:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ef0cb689211b5c31aca2d6589fbcf2a5a90a54096125d9eb030282dcdfbaf6db","abstract_canon_sha256":"e416e079c08b8f49442ba9b27270a0d7b9be3db4bba6c73d1929d2eac9c931fa"},"schema_version":"1.0"},"canonical_sha256":"0f7ac3075e87aa38b5ba51d864e33fc1815958d8bc4ad65ef4560da207a6582f","source":{"kind":"arxiv","id":"1602.07423","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.07423","created_at":"2026-05-18T00:58:09Z"},{"alias_kind":"arxiv_version","alias_value":"1602.07423v1","created_at":"2026-05-18T00:58:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.07423","created_at":"2026-05-18T00:58:09Z"},{"alias_kind":"pith_short_12","alias_value":"B55MGB26Q6VD","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"B55MGB26Q6VDRNN2","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"B55MGB26","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:B55MGB26Q6VDRNN2KHMGJYZ7YG","target":"record","payload":{"canonical_record":{"source":{"id":"1602.07423","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-24T07:32:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ef0cb689211b5c31aca2d6589fbcf2a5a90a54096125d9eb030282dcdfbaf6db","abstract_canon_sha256":"e416e079c08b8f49442ba9b27270a0d7b9be3db4bba6c73d1929d2eac9c931fa"},"schema_version":"1.0"},"canonical_sha256":"0f7ac3075e87aa38b5ba51d864e33fc1815958d8bc4ad65ef4560da207a6582f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:09.641115Z","signature_b64":"rVWPl7cBieDKf/7OmW9XDSpS/xV3cougKWl0xjgeI6zDAEyNVviehanRWqYe0+KpzxXbUggfO1ULErzL50KuBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f7ac3075e87aa38b5ba51d864e33fc1815958d8bc4ad65ef4560da207a6582f","last_reissued_at":"2026-05-18T00:58:09.640437Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:09.640437Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.07423","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":"FfWWDFBVJ2bDRn/CId5UDkt0aYGJHFIpzpZfdcbga0jJilQvfaLtDOjKCc1MmOeQrS9mXE6ttpj3cHPLDfdjDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T10:38:50.734657Z"},"content_sha256":"140c6fb66e2f73eeb388589d470371d08928aabc197fb9e1e49265d811256bf7","schema_version":"1.0","event_id":"sha256:140c6fb66e2f73eeb388589d470371d08928aabc197fb9e1e49265d811256bf7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:B55MGB26Q6VDRNN2KHMGJYZ7YG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Capacity-Achieving Iterative LMMSE Detection for MIMO-NOMA 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","submitted_at":"2016-02-24T07:32:19Z","abstract_excerpt":"This paper considers a iterative Linear Minimum Mean Square Error (LMMSE) detection for the uplink Multiuser Multiple-Input and Multiple-Output (MU-MIMO) systems with Non-Orthogonal Multiple Access (NOMA). The iterative LMMSE detection greatly reduces the system computational complexity by departing the overall processing into many low-complexity distributed calculations. However, it is generally considered to be sub-optimal and achieves relatively poor performance. In this paper, we firstly present the matching conditions and area theorems for the iterative detection of the MIMO-NOMA systems."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.07423","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":"63Ic0s8TRBR1o5xlVSXLBcHJC7eYNWetHSDPTLXycFOYJ+0lMSpVY5mTWSOfjluCt5IYhVAlz7s2TEhhbcp5Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T10:38:50.735002Z"},"content_sha256":"5daae7521cbbe77cb42db26cca027e5c4ecb3303c55e480ceb4651e58f7f26e6","schema_version":"1.0","event_id":"sha256:5daae7521cbbe77cb42db26cca027e5c4ecb3303c55e480ceb4651e58f7f26e6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B55MGB26Q6VDRNN2KHMGJYZ7YG/bundle.json","state_url":"https://pith.science/pith/B55MGB26Q6VDRNN2KHMGJYZ7YG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B55MGB26Q6VDRNN2KHMGJYZ7YG/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:38:50Z","links":{"resolver":"https://pith.science/pith/B55MGB26Q6VDRNN2KHMGJYZ7YG","bundle":"https://pith.science/pith/B55MGB26Q6VDRNN2KHMGJYZ7YG/bundle.json","state":"https://pith.science/pith/B55MGB26Q6VDRNN2KHMGJYZ7YG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B55MGB26Q6VDRNN2KHMGJYZ7YG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:B55MGB26Q6VDRNN2KHMGJYZ7YG","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":"e416e079c08b8f49442ba9b27270a0d7b9be3db4bba6c73d1929d2eac9c931fa","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-24T07:32:19Z","title_canon_sha256":"ef0cb689211b5c31aca2d6589fbcf2a5a90a54096125d9eb030282dcdfbaf6db"},"schema_version":"1.0","source":{"id":"1602.07423","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.07423","created_at":"2026-05-18T00:58:09Z"},{"alias_kind":"arxiv_version","alias_value":"1602.07423v1","created_at":"2026-05-18T00:58:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.07423","created_at":"2026-05-18T00:58:09Z"},{"alias_kind":"pith_short_12","alias_value":"B55MGB26Q6VD","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"B55MGB26Q6VDRNN2","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"B55MGB26","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:5daae7521cbbe77cb42db26cca027e5c4ecb3303c55e480ceb4651e58f7f26e6","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 iterative Linear Minimum Mean Square Error (LMMSE) detection for the uplink Multiuser Multiple-Input and Multiple-Output (MU-MIMO) systems with Non-Orthogonal Multiple Access (NOMA). The iterative LMMSE detection greatly reduces the system computational complexity by departing the overall processing into many low-complexity distributed calculations. However, it is generally considered to be sub-optimal and achieves relatively poor performance. In this paper, we firstly present the matching conditions and area theorems for the iterative detection of the MIMO-NOMA systems.","authors_text":"Chau Yuen, 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-02-24T07:32:19Z","title":"Capacity-Achieving Iterative LMMSE Detection for MIMO-NOMA Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.07423","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:140c6fb66e2f73eeb388589d470371d08928aabc197fb9e1e49265d811256bf7","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":"e416e079c08b8f49442ba9b27270a0d7b9be3db4bba6c73d1929d2eac9c931fa","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-24T07:32:19Z","title_canon_sha256":"ef0cb689211b5c31aca2d6589fbcf2a5a90a54096125d9eb030282dcdfbaf6db"},"schema_version":"1.0","source":{"id":"1602.07423","kind":"arxiv","version":1}},"canonical_sha256":"0f7ac3075e87aa38b5ba51d864e33fc1815958d8bc4ad65ef4560da207a6582f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0f7ac3075e87aa38b5ba51d864e33fc1815958d8bc4ad65ef4560da207a6582f","first_computed_at":"2026-05-18T00:58:09.640437Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:09.640437Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rVWPl7cBieDKf/7OmW9XDSpS/xV3cougKWl0xjgeI6zDAEyNVviehanRWqYe0+KpzxXbUggfO1ULErzL50KuBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:09.641115Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.07423","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:140c6fb66e2f73eeb388589d470371d08928aabc197fb9e1e49265d811256bf7","sha256:5daae7521cbbe77cb42db26cca027e5c4ecb3303c55e480ceb4651e58f7f26e6"],"state_sha256":"5ff5deadd7b9bbde2379992c1afc97635a830b3864c8f6d84462bc9c93bf0d54"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5YRiKK8MbbV7npi683+YpLlTjo/Y1rq4UZv8+TKGZAgxJwpR9qsRAVOGZhK7UA/VQoCjk91iJrozpd7vHYzYDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T10:38:50.737720Z","bundle_sha256":"7e2a709a546b6969bb0bad563639e80316321cfd6a11f02637d0b6eb7d0255cc"}}