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 ssk noma"):
  Abstract: In this paper, we consider the combination between two promising techniques: space-shift keying (SSK) and non-orthogonal multiple access (NOMA) for future radio-access networks. We analyze the performance of SSK-NOMA networks and provide a comprehensive analytical framework of SSK-NOMA regarding bit error probability (BEP), ergodic capacity, and outage probability. It is worth pointing out that all analysis also stand for conventional SIMO-NOMA networks. We derive closed-form exact average BEP (ABEP) expressions when the number of users in a resource block is equal to three (i.e.,   $L=3$  ). Nevertheless, we analyze the ABEP of users when the number of users is more than three, i.e.,   $L\geq 3$  , and derive bit-error-rate (BER) union bound since the error propagation due to iterative successive interference canceler (SIC) makes the exact analysis intractable. Then, we analyze the achievable rate of users and derive exact ergodic capacity of the users, so the ergodic sum rate of the system is in closed forms. Moreover, we provide the average outage probability of the users exactly in the closed form. All derived expressions are validated via Monte Carlo simulations and it is proved that SSK-NOMA outperforms conventional NOMA networks in terms of all performance metrics (i.e., BER, sum rate, outage). Finally, the effect of the power allocation (PA) on the performance of SSK-NOMA networks is investigated, and the optimum PA is discussed under BER and outage constraints.

Includes members:
  Member "derivation of the closed form ber expressions for dl noma over nakagami m fading channels":
    also connected through other hyperedges:
      (none)
  Member "spatial modulation assisted multi antenna non orthogonal multiple access":
    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 "power domain non orthogonal multiple access noma in 5g systems potentials and challenges":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "mimo noma networks relying on reconfigurable intelligent surface a signal cancellation based design")
  Member "a fair power allocation approach to noma in multiuser siso systems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "fundamentals of power allocation strategies for downlink multi user noma with target rates")
  Member "resource allocation for downlink noma systems key techniques and open issues":
    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 "relay selection for cooperative noma":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the performance of cooperative noma using mrc at road intersections in the presence of interference")
  Member "power and channel allocation for non orthogonal multiple access in 5g systems tractability and computation":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "non orthogonal multiple access noma how it meets 5g and beyond")
  Member "non orthogonal multiple access in multi cell networks theory performance and practical challenges":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "interplay between noma and other emerging technologies a survey")

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)