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 "an energy efficient controller for wirelessly powered communication networks"):
  Abstract: In a wirelessly-powered communication network (WPCN), an energy access point (E-AP) supplies the energy needs of the network nodes through radio frequency wave transmission, and the nodes store their received energy in their batteries for possible data transmission. In this paper, we propose an online control policy for energy transfer from the E-AP to the wireless nodes and for data transfer among the nodes. With our proposed control policy, all data queues of the nodes are stable, while the average energy consumption of the network is shown to be within a bounded gap of the minimum energy required for stabilizing the network. Our proposed policy is designed using a quadratic Lyapunov function to capture the limitations on the energy consumption of the nodes imposed by their battery levels. We show that under the proposed control policy, the backlog level in the data queues and the stored energy level in the batteries fluctuate in small intervals around some constant levels. Consequently, by imposing negligible average data drop rate, the data buffer size and the battery capacity of the nodes can be significantly reduced.

Includes members:
  Member "swipt using hybrid arq over time varying channels":
    also connected through other hyperedges:
      (none)
  Member "optimal and near optimal policies for wireless power transfer in energy limited and power limited scenarios":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "efficient fair and qos aware policies for wirelessly powered communication networks")
  Member "joint sum rate and error probability optimization finite blocklength analysis":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "saddlepoint approximations for short packet wireless communications")
  Member "joint transfer of energy and information in a two hop relay channel":
    also connected through other hyperedges:
      (none)
  Member "optimal energy and data routing in networks with energy cooperation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "energy efficient secrecy in wireless networks based on random jamming")
  Member "battery powered devices in wpcns":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "online policies for throughput maximization of energy constrained wireless powered communication systems")
  Member "wireless powered relaying with finite block length codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "rate control for wireless powered communication network with reliability and delay constraints")
  Member "on wireless energy and information transfer in relay networks":
    also connected through other hyperedges:
      (none)

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)