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 "wireless networks with energy harvesting and power transfer joint power and time allocation"):
  Abstract: In this letter, we consider wireless powered communication networks which could operate perpetually, as the base station (BS) broadcasts energy to the multiple energy harvesting (EH) information transmitters. These employ “harvest then transmit” mechanism, as they spend all of their energy harvested during the previous BS energy broadcast to transmit the information towards the BS. Assuming time division multiple access (TDMA), we propose a novel transmission scheme for jointly optimal allocation of the BS broadcasting power and time sharing among the wireless nodes, which maximizes the overall network throughput, under the constraint of average transmit power and maximum transmit power at the BS. The proposed scheme significantly outperforms “state of the art” schemes that employ only the optimal time allocation. If a single EH transmitter is considered, we generalize the optimal solutions for the case of fixed circuit power consumption, which refers to a much more practical scenario.

Includes members:
  Member "harvest then cooperate wireless powered cooperative communications":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "relay selection scheduling and power control in wireless powered cooperative communication networks")
  Member "optimal resource allocation in full duplex wireless powered communication network":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "transmission delay minimization in wireless powered communication systems")
  Member "performance analysis of wireless powered communication with finite infinite energy storage":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "performance of energy buffer aided incremental relaying in cooperative networks")
  Member "throughput maximization in wireless powered communication networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on maximizing information reliability in wireless powered cooperative networks")
  Member "cooperative energy harvesting networks with spatially random users":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a unified framework for non orthogonal multiple access")
  Member "throughput maximization for an energy harvesting communication system with processing cost":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "online policies for throughput maximization of energy constrained wireless powered communication systems")
  Member "optimal energy allocation for wireless communications with energy harvesting constraints":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "optimal energy allocation and task offloading policy for wireless powered mobile edge computing systems")
  Member "mimo broadcasting for simultaneous wireless information and power transfer":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "energy efficient hybrid precoding design for integrated multicast unicast millimeter wave communications with swipt")

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)