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: "achievable rate analysis of relay assisted cooperative noma over rician fading channels"
  Abstract: Non-orthogonal multiple access (NOMA) is a key to multiple access techniques for the next generation 5G wireless communication networks. In this paper, to improve the performance gain of NOMA system, a cooperative fixed decode-and-forward (DF) relay system model based on NOMA (CRS-NOMA) is studied over Rician fading channels, considering the achievable rate of signals as the performance metric. In this technique, by exploiting the concept of NOMA, unlike the conventional method of cooperative relaying, the second time slot is also utilized for the realization of information sent from the transmitter end. Moreover, as the data symbols are transmitted by nodes with full power, the compulsion of complex power allocation coefficients is precluded. In conventional cooperative relaying systems, the receiver is only able to receive a single bit of information, while the receiver can reliably bring in two data symbols in two-time slots. In this regard, this scheme is able to acquire higher achievable rate performance than existing cooperative relaying schemes for larger channel powers over most of the transmit SNR regime. Furthermore, a mathematical expression is also derived for the total achievable rate of CRS-NOMA. The results are verified through Monte-Carlo simulations which validate accuracy and consistency of the derived analytical results.

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)