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: "distributed power control in multiuser mimo networks with optimal linear precoding"
  Abstract: Contractive interference functions introduced by Feyzmahdavian et al. is the newest approach in the analysis and design of distributed power control laws. This approach can be extended to several cases of distributed power control. One of the distributed power control scenarios wherein the contractive interference functions have not been employed is the power control in MIMO systems. In this paper, this scenario will be analyzed. In addition, the optimal linear precoder is employed in each user to achieve maximum point-to-point information rate. In our approach, we use the same amount of signaling as the previous methods did. However, we show that the uniqueness of Nash equilibria is more probable in our approach, suggesting that our proposed method improves the convergence performance of distributed power control in MIMO systems. We also show that the proposed power control algorithm can be implemented asynchronously, which gives a noticeable flexibility to our algorithm given the practical communication limitations.

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)