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: "information theoretic study on routing path selection in two way relay networks"
  Abstract: Two-way relaying is a promising technique to improve network throughput. However, how to apply it to a wireless network remains an unresolved issue. Particularly, challenges lie in the joint design between the physical layer and the routing protocol. Applying an existing routing protocol to a two-way relay network can easily compromise the advantages of two-way relaying. Considering routing path selection and two-way relaying together can be formulated as a network optimization problem, but it is usually NP-hard. In this paper, we take a different approach to study routing path selection for two-way relay networks. Instead of solving the joint optimization problem, we study the fundamental characteristics of a routing path consisting of multihop two-way relaying nodes. Information theoretical analysis is carried out to derive bandwidth efficiency and energy efficiency of a routing path in a two-way relay network. Such analysis provides a framework of routing path selection by considering bandwidth efficiency, energy efficiency and latency subject to physical layer constraints such as the transmission rate, transmission power, path loss exponent, path length, and the number of relays. This framework provides insightful guidelines on routing protocol design of a two-way relay network. Our analytical framework and insights are illustrated by extensive numerical results.

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)