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 "antenna selection in mimo non orthogonal multiple access systems"):
  Abstract: This paper considers the joint antenna selection (AS) problem for a classical two-user MIMO non-orthogonal multiple access (NOMA) system, where both the base station (BS) and users (UEs) are equipped with multiple antennas. Specifically, several computationally-efficient AS algorithms are developed for two commonly-used NOMA scenarios: fixed power allocation NOMA (F-NOMA) and cognitive radio-inspired NOMA (CR-NOMA). For the F-NOMA system, two novel AS schemes, namely max-max-max AS (A$^3$-AS) and max-min-max AS (AIA-AS), are proposed to maximize the system sum-rate, without and with the consideration of user fairness, respectively. In the CR-NOMA network, a novel AS algorithm, termed maximum-channel-gain-based AS (MCG-AS), is proposed to maximize the achievable rate of the secondary user, under the condition that the primary user's quality of service requirement is satisfied. The asymptotic closed-form expressions of the average sum-rate for A$^3$-AS and AIA-AS and that of the average rate of the secondary user for MCG-AS are derived, respectively. Numerical results demonstrate that the AIA-AS provides better user-fairness, while the A$^3$-AS achieves a near-optimal sum-rate in F-NOMA systems. For the CR-NOMA scenario, MCG-AS achieves a near-optimal performance in a wide SNR regime. Furthermore, all the proposed AS algorithms yield a significant computational complexity reduction, compared to exhaustive search-based counterparts.

Includes members:
  Member "non orthogonal multiple access in large scale heterogeneous networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "mimo noma networks relying on reconfigurable intelligent surface a signal cancellation based design")
  Member "joint rate control and power allocation for non orthogonal multiple access systems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "distributed cluster formation and power bandwidth allocation for imperfect noma in dl hetnets")
  Member "nonorthogonal multiple access in large scale underlay cognitive radio networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "resource allocation for irs assisted full duplex cognitive radio systems")
  Member "antenna selection for mimo noma networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "antenna selection in full duplex cooperative noma systems")
  Member "a survey of downlink non orthogonal multiple access for 5g wireless communication networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "random access for massive machine type communications")
  Member "optimal joint power and subcarrier allocation for full duplex multicarrier non orthogonal multiple access systems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "joint trajectory and resource allocation design for energy efficient secure uav communication systems")
  Member "the application of mimo to non orthogonal multiple access":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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-8 (induced by source paper "resource allocation technique for hybrid tdma noma system with opportunistic time assignment")

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)