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 fairness aware time and power allocation in wireless powered communication networks"):
  Abstract: In this paper, we consider the sum $\alpha$-fair utility maximization problem for joint downlink (DL) and uplink (UL) transmissions of a wireless powered communication network (WPCN) via time and power allocation. In the DL, the users with energy harvesting receiver architecture decode information and harvest energy based on simultaneous wireless information and power transfer. While in the UL, the users utilize the harvested energy for information transmission, and harvest energy when other users transmit UL information. We show that the general sum $\alpha$-fair utility maximization problem can be transformed into an equivalent convex one. Tradeoffs between sum rate and user fairness can be balanced via adjusting the value of $\alpha$. In particular, for zero fairness, i.e., $\alpha=0$, the optimal allocated time for both DL and UL is proportional to the overall available transmission power. Tradeoffs between sum rate and user fairness are presented through simulations.

Includes members:
  Member "wireless networks with energy harvesting and power transfer joint power and time allocation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "sequencing and scheduling for multi user machine type communication")
  Member "adaptively directional wireless power transfer for large scale sensor networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "big data analytics for large scale wireless networks challenges and opportunities")
  Member "wireless powered communication networks an overview":
    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 "artificial noise aided secrecy information and power transfer in ofdma systems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "energy efficiency of distributed antenna systems with wireless power transfer")
  Member "wireless powered communication opportunities and challenges":
    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 "energy harvesting for physical layer security in ofdma networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "secrecy outage of swipt in the presence of cooperating eavesdroppers")
  Member "simultaneous wireless information and power transfer in modern communication systems":
    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 "throughput maximization in wireless powered communication networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "on maximizing information reliability in wireless powered cooperative networks")

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)