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 user pairing in noma uplink"):
  Abstract: User pairing in Non-Orthogonal Multiple-Access (NOMA) uplink based on channel state information is investigated considering some predefined power allocation schemes. The base station divides the set of users into disjunct pairs and assigns the available resources to these pairs. The combinatorial problem of user pairing to achieve the maximum sum rate is analyzed in the large system limit for various scenarios, and some optimum and sub-optimum algorithms with a polynomial-time complexity are proposed. In the first scenario, $2M$ users and the base station have a single-antenna and communicate over $M$ subcarriers. The performance of optimum pairing is derived for $M\rightarrow \infty$ and shown to be superior to random pairing and orthogonal multiple access techniques. In the second setting, a novel NOMA scheme for a multi-antenna base station and single carrier communication is proposed. In this case, the users need not be aware of the pairing strategy. Furthermore, the proposed NOMA scheme is generalized to multi-antenna users. It is shown that random and optimum user pairing perform similarly in the large system limit, but optimum pairing is significantly better in finite dimensions. It is shown that the proposed NOMA scheme outperforms a previously proposed NOMA scheme with signal alignment.

Includes members:
  Member "an optimization perspective of the superiority of noma compared to conventional oma":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "capacity and optimal resource allocation for irs assisted multi user communication systems")
  Member "non orthogonal multiple access noma in cellular uplink and downlink challenges and enabling techniques":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the performance of non orthogonal multiple access in the finite blocklength regime")
  Member "design of massive mimo noma with limited feedback":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "interplay between noma and other emerging technologies a survey")
  Member "optimal joint power and subcarrier allocation for mc noma systems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "non orthogonal multiple access noma how it meets 5g and beyond")
  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 "the application of mimo to non orthogonal multiple access":
    also connected through other hyperedges:
      - Hyperedge HE-6 (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-7 (induced by source paper "resource allocation technique for hybrid tdma noma system with opportunistic time assignment")
  Member "a general mimo framework for noma downlink and uplink transmission based on signal alignment":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "mimo noma networks relying on reconfigurable intelligent surface a signal cancellation based design")

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)