human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "capacity achieving mimo noma iterative lmmse detection"):
  Abstract: This paper considers a low-complexity iterative  linear minimum mean square error  (LMMSE) multiuser detector for the  multiple-input and multiple-output  system with  nonorthogonal multiple access  (MIMO-NOMA), where multiple single-antenna users simultaneously communicate with a multiple-antenna base station (BS). While LMMSE being a linear detector has a low complexity, it has suboptimal performance in multiuser detection scenario due to the mismatch between LMMSE detection and multiuser decoding. Therefore, in this paper, we provide the matching conditions between the detector and decoders for MIMO-NOMA, which are then used to derive the achievable rate of the iterative detection. We prove that a matched iterative LMMSE detector can achieve the optimal capacity of symmetric MIMO-NOMA with any number of users, the optimal sum capacity of asymmetric MIMO-NOMA with any number of users, all the maximal extreme points in the capacity region of asymmetric MIMO-NOMA with any number of users, and all points in the capacity region of two-user and three-user asymmetric MIMO-NOMA systems. In addition, a kind of practical low-complexity error-correcting multiuser code, called irregular repeat-accumulate code, is designed to match the LMMSE detector. Numerical results shows that the bit error rate performance of the proposed iterative LMMSE detection outperforms the state-of-art methods and is within 0.8 dB from the associated capacity limit.

Includes members:
  Member "near gaussian multiple access channel capacity detection and decoding":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "capacity optimality of amp in coded systems")
  Member "rigorous dynamics of expectation propagation based signal recovery from unitarily invariant measurements":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "inference in multi layer networks with matrix valued unknowns")
  Member "hybrid approximate message passing":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "bilinear recovery using adaptive vector amp")
  Member "gaussian message passing iterative detection for mimo noma systems with massive access":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "generalized approximate message passing for massive mimo mmwave channel estimation with laplacian prior")
  Member "a general mimo framework for noma downlink and uplink transmission based on signal alignment":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "mimo noma networks relying on reconfigurable intelligent surface a signal cancellation based design")
  Member "scaling up mimo opportunities and challenges with very large arrays":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "downlink secrecy rate of one bit massive mimo system with active eavesdropping")
  Member "achievable rates of mimo systems with linear precoding and iterative lmmse detection":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "capacity optimality of amp in coded systems")
  Member "hybrid approximate message passing":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "bilinear recovery using adaptive vector amp")

Question: Please tell me which class the source paper belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.IT(Information Theory)