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: "error probability analysis of noma based diamond relaying network"
  Abstract: Non-orthogonal multiple access (NOMA)-based cooperative relaying systems (CRS) are very promising to overcome spectral inefficiency of conventional cooperative communications. Although NOMA-CRS have great recent attention, almost all studies investigate NOMA-CRS only in terms of capacity and outage probability. Error performances of NOMA-CRS have not been well-studied. In this paper, we analyze error performance of NOMA-based diamond relaying network (NOMA-DRN) with imperfect successive interference canceler (SIC) as a NOMA-CRS scheme. We derive exact bit error probability (BEP) for NOMA-DRN and provide a tight approximated BEP in the closed-form. In addition, high-SNR analysis is conducted to present that NOMA-DRN has an error floor. Moreover, it is proved that NOMA-DRN turns out to be a non-equiprobable communication system and we derive priori probabilities of symbols. All derived expressions are validated via computer simulations.

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)