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: "on energy efficiency in wireless networks a game theoretic approach to cooperation inspired by evolutionary biology"
  Abstract: We develop a game-theoretic framework to investigate the effect of cooperation on the energy efficiency in wireless networks. We address two examples of network architectures, resembling ad-hoc network and network with central infrastructure node. Most present approaches address the issue of energy efficiency in communication networks by using complex algorithms to enforce cooperation in the network, followed by extensive signal processing at the network nodes. Instead, we address cooperative communication scenarios which are governed by simple, evolutionary-like, local rules, and do not require strategic complexity of the network nodes. The approach is motivated by recent results in evolutionary biology which suggest that cooperation can emerge in Nature by evolution, i. e. can be favoured by natural selection, if certain mechanism is at work. As result, we are able to show by experiments that cooperative behavior can indeed emerge and persist in wireless networks, even if the behavior of the individual nodes is driven by selfish decision making. The results from this work indicate that uncomplicated local rules, followed by simple fitness evaluation, can promote cooperation and generate network behavior which yields global energy efficiency in certain wireless networks.

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.NI(Networking and Internet Architecture)