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: "an energy based comparison of long hop and short hop routing in mimo networks"
  Abstract: This paper considers the problem of selecting either routes that consist of long hops or routes that consist of short hops in a network of multiple-antenna nodes, where each transmitting node employs spatial multiplexing. This distance-dependent route-selection problem is approached from the viewpoint of energy efficiency, where a route is selected with the objective of minimizing the transmission energy consumed while satisfying a target outage criterion at the final destination. Deterministic line networks and 2-D random networks are considered. It is shown that short-hop routing requires less energy than long-hop routing when (1) the number of hops traversed between the source and destination grows large, (2) the target success probability approaches one, or (3) the number of transmit and/or receive antennas grows large. It is also shown that if both routing strategies are subject to the same delay constraint, long-hop routing requires less energy than short-hop routing as the target success probability approaches one. In addition, a numerical analysis indicates that, given loose outage constraints, only a small number of transmit antennas are needed for short-hop routing to have its maximum advantage over long-hop routing, while given stringent outage constraints, the advantage of short-hop over long-hop routing always increases with additional transmit antennas.

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)