human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "full duplex multi antenna relay assisted cooperative non orthogonal multiple access"
  Abstract: We consider a cooperative non-orthogonal multiple access (NOMA) network in which a full-duplex (FD) multi-antenna relay assists transmission from a base station (BS) to a set of far users with poor channel conditions, while at the same time the BS transmits to a set of near users with strong channel conditions. We assume imperfect self-interference (SI) cancellation at the FD relay and imperfect inter-user interference cancellation at the near users. In order to cancel the SI at the relay a zero-forcing based beamforming scheme is used and the corresponding outage probability analysis of two user selection strategies, namely random near user and random far user (RNRF), and nearest near user and nearest far user (NNNF), are derived. Our finding suggests that significant performance improvement can be achieved by using the FD multi-antenna relay compared to the counterpart system with a half-duplex relay. The achieved performance gain depends on network parameters such as the user density, user zones, path loss and the strength of the inter-user interference in case of near users. We also show that the NNNF strategy exhibits a superior outage performance compared to the RNRF strategy, especially in the case of near

Connected through hyperedge HE-1 (induced by source paper "outage analysis of cooperative noma using maximum ratio combining at intersections"):
  with members:
    - "performance analysis of cooperative communications at road intersections using stochastic geometry tools"
    - "power domain non orthogonal multiple access noma in 5g systems potentials and challenges"
    - "non orthogonal multiple access in large scale heterogeneous networks"
    - "modeling and design of millimeter wave networks for highway vehicular communication"
    - "vehicle to vehicle communications with urban intersection path loss models"
    - "relay selection for cooperative noma"
    - "on the performance of non orthogonal multiple access in 5g systems with randomly deployed users"

Connected through hyperedge HE-2 (induced by source paper "capacity analysis for full duplex self backhauled small cells"):
  with members:
    - "exploiting full half duplex user relaying in noma systems"
    - "scheduling and power allocation in self backhauled full duplex small cells"
    - "joint beamforming design and power allocation for full duplex noma cognitive relay systems"
    - "joint backhaul access analysis of full duplex self backhauling heterogeneous networks"
    - "sum rate analysis and optimization of self backhauling based full duplex radio access system"
    - "analysis of massive mimo enabled downlink wireless backhauling for full duplex small cells"
    - "optimal multiuser transmit beamforming a difficult problem with a simple solution structure"
    - "what will 5g be"

Connected through hyperedge HE-3 (induced by source paper "antenna selection in full duplex cooperative noma systems"):
  with members:
    - "exploiting full half duplex user relaying in noma systems"
    - "a survey on non orthogonal multiple access for 5g networks research challenges and future trends"
    - "joint beamforming design and power allocation for full duplex noma cognitive relay systems"
    - "antenna selection for mimo noma networks"
    - "low complexity end to end performance optimization in mimo full duplex relay systems"
    - "experiment driven characterization of full duplex wireless systems"
    - "a quantitative measure of fairness and discrimination for resource allocation in shared computer systems"

Question: Please tell me which class the center node 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)