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 "efficient fair and qos aware policies for wirelessly powered communication networks"):
  Abstract: Wireless power transfer (WPT) is a viable source of energy for wirelessly powered communication networks (WPCNs). In this paper, we first consider WPT from an energy access point (E-AP) to multiple energy receivers (E-Rs) to obtain the optimal policy that maximizes the WPT efficiency. For this purpose, we formulate the problem of maximizing the total average received power of the E-Rs subject to the average and peak power level constraints of the E-AP. The formulated problem is a non-convex stochastic optimization problem. Using some stochastic optimization techniques, we tackle the challenges of this problem and derive a closed-form expression for the optimal solution, which requires the explicit knowledge of the distribution of channel state information (CSI) in the network. We then propose a near-optimal algorithm that does not require any explicit knowledge of the CSI distribution and prove that the proposed algorithm attains a near-optimal solution within a guaranteed gap to the optimal solution. We next consider fairness among the E-Rs and propose a quality of service (QoS) aware fair policy that maximizes a generic network utility function while guaranteeing the required QoS of each E-R. Finally, we study a practical wirelessly powered communication scenario in which the E-Rs utilize their energy harvested through WPT to transmit information to the E-AP. We optimize the received information at the E-AP under its average and peak transmission power constraints and the fairness constraints of the E-Rs. Numerical results show the significant performance of our proposed solutions compared to the state-of-the-art baselines.

Includes members:
  Member "online policies for throughput maximization of energy constrained wireless powered communication systems":
    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 "an energy efficient controller for wirelessly powered communication networks")
  Member "optimal hierarchical radio resource management for hetnets with flexible backhaul":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "parallel stochastic optimization framework for large scale non convex stochastic problems")
  Member "distributed wireless power transfer with energy feedback":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "wirelessly powered sensor networks power allocation for channel estimation and energy beamforming")
  Member "theory and experiment for wireless powered sensor networks how to keep sensors alive":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a type of virtual force based energy hole mitigation strategy for sensor networks")
  Member "battery powered devices in wpcns":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "online policies for throughput maximization of energy constrained wireless powered communication systems")
  Member "capacity of remotely powered communication":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "analog spatial cancellation for tackling the near far problem in wirelessly powered communications")
  Member "wireless powered communication opportunities and challenges":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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)