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: "low complexity mimo detection based on belief propagation over pair wise graphs"
  Abstract: This paper considers belief propagation algorithm over pair-wise graphical models to develop low complexity, iterative multiple-input multiple-output (MIMO) detectors. The pair-wise graphical model is a bipartite graph where a pair of variable nodes are related by an observation node represented by the bivariate Gaussian function obtained by marginalizing the posterior joint probability density under the Gaussian input assumption. Specifically, we consider two types of pair-wise models, the fully connected and ring-type. The pair-wise graphs are sparse, compared to the conventional graphical model in [18], insofar as the number of edges connected to an observation node (edge degree) is only two. Consequently the computations are much easier than those of maximum likelihood (ML) detection, which are similar to the belief propagation (BP) that is run over the fully connected bipartite graph. The link level performance for non-Gaussian input is evaluated via simulations, and the results show the validity of the proposed algorithms. We also customize the algorithm with Gaussian input assumption to obtain the Gaussian BP run over the two pair-wise graphical models and, for the ring-type, we prove its convergence in mean to the linear minimum mean square error (MMSE) estimates. Since the maximum a posterior (MAP) estimator for Gaussian input is equivalent to the linear MMSE estimator, it shows the optimality, in mean, of the scheme for Gaussian input.

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)