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 "capacity and outage analysis of a dual hop decode and forward relay aided noma scheme"):
  Abstract: Abstract   Non-orthogonal multiple access (NOMA) is regarded as a candidate radio access technique for the next generation wireless networks because of its manifold spectral gains. A two-phase cooperative relaying strategy (CRS) is proposed in this paper by exploiting the concept of both downlink and uplink NOMA (termed as DU-CNOMA). In the proposed protocol, a transmitter considered as a source transmits a NOMA composite signal consisting of two symbols to the destination and relay during the first phase, following the principle of downlink NOMA. In the second phase, the relay forwards the symbol decoded by successive interference cancellation to the destination, whereas the source transmits a new symbol to the destination in parallel with the relay, following the principle of uplink NOMA. The ergodic sum capacity, outage probability, outage sum capacity, and energy efficiency are investigated comprehensively along with analytical derivations, under both perfect and imperfect successive interference cancellation. To inquire more insight into the system outage performance, diversity order for each symbol in the proposed DU-NOMA is also demonstrated. The performance improvement of the proposed DU-CNOMA over the conventional CRS using NOMA is proved through analysis and computer simulation. Furthermore, the correctness of the author's analysis is proved through a strong agreement between simulation and analytical results.

Includes members:
  Member "modeling and analysis of two way relay non orthogonal multiple access systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "interplay between noma and other emerging technologies a survey")
  Member "non orthogonal multiple access for cooperative communications challenges opportunities and trends":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a survey of rate optimal power domain noma schemes for enabling technologies of future wireless networks")
  Member "performance analysis of a hybrid downlink uplink cooperative noma scheme":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "random access for massive machine type communications")
  Member "power domain non orthogonal multiple access noma in 5g systems potentials and challenges":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "mimo noma networks relying on reconfigurable intelligent surface a signal cancellation based design")
  Member "a survey on non orthogonal multiple access for 5g networks research challenges and future trends":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "effective capacity of noma with finite blocklength for low latency communications")
  Member "on the performance of noma based cooperative relaying systems over rician fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "non orthogonal multiple access noma how it meets 5g and beyond")
  Member "outage performance for cooperative noma transmission with an af relay":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "performance analysis of intelligent reflecting surface assisted noma networks")
  Member "dynamic user clustering and power allocation for uplink and downlink non orthogonal multiple access noma systems":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "non orthogonal multiple access with orthogonal time frequency space signal transmission")

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)