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 "on the fairness performance of noma based wireless powered communication networks"):
  Abstract: The near-far problem causes severe throughput unfairness in wireless powered communication networks (WPCN). In this paper, we exploit non-orthogonal multiple access (NOMA) technology and propose a fairness-aware NOMA-based scheduling scheme to mitigate the near-far effect and to enhance the max-min fairness. Specifically, we sort all users according to their channel conditions and divide them into two groups, the interference group with high channel gains and the noninterference group with low channel gains. The power station (PS) concurrently transmits energy signals with the data transmissions of the users in the interference group. Thus, the users in the noninterference group can harvest more energy and achieve a higher throughput, while the users in the interference group degrade their performance due to the interfering signals from the PS. We then apply order statistic theory to analyze the achievable rates of ordered users, based on which all users are appropriately grouped for NOMA transmission to achieve the max-min fairness of the system. Meanwhile, the optimal number of interfered users that determines the set of users in each group, is derived. Our simulation results validate the significant improvement of both network fairness and throughput via the fairness-aware NOMA-based scheduling scheme.

Includes members:
  Member "fundamentals of wireless information and power transfer from rf energy harvester models to signal and system designs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "design of an miso swipt aided code index modulated multi carrier m dcsk system for e health iot")
  Member "noma based energy efficient wireless powered communications":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "interplay between noma and other emerging technologies a survey")
  Member "spectral and energy efficient wireless powered iot networks noma or tdma":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "noma enhanced terrestrial and aerial iot networks with partial csi")
  Member "non orthogonal multiple access schemes in wireless powered communication networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "joint energy and sinr coverage in spatially clustered rf powered iot network")
  Member "wireless powered communications with non orthogonal multiple access":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "interplay between noma and other emerging technologies a survey")
  Member "wireless powered communication opportunities and challenges":
    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 "wireless networks with rf energy harvesting a contemporary survey":
    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)