{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:2ABGRWIP2DFVWPST7F2RZL2UQ4","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":"a3dfae9823779a79f241f844e3400038144cf1b5e45a5cedc2c01a868b508316","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-07-18T10:20:11Z","title_canon_sha256":"7f83e06e62b5fd943ae764353ff1cc1411b248deb3c95869f55de90452914a6d"},"schema_version":"1.0","source":{"id":"1807.06846","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.06846","created_at":"2026-05-18T00:10:25Z"},{"alias_kind":"arxiv_version","alias_value":"1807.06846v1","created_at":"2026-05-18T00:10:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.06846","created_at":"2026-05-18T00:10:25Z"},{"alias_kind":"pith_short_12","alias_value":"2ABGRWIP2DFV","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"2ABGRWIP2DFVWPST","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"2ABGRWIP","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:a8441e968befa3c89c342fa730ca50afda85f2b820140660bad072a77ec8d073","target":"graph","created_at":"2026-05-18T00:10:25Z","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":"MIMO-NOMA combines Multiple-Input Multiple-Output (MIMO) and Non-Orthogonal Multiple Access (NOMA), which can address heterogeneous challenges, such as massive connectivity, low latency, and high reliability. In this paper, a practical coded MIMO-NOMA system with capacityapproaching performance as well as low implementation complexity is proposed. Specifically, the employed receiver consists of a multi-user Linear Minimum Mean-Square Error (LMMSE) detector and a bank of single-user message-passing decoders, which decompose the overall signal recovery into distributed low-complexity calculation","authors_text":"Chau Yuen, Guanghui Song, Lei Liu, Ying Li, Yong Liang Guan, Yuhao Chi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-07-18T10:20:11Z","title":"Practical MIMO-NOMA: Low Complexity & Capacity-Approaching Solution"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.06846","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:3d01842be578fc1b585071b0bf4e1f570581e86580ed0f0c46ed3a1dee3eefd4","target":"record","created_at":"2026-05-18T00:10:25Z","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":"a3dfae9823779a79f241f844e3400038144cf1b5e45a5cedc2c01a868b508316","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-07-18T10:20:11Z","title_canon_sha256":"7f83e06e62b5fd943ae764353ff1cc1411b248deb3c95869f55de90452914a6d"},"schema_version":"1.0","source":{"id":"1807.06846","kind":"arxiv","version":1}},"canonical_sha256":"d00268d90fd0cb5b3e53f9751caf548717bd95546339a4807d0e98c57852f995","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d00268d90fd0cb5b3e53f9751caf548717bd95546339a4807d0e98c57852f995","first_computed_at":"2026-05-18T00:10:25.553801Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:25.553801Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"p2oZwKbtRJ6090DU+S3Ctz9xQRHLPqkMZL6hdh7Q6+kgKmXFZmg0s1NkoNUph2DAggSNny5Wg2CZ5GOXoqKCBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:25.554350Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.06846","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3d01842be578fc1b585071b0bf4e1f570581e86580ed0f0c46ed3a1dee3eefd4","sha256:a8441e968befa3c89c342fa730ca50afda85f2b820140660bad072a77ec8d073"],"state_sha256":"ab0610bfadb8c1014644a8e3f13fef8a966cd36025fe2f55967f7218eaa334b0"}