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: "joint tx rx energy efficient scheduling in multi radio networks a divide and conque approach"
  Abstract: Most of the existing works on energy-efficient wireless communication systems only consider the transmitter (Tx) or the receiver (Rx) side power consumption but not both. Moreover, they often assume the static circuit power consumption. To be more practical, this paper considers the joint Tx and Rx power consumption in multiple-access radio networks, where the power model takes both the transmission power and the dynamic circuit power into account. We formulate the joint Tx and Rx energy efficiency (EE) maximization problem which is a combinatorial-type one due to the indicator function for scheduling users and activating radio links. The link EE and the user EE are then introduced which have the similar structure as the system EE. Their hierarchical relationships are exploited to tackle the problem using a divide-and-conquer approach, which is only of linear complexity. We further reveal that the static receiving power plays a critical role in the user scheduling. Finally, comprehensive numerical results are provided to validate the theoretical findings and demonstrate the effectiveness of the proposed algorithm for improving the system EE.

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)