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: "a stochastic geometry based approach to modeling interference correlation in cooperative relay networks"
  Abstract: Future wireless networks are expected to be a convergence of many diverse network technologies and architectures, such as cellular networks, wireless local area networks, sensor networks, and device to device communications. Through cooperation between dissimilar wireless devices, this new combined network topology promises to unlock ever larger data rates and provide truly ubiquitous coverage for end users, as well as enabling higher spectral efficiency. However, it also increases the risk of co-channel interference and introduces the possibility of correlation in the aggregated interference that not only impacts the communication performance, but also makes the associated mathematical analysis much more complex. To address this problem and evaluate the communication performance of cooperative relay networks, we adopt a stochastic geometry based approach by assuming that the interfering nodes are randomly distributed according to a Poisson point process (PPP). We also use a random medium access protocol to counteract the effects of interference correlation. Using this approach, we derive novel closed-form expressions for the successful transmission probability and local delay of a relay network with correlated interference. As well as this, we find the optimal transmission probability $p$ that jointly maximizes the successful transmission probability and minimizes the local delay. Finally numerical results are provided to confirm that the proposed joint optimization strategy achieves a significant performance gain compared to a conventional scheme.

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)