human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "energy efficient resource allocation in wireless networks"):
  Abstract: This paper shows that game theory can be used as a unifying framework to study radio resource management in a variety of wireless networks. with different service criteria. It focuses on infrastructure networks where users transmit to a common concentration point such as a base station in a cellular network or an access point. Since most of the terminals in a wireless network are battery-powered, energy efficiency is crucial to prolonging the life of the terminals. Also, in most practical scenarios, distributed algorithms are preferred over centralized ones. Throughout this article it focuses on distributed algorithms with emphasis on energy efficiency. A family of power control games is presented for energy-efficient resource allocation in wireless code-division multiple-access (CDMA) networks and give discussions and conclusions

Includes members:
  Member "energy efficient resource allocation in wireless networks with quality of service constraints":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "energy efficient resource allocation optimization for multimedia heterogeneous cloud radio access networks")
  Member "a game theoretic approach to energy efficient modulation in cdma networks with delay qos constraints":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "energy aware competitive power allocation for heterogeneous networks under qos constraints")
  Member "a non cooperative power control game in delay constrained multiple access networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a game theoretic approach to energy efficient modulation in cdma networks with delay qos constraints")

Question: Please tell me which class the source paper 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)