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 "a low complexity algorithm for throughput maximization in wireless powered communication networks"):
  Abstract: This paper investigates a wireless powered communication network (WPCN) under the protocol of harvest-then-transmit,where a hybrid access point with constant power supply replenishes the passive user nodes by wireless power transfer in the downlink,then each user node transmit independent information to the hybrid AP in a time division multiple access (TDMA) scheme in the uplink.The sum-throughput maximization and min-throughput maximization problems are considered in this paper.The optimal time allocation for the sum-throughput maximization is proposed based on the Jensen's inequality,which provides more insight into the design of WPCNs.A low-complexity fixed-point iteration algorithm for the min-throughput maximization problem,which promises a much better computation complexity than the state-of-the-art algorithm.Simulation results confirm the effectiveness of the proposed algorithm.

Includes members:
  Member "joint beamforming design and time allocation for wireless powered communication networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "wirelessly powered sensor networks power allocation for channel estimation and energy beamforming")
  Member "throughput maximization in wireless powered communication networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on maximizing information reliability in wireless powered cooperative networks")
  Member "cognitive energy harvesting and transmission from a network perspective":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on energy cooperation in energy harvesting underlay cognitive radio network")
  Member "framework for link level energy efficiency optimization with informed transmitter":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "distributed power control with partial channel state information performance characterization and design")
  Member "mimo broadcasting for simultaneous wireless information and power transfer":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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)