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 "virtual user pairing non orthogonal multiple access in downlink coordinated multipoint transmission"):
  Abstract: In this paper, joint transmission coordinated multipoint (JT-CoMP) is exploited by using virtual user pairing non-orthogonal multiple access (VP-NOMA), termed as JT-CoMP VP-NOMA. The technique combines both VP-NOMA for enhancing ergodic sum capacity (ESC) and JT-CoMP for inter-cell interference mitigation. To show the performance gains, ESC of a three-cell scenario is analyzed as a key performance metric. The analytical and simulation results of JT-CoMP VP-NOMA are compared with orthogonal multiple access (OMA), non-orthogonal multiple access (NOMA), and VP-NOMA. It is shown that the proposed JT-CoMP VP-NOMA outperforms the other schemes in the viewpoint of ESC.

Includes members:
  Member "exploiting non orthogonal multiple access in downlink coordinated multipoint transmission with the presence of imperfect channel state information":
    also connected through other hyperedges:
      (none)
  Member "a novel network noma scheme for downlink coordinated three point systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "non orthogonal multiple access with spatial modulation in downlink coordinated multipoint transmission")
  Member "a survey on non orthogonal multiple access for 5g networks research challenges and future trends":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "effective capacity of noma with finite blocklength for low latency communications")

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.NI(Networking and Internet Architecture)