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 online transmission policy in wireless powered networks with urgency aware age of information"):
  Abstract: This paper investigates the age of information (AoI) for a radio frequency (RF) energy harvesting (EH) enabled network, where a sensor first scavenges energy from a wireless power station and then transmits the collected status update to a sink node. To capture the thirst for the fresh update becoming more and more urgent as time elapsing, urgency-aware AoI (U-AoI) is defined, which increases exponentially with time between two received updates. Due to EH, some waiting time is required at the sensor before transmitting the status update. To find the optimal transmission policy, an optimization problem is formulated to minimize the long-term average U-AoI under constraint of energy causality. As the problem is non-convex and with no known solution, a two-layer algorithm is presented to solve it, where the outer loop is designed based on Dinklebach's method, and in the inner loop, a semi-closed-form expression of the optimal waiting time policy is derived based on Karush-Kuhn-Tucker (KKT) optimality conditions. Numerical results shows that our proposed optimal transmission policy outperforms the the zero time waiting policy and equal time waiting policy in terms of long-term average U-AoI, especially when the networks are non-congested. It is also observed that in order to achieve the lower U-AoI, the sensor should transmit the next update without waiting when the network is congested while should wait a moment before transmitting the next update when the network is non-congested. Additionally, it also shows that the system U-AoI first decreases and then keep unchanged with the increments of EH circuit's saturation level and the energy outage probability.

Includes members:
  Member "optimal status update for age of information minimization with an energy harvesting source":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "who should google scholar update more often")
  Member "group cooperation with optimal resource allocation in wireless powered communication networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "importance of small probability events in big data information measures applications and challenges")
  Member "uplink age of information of unilaterally powered two way data exchanging systems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "energy harvesting powered sensing in iot timeliness versus distortion")
  Member "waveform design for wireless power transfer":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "wirelessly powered sensor networks power allocation for channel estimation and energy beamforming")
  Member "update or wait how to keep your data fresh":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "who should google scholar update more often")
  Member "simultaneous wireless information and power transfer in modern communication systems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "wirelessly powered sensor networks power allocation for channel estimation and energy beamforming")
  Member "mimo broadcasting for simultaneous wireless information and power transfer":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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)