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: "another look in the analysis of cooperative spectrum sensing over nakagami m fading channels"
  Abstract: Modeling and analysis of cooperative spectrum sensing is an important aspect in cognitive radio systems. In this paper, the problem of energy detection (ED) of an unknown signal over Nakagami-$m$ fading is revisited. Specifically, an analytical expression for the local probability of detection is derived, while using the approach of ED at the individual secondary user (SU), a new fusion rule, based on the likelihood ratio test, is presented. The channels between the primary user to SUs and SUs to fusion center are considered to be independent Nakagami-$m$. The proposed fusion rule uses the channel statistics, instead of the instantaneous channel state information, and is based on the Neyman-Pearson criteria. Closed-form solutions for the system-level probability of detection and probability of false alarm are also derived. Furthermore, a closed-form expression for the optimal number of cooperative SUs, needed to minimize the total error rate, is presented. The usefulness of factor graph and sum-product-algorithm models for computing likelihoods, is also discussed to highlight its advantage, in terms of computational cost. The performance of the proposed schemes have been evaluated both by analysis and simulations. Results show that the proposed rules perform well over a wide range of the signal-to-noise ratio.

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)