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 "optimal and near optimal policies for wireless power transfer in energy limited and power limited scenarios"):
  Abstract: Radio frequency wireless power transfer (RF-WPT) is an emerging technology that enables transferring energy from an energy access point (E-AP) to multiple energy receivers (E-Rs), in a wireless manner. In practice, there are some restrictions on the power level or the amount of energy that the E-AP can transfer, which need to be considered in order to determine a proper power transfer policy for the E-AP. In this paper, we formulate the problem of finding the optimal policy for two practical scenarios of powerlimited and energy-limited E-APs. The formulated problems are non-convex stochastic optimization problems that are very challenging to solve. We propose optimal and near-optimal policies for the power transfer of the E-AP to the E-Rs, where the optimal solutions require statistical information of the channel states, while the near-optimal solutions do not require such information and perform well in practice. Furthermore, to ensure fairness among E-Rs, we propose two fair policies, namely Max- Min Fair policy and quality-of-service-aware Proportional Fair policy. MMF policy targets maximizing the minimum received power among the E-Rs, and QPF policy maximizes the total received power of the E-Rs, while guaranteeing the required minimum QoS for each E-R. Various numerical results demonstrate the significant performance of the proposed policies.

Includes members:
  Member "battery powered devices in wpcns":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "online policies for throughput maximization of energy constrained wireless powered communication systems")
  Member "wireless power transfer survey and roadmap":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "efficient fair and qos aware policies for wirelessly powered communication networks")
  Member "distributed energy beamforming with one bit feedback":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "distributed wireless power transfer with energy feedback")
  Member "recent advances in joint wireless energy and information transfer":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "efficient fair and qos aware policies for wirelessly powered communication networks")
  Member "user cooperation in wireless powered communication networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "learning and fairness in energy harvesting a maximin multi armed bandits approach")
  Member "optimal resource allocation in full duplex wireless powered communication network":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "transmission delay minimization in wireless powered communication systems")
  Member "energy beamforming with one bit feedback":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "wirelessly powered sensor networks power allocation for channel estimation and energy beamforming")
  Member "optimized training design for wireless energy transfer":
    also connected through other hyperedges:
      - Hyperedge HE-8 (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)