human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "probabilistic mimo symbol detection with expectation consistency approximate inference"):
  Abstract: In this paper, we explore low-complexity probabilistic algorithms for soft symbol detection in high-dimensional multiple-input multiple-output (MIMO) systems. We present a novel algorithm based on the expectation consistency (EC) framework, which describes the approximate inference problem as an optimization over a nonconvex function. EC generalizes algorithms such as belief propagation and expectation propagation. For the MIMO symbol detection problem, we discuss feasible methods to find stationary points of the EC function and explore their tradeoffs between accuracy and speed of convergence. The accuracy is studied, first in terms of input–output mutual information and show that the proposed EC MIMO detector greatly improves state-of-the-art methods, with a complexity order cubic in the number of transmitting antennas. Second, these gains are corroborated by combining the probabilistic output of the EC detector with a low-density parity-check channel code.

Includes members:
  Member "convergence analysis and assurance for gaussian message passing iterative detector in massive mu mimo systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "generalized approximate message passing for massive mimo mmwave channel estimation with laplacian prior")
  Member "capacity achieving iterative lmmse detection for mimo noma systems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "near capacity detection and decoding code design for dynamic user loads in gaussian multiple access channels")
  Member "gaussian message passing iterative detection for mimo noma systems with massive access":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "generalized approximate message passing for massive mimo mmwave channel estimation with laplacian prior")
  Member "spatially coupled ldpc codes constructed from protographs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "capacity achieving spatially coupled sparse superposition codes with amp decoding")
  Member "optimality of large mimo detection via approximate message passing":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "capacity achieving spatially coupled sparse superposition codes with amp decoding")
  Member "fifty years of mimo detection the road to large scale mimos":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "model driven deep learning for joint mimo channel estimation and signal detection")
  Member "spatially coupled sparse codes on graphs theory and practice":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "finite length scaling of spatially coupled ldpc codes under window decoding over the bec")
  Member "channel hardening exploiting message passing chemp receiver in large scale mimo systems":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "on the pilot contamination attack in multi cell multiuser massive mimo networks")

Question: Please tell me which class the source paper 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)