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 "wireless powered communications with non orthogonal multiple access"):
  Abstract: We study a wireless-powered uplink communication system with non-orthogonal multiple access (NOMA), consisting of one base station and multiple energy harvesting users. More specifically, we focus on the individual data rate optimization and fairness improvement and we show that the formulated problems can be optimally and efficiently solved by either linear programming or convex optimization. In the provided analysis, two types of decoding order strategies are considered, namely  fixed decoding order  and  time sharing . Furthermore, we propose an efficient greedy algorithm, which is suitable for the practical implementation of the time-sharing strategy. The simulation results illustrate that the proposed scheme outperforms the baseline orthogonal multiple access scheme. More specifically, it is shown that the NOMA offers a considerable improvement in throughput, fairness, and energy efficiency. Also, the dependence among system throughput, minimum individual data rate, and harvested energy is revealed, as well as an interesting tradeoff between rates and energy efficiency. Finally, the convergence speed of the proposed greedy algorithm is evaluated, and it is shown that the required number of iterations is linear with respect to the number of users.

Includes members:
  Member "throughput analysis and optimization of wireless powered multiple antenna full duplex relay systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "distributed multi user wireless charging power allocation")
  Member "non orthogonal multiple access for visible light communications":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "optical rate splitting multiple access for visible light communications")
  Member "a general mimo framework for noma downlink and uplink transmission based on signal alignment":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "mimo noma networks relying on reconfigurable intelligent surface a signal cancellation based design")
  Member "enhancing wireless information and power transfer by exploiting multi antenna techniques":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "wireless energy beamforming using received signal strength indicator feedback")
  Member "uplink non orthogonal multiple access for 5g wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "non orthogonal multiple access for 5g and beyond")
  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 "power allocation strategies in energy harvesting wireless cooperative networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on maximizing information reliability in wireless powered cooperative networks")
  Member "simultaneous information and energy transfer in large scale networks with without relaying":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "relay selection scheduling and power control in wireless powered cooperative communication 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)