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: "on the performance of cooperative noma using mrc at road intersections in the presence of interference"
  Abstract: As the traffic safety has become of utmost importance, much attention is given to intelligent transportation systems (ITSs), and more particularly to vehicular communications (VCs). Moreover, 50 % of all crashes happen at road intersections, which makes theme a critical areas. In this paper, we investigate the improvement when implementing maximum ratio combining (MRC) in cooperative VCs transmission schemes using non-orthogonal multiple access scheme (NOMA) at road intersections. We consider that a source transmits a message to two destinations with a aid of a relay. The transmission undergoes interference generated from a set of vehicles on the roads. We obtained closed form outage probability expressions, and we extend the derivation for a scenario involving K destination nodes and several road lanes. The performance of MRC cooperative NOMA is compared with the standard cooperative NOMA, and we show that implementing MRC with NOMA offers a significant improvement over the standard cooperative NOMA. Also, we compare the performance of MRC using NOMA with MRC cooperative orthogonal multiple access (OMA), and demonstrate that NOMA significantly outperforms OMA. We conclude that it is always beneficial to use MRC and NOMA even at the cost of implementation complexity. Finally, we demonstrate that the outage probability increases drasticallyen the vehicles are closer to the road intersection, and that using MRC with NOMA improves significantly the performance in this context. To verify the correctness of our analysis, extensive Monte-Carlo simulations are carried out.

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)