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 for wireless powered communication networks"):
  Abstract: This paper considers a wireless powered communication network (WPCN), where multiple users harvest energy from a dedicated power station and then communicate with an information receiving station. Our goal is to investigate the maximum achievable energy efficiency (EE) of the network via joint time allocation and power control while taking into account the initial battery energy of each user. We first study the EE maximization problem in the WPCN without any system throughput requirement. We show that the EE maximization problem for the WPCN can be cast into EE maximization problems for two simplified networks via exploiting its special structure. For each problem, we derive the optimal solution and provide the corresponding physical interpretation, despite the non-convexity of the problems. Subsequently, we study the EE maximization problem under a minimum system throughput constraint. Exploiting fractional programming theory, we transform the resulting non-convex problem into a standard convex optimization problem. This allows us to characterize the optimal solution structure of joint time allocation and power control and to derive an efficient iterative algorithm for obtaining the optimal solution. Simulation results verify our theoretical findings and demonstrate the effectiveness of the proposed joint time and power optimization.

Includes members:
  Member "cognitive wireless powered network spectrum sharing models and throughput maximization":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "cognitive wireless power transfer in the presence of reactive primary communication user")
  Member "throughput optimization for massive mimo systems powered by wireless energy transfer":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "wirelessly powered sensor networks power allocation for channel estimation and energy beamforming")
  Member "spatial throughput maximization of wireless powered communication networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "transmission delay minimization in wireless powered communication systems")
  Member "harvest then cooperate wireless powered cooperative communications":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "relay selection scheduling and power control in wireless powered cooperative communication networks")
  Member "robust beamforming for secure communication in systems with wireless information and power transfer":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "angle aware user cooperation for secure massive mimo in rician fading channel")
  Member "user cooperation in wireless powered communication networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "learning and fairness in energy harvesting a maximin multi armed bandits approach")
  Member "optimal resource allocation in full duplex wireless powered communication network":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "transmission delay minimization in wireless powered communication systems")
  Member "simultaneous wireless information and power transfer in modern communication systems":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "wirelessly powered sensor networks power allocation for channel estimation and energy beamforming")

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)