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 "battery powered devices in wpcns"):
  Abstract: Wireless powered communication networks are becoming an effective solution for improving self sustainability of mobile devices. In this context, a hybrid access point transfers energy to a group of nodes, which use the harvested energy to perform computation or transmission tasks. While the availability of the wireless energy transfer mechanism opens up new frontiers, an appropriate choice of the network parameters (e.g., transmission powers, transmission duration, amount of transferred energy, etc.) is required in order to achieve high performance. In this work, we study the throughput optimization problem in a system composed of an access point which recharges the batteries of two devices at different distances. In the literature, the main focus so far has been on slot-oriented optimization, in which all the harvested energy is used in the same slot in which it is harvested. However, this approach is strongly sub-optimal because it does not exploit the possibility to store the energy and use it at a later time. Thus, instead of considering the slot-oriented case, we address the long-term maximization. This assumption greatly increases the optimization complexity, requiring to consider, e.g., the channel state realizations, its statistics and the batteries evolution. Our objective is to find the best scheduling scheme, both for the energy transferred by the access point and for the data sent by the two nodes. We discuss how to perform the maximization with optimal as well as approximate techniques and show that the slot-oriented policies proposed so far are strongly sub-optimal in the long run.

Includes members:
  Member "optimal energy and data routing in networks with energy cooperation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "an energy efficient controller for wirelessly powered communication networks")
  Member "wireless power meets energy harvesting a joint energy allocation approach in ofdm based system":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "optimal energy allocation and task offloading policy for wireless powered mobile edge computing systems")
  Member "decentralized transmission policies for energy harvesting devices":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a decentralized optimization framework for energy harvesting devices")
  Member "on the effects of battery imperfections in an energy harvesting device":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "rf energy harvesting sensor networks for healthcare of animals opportunities and challenges")
  Member "achievable secrecy rates of an energy harvesting device":
    also connected through other hyperedges:
      (none)
  Member "wireless powered communication opportunities and challenges":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "wirelessly powered sensor networks power allocation for channel estimation and energy beamforming")
  Member "optimal adaptive random multiaccess in energy harvesting wireless sensor networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "game theory for multi access edge computing survey use cases and future trends")
  Member "energy harvesting wireless communications a review of recent advances":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "analysis of d2d communication with rf energy harvesting and interference management")

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)