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: "low complexity hybrid linear tomlinson harashima precoding for downlink large scale mu mimo systems"
  Abstract: In this paper, we propose a novel low-complexity hybrid linear/Tomlinson-Harashima precoder (H-L-THP) for downlink large-scale multiuser multiple-input multiple-output (MU-MIMO) systems. The proposed precoder comprises an inner linear precoder which utilizes only the second order statistics of the channel state information (CSI) and outer THPs which use the instantaneous overall CSI of the cascade of the actual channel and the inner precoder. The user terminals are divided into groups, where for each group a THP successively mitigates the intra-group interference, whereas the inter-group interference is canceled by the inner linear precoder. Our simulation results show that the bit error rate (BER) of the proposed H-L-THP precoder is close to that of the conventional THP precoder, and is substantially lower than the BER of the commonly used regularized zero-forcing (RZF) precoder. Moreover, we derive exact expressions for the computational complexity of the proposed H-L-THP precoder in terms of the required numbers of floating-point operations. These results reveal that the proposed H-L-THP precoder has a much lower computational complexity than the conventional THP and RZF precoders, and is thus an excellent candidate for practical implementations.

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)