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 "convergence and density evolution of a low complexity mimo detector based on forward backward recursion over a ring"):
  Abstract: Convergence and density evolution of a low com- plexity, iterative MIMO detection based on belief propagation (BP) over a ring-type pair-wise graph are presented in this paper. The detection algorithm to be considered is effectively a forward- backward recursion and was originally proposed in (13), where the link level performance and the convergence for Gaussian input were analyzed. Presented here are the convergence proof for discrete alphabet and the density evolution framework for binary input to give an asymptotic performance in terms of average SINR and bit error rate (BER) without channel coding. The BER curve obtained via density evolution shows a good match with simulation results, verifying the effectiveness of the density evolution analysis and the performance of the detection algorithm. Index Terms—MIMO detection, Belief propagation, Density evolution, Pair-wise graphs, Forward-backward recursion.

Includes members:
  Member "belief propagation based decoding of large non orthogonal stbcs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "low complexity detection in large dimension mimo isi channels using graphical models")
  Member "mimo decoding based on stochastic reconstruction from multiple projections":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "low complexity mimo detection based on belief propagation over pair wise graphs")
  Member "gaussian belief propagation based multiuser detection":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "fixed symbol aided random access scheme for machine to machine communications")
  Member "belief propagation based multi user detection":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "capacity achieving mimo noma iterative lmmse detection")

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)