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: "belief propagation based decoding of large non orthogonal stbcs"
  Abstract: In this paper, we present a belief propagation (BP) based algorithm for decoding non-orthogonal space-time block codes (STBC) from cyclic division algebras (CDA) having {\em large dimensions}. The proposed approach involves message passing on Markov random field (MRF) representation of the STBC MIMO system. Adoption of BP approach to decode non-orthogonal STBCs of large dimensions has not been reported so far. Our simulation results show that the proposed BP-based decoding achieves increasingly closer to SISO AWGN performance for increased number of dimensions. In addition, it also achieves near-capacity turbo coded BER performance; for e.g., with BP decoding of $24\times 24$ STBC from CDA using BPSK (i.e., 576 real dimensions) and rate-1/2 turbo code (i.e., 12 bps/Hz spectral efficiency), coded BER performance close to within just about 2.5 dB from the theoretical MIMO capacity is achieved.

Connected through hyperedge HE-1 (induced by source paper "convergence and density evolution of a low complexity mimo detector based on forward backward recursion over a ring"):
  with members:
    - "mimo decoding based on stochastic reconstruction from multiple projections"
    - "gaussian belief propagation based multiuser detection"
    - "belief propagation based multi user detection"

Connected through hyperedge HE-2 (induced by source paper "low complexity detection in large dimension mimo isi channels using graphical models"):
  with members:
    - "loopy belief propagation for approximate inference an empirical study"
    - "mimo detection for high order qam based on a gaussian tree approximation"
    - "a hybrid rts bp algorithm for improved detection of large mimo m qam signals"
    - "high rate space time coded large mimo systems low complexity detection and channel estimation"
    - "sufficient conditions for convergence of the sum product algorithm"
    - "improved message passing for inference in densely connected systems"
    - "belief propagation based multi user detection"

Connected through hyperedge HE-3 (induced by source paper "asymptotic analysis of the performance of las algorithm for large mimo detection"):
  with members:
    - "low complexity near ml decoding of large non orthogonal stbcs using reactive tabu search"
    - "high rate space time coded large mimo systems low complexity detection and channel estimation"
    - "large mimo detection a low complexity detector at high spectral efficiencies"
    - "reduced complexity sphere decoding for square qam via a new lattice representation"
    - "belief propagation based multi user detection"

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)