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: "mse based precoding for mimo downlinks in heterogeneous networks"
  Abstract: Considering a heterogeneous network (HetNet) system consisting of a macro tier overlaid with a second tier of small cells (SCs), this paper studies the mean square error (MSE) based precoding design to be employed by the macro base station and the SC nodes for multiple-input multiple-output (MIMO) downlinks. First, a new sum-MSE of all users based minimization problem is proposed aiming to design a set of macro cell (MC) and SC transmit precoding matrices or vectors. To solve it, two different algorithms are presented. One is via a relaxed-constraints based alternating optimization (RAO) realized by efficient alternating optimization and relaxing non-convex constraints to convex ones. The other is via an unconstrained alternating optimization with normalization (UAON) implemented by introducing the constraints into the iterations with the normalization operation. Second, a separate MSE minimization based precoding is proposed by considering the signal and interference terms corresponding to the macro tier and the SCs separately. Simulation results show that the sum-MSE based RAO algorithm provides the best MSE performance among the proposed schemes under a number of system configurations. When the number of antennas at the macro-BS is sufficiently large, the MSE of the separate MSE-based precoding is found to approach that of RAO and surpass that of UAON. Together, this paper provides a suite of three new precoding techniques that is expected to meet the need in a broad range of HetNet environments with adequate balance between performance and 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)