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 "performance analysis of noma with fixed gain relaying over nakagami m fading channels"):
  Abstract: This paper studies the application of cooperative techniques for non-orthogonal multiple access (NOMA). More particularly, the fixed gain amplify-and-forward (AF) relaying with NOMA is investigated over Nakagami-   $m$    fading channels. Two scenarios are considered insightfully: 1) the first scenario is that the base station (BS) intends to communicate with multiple users through the assistance of AF relaying, where the direct links are existent between the BS and users and 2) the second scenario is that the AF relaying is inexistent between the BS and users. To characterize the performance of the considered scenarios, new closed-form expressions for both exact and asymptomatic outage probabilities are derived. Based on the analytical results, the diversity orders achieved by the users are obtained. For the first and second scenarios, the diversity order for the    $n$   th user are    $\mu (n+1)$    and    $\mu \text{n}$   , respectively. Simulation results unveil that NOMA is capable of outperforming orthogonal multiple access (OMA) in terms of outage probability and system throughput. It is also worth noting that NOMA can provide better fairness compared with conventional OMA. By comparing the two scenarios, cooperative NOMA scenario can provide better outage performance relative to the second scenario.

Includes members:
  Member "nonorthogonal multiple access in large scale underlay cognitive radio networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "resource allocation for irs assisted full duplex cognitive radio systems")
  Member "modeling and analysis of uplink non orthogonal multiple access noma in large scale cellular networks using poisson cluster processes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "non orthogonal multiple access for 5g and beyond")
  Member "cooperative non orthogonal multiple access with simultaneous wireless information and power transfer":
    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 "fairness for non orthogonal multiple access in 5g systems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "resource allocation technique for hybrid tdma noma system with opportunistic time assignment")
  Member "on the performance of non orthogonal multiple access in 5g systems with randomly deployed users":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "performance analysis of intelligent reflecting surface assisted noma 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)