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 "finite horizon throughput maximization for a wirelessly powered device over a time varying channel"):
  Abstract: In this work, we consider an energy harvesting device (EHD) served by an access point with a single antenna that is used for both wireless power transfer (WPT) and data transfer. The objective is to maximize the expected throughput of the EHD over a finite horizon when the channel state information is only available causally. The EHD is energized by WPT for a certain duration, which is subject to optimization, and then, EHD transmits its information bits to the AP until the end of the time horizon by employing optimal dynamic power allocation. The joint optimization problem is modeled as a dynamic programming problem. Based on the characteristic of the problem, we prove that a time dependent threshold type structure exists for the optimal WPT duration, and we obtain closed form solution to the dynamic power allocation in the uplink period.

Includes members:
  Member "finite horizon throughput maximization and sensing optimization in wireless powered devices over fading channels":
    also connected through other hyperedges:
      (none)
  Member "non orthogonal multiple access schemes in wireless powered communication networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "joint energy and sinr coverage in spatially clustered rf powered iot network")
  Member "battery powered devices in wpcns":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "online policies for throughput maximization of energy constrained wireless powered communication systems")
  Member "energy efficient resource allocation for wireless powered communication networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "common throughput maximization for uav enabled interference channel with wireless powered communications")
  Member "optimal resource allocation in full duplex wireless powered communication network":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "transmission delay minimization in wireless powered communication systems")
  Member "wireless networks with rf energy harvesting a contemporary survey":
    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 "throughput maximization in wireless powered communication networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on maximizing information reliability in wireless powered cooperative networks")
  Member "energy efficient scheduling of delay constrained traffic over fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on optimizing power allocation for reliable communication over fading channels with uninformed transmitter")

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.PF(Performance)