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 performance of noma based cooperative relaying systems over rician fading channels"):
  Abstract: Non-orthogonal multiple access (NOMA) is a promising technique for the fifth generation (5G) wireless communications. As users with good channel conditions can serve as relays to enhance the system performance by using successive interference cancellation (SIC), the integration of NOMA and cooperative relaying has recently attracted increasing interests. In this paper, a NOMA-based cooperative relaying system is studied, and an analytical framework is developed to evaluate its performance. Specifically, the performance of NOMA over Rician fading channels is studied, and the exact expression of the average achievable rate is derived. Moreover, we also propose an approximation method to calculate the achievable rate by using the Gauss-Chebyshev Integration. Numerical results confirm that our derived analytical results match well with the Monte Carlo simulations.

Includes members:
  Member "optimal joint power and subcarrier allocation for full duplex multicarrier non orthogonal multiple access systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "joint trajectory and resource allocation design for energy efficient secure uav communication systems")
  Member "capacity achieving iterative lmmse detection for mimo noma systems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "near capacity detection and decoding code design for dynamic user loads in gaussian multiple access channels")
  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 "on the capacity of decode and forward relaying over rician fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a comprehensive performance evaluation of a df based multi hop system over alpha kappa mu and alpha kappa mu extreme fading channels")
  Member "five disruptive technology directions for 5g":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "deep learning enabled optimization of downlink beamforming under per antenna power constraints algorithms and experimental demonstration")

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)