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 "fundamental limits of spectrum sharing for noma based cooperative relaying"):
  Abstract: Non-orthogonal multiple access (NOMA) and spectrum sharing (SS) are two emerging multiple access technologies for efficient spectrum utilization in the fifth-generation (5G) wireless communications standard. In this paper, we present a closed-form analysis of the average achievable sum-rate and outage probability for a NOMA-based cooperative relaying system (CRS) in an underlay spectrum sharing scenario. We consider a peak interference constraint, where the interference inflicted by the secondary (unlicensed) network on the primary-user (licensed) receiver (PU-Rx) should be less than a predetermined threshold. We show that the CRS-NOMA outperforms the CRS with conventional orthogonal multiple access (OMA) for large values of peak interference power at the PU-Rx.

Includes members:
  Member "cognitive non orthogonal multiple access with cooperative relaying a new wireless frontier for 5g spectrum sharing":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a survey of rate optimal power domain noma schemes for enabling technologies of future wireless networks")
  Member "on the performance of noma based cooperative relaying systems over rician fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "non orthogonal multiple access noma how it meets 5g and beyond")
  Member "relay selection for cooperative noma":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the performance of cooperative noma using mrc at road intersections in the presence of interference")

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)