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: "energy harvesting cooperative networks is the max min criterion still diversity optimal"
  Abstract: This paper considers a general energy harvesting cooperative network with M source-destination (SD) pairs and one relay, where the relay schedules only m user pairs for transmissions. For the special case of m = 1, the addressed scheduling problem is equivalent to relay selection for the scenario with one SD pair and M relays. In conventional cooperative networks, the max-min selection criterion has been recognized as a diversity-optimal strategy for relay selection and user scheduling. The main contribution of this paper is to show that the use of the max-min criterion will result in loss of diversity gains in energy harvesting cooperative networks. Particularly when only a single user is scheduled, analytical results are developed to demonstrate that the diversity gain achieved by the max-min criterion is only (M+1)/2, much less than the maximal diversity gain M. The max-min criterion suffers this diversity loss because it does not reflect the fact that the source-relay channels are more important than the relay-destination channels in energy harvesting networks. Motivated by this fact, a few user scheduling approaches tailored to energy harvesting networks are developed and their performance is analyzed. Simulation results are provided to demonstrate the accuracy of the developed analytical results and facilitate the performance comparison.

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)