human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "on low complexity full diversity detection in multi user mimo multiple access channels"
  Abstract: Multiple-input multiple-output (MIMO) techniques are becoming commonplace in recent wireless communication standards. This added dimension (i.e., space) can be efficiently used to mitigate the interference in the multi-user MIMO context. In this paper, we focus on the uplink of a MIMO multiple access channel (MAC) where perfect channel state information (CSI) is only available at the destination. We provide a new set of sufficient conditions for a wide range of space-time block codes (STBC)s to achieve full-diversity under \emph{partial interference cancellation group decoding} (PICGD) with or without successive interference cancellation (SIC) for completely blind users. Explicit interference cancellation (IC) schemes for two and three users are then provided and shown to satisfy the derived full-diversity criteria. Besides the complexity reduction due to the fact that the proposed IC schemes enable separate decoding of distinct users without sacrificing the diversity gain, further reduction of the decoding complexity may be obtained. In fact, thanks to the structure of the proposed schemes, the real and imaginary parts of each user's symbols may be decoupled without any loss of performance. Finally, our theoretical claims are corroborated by simulation results and the new IC scheme for two-user MIMO MAC is shown to outperform the recently proposed two-user IC scheme especially for high spectral efficiency while requiring significantly less decoding complexity.

Question: Please tell me which class the center node 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)