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 detection in large dimension mimo isi channels using graphical models"
  Abstract: In this paper, we deal with low-complexity near-optimal detection/equalization in large-dimension multiple-input multiple-output inter-symbol interference (MIMO-ISI) channels using message passing on graphical models. A key contribution in the paper is the demonstration that near-optimal performance in MIMO-ISI channels with large dimensions can be achieved at low complexities through simple yet effective simplifications/approximations, although the graphical models that represent MIMO-ISI channels are fully/densely connected (loopy graphs). These include 1) use of Markov random field (MRF)-based graphical model with pairwise interaction, in conjunction with message damping, and 2) use of factor graph (FG)-based graphical model with Gaussian approximation of interference (GAI). The per-symbol complexities are O(K2nt2) and O(Knt) for the MRF and the FG with GAI approaches, respectively, where K and nt denote the number of channel uses per frame, and number of transmit antennas, respectively. These low-complexities are quite attractive for large dimensions, i.e., for large Knt. From a performance perspective, these algorithms are even more interesting in large-dimensions since they achieve increasingly closer to optimum detection performance for increasing Knt. Also, we show that these message passing algorithms can be used in an iterative manner with local neighborhood search algorithms to improve the reliability/performance of M-QAM symbol detection.

Connected through hyperedge HE-1 (induced by source paper "deterministic sampling decoding where sphere decoding meets lattice gaussian distribution"):
  with members:
    - "lattice gaussian sampling by markov chain monte carlo bounded distance decoding and trapdoor sampling"
    - "on the geometric ergodicity of metropolis hastings algorithms for lattice gaussian sampling"
    - "discrete gaussian sampling reduces to cvp and svp"
    - "optimized markov chain monte carlo for signal detection in mimo systems an analysis of the stationary distribution and mixing time"
    - "markov chain monte carlo algorithms for lattice gaussian sampling"
    - "massive mimo for next generation wireless systems"
    - "decoding by embedding correct decoding radius and dmt optimality"
    - "scaling up mimo opportunities and challenges with very large arrays"

Connected through hyperedge HE-2 (induced by source paper "interference cancellation and iterative detection for orthogonal time frequency space modulation"):
  with members:
    - "otfs a new generation of modulation addressing the challenges of 5g"
    - "a simple two stage equalizer with simplified orthogonal time frequency space modulation over rapidly time varying channels"
    - "analysis of discrete time mimo ofdm based orthogonal time frequency space modulation"
    - "low complexity modem structure for ofdm based orthogonal time frequency space modulation"
    - "noncoherent capacity of underspread fading channels"

Connected through hyperedge HE-3 (induced by source paper "unifying message passing algorithms under the framework of constrained bethe free energy minimization"):
  with members:
    - "an iterative receiver for ofdm with sparsity based parametric channel estimation"
    - "hybrid vector perturbation precoding the blessing of approximate message passing"
    - "random access in c ran for user activity detection with limited capacity fronthaul"
    - "a bp mf ep based iterative receiver for joint phase noise estimation equalization and decoding"
    - "gaussian message passing iterative detection for mimo noma systems with massive access"
    - "message passing receiver for joint channel estimation and decoding in 3d massive mimo ofdm systems"
    - "optimality of large mimo detection via approximate message passing"
    - "s amp approximate message passing for general matrix ensembles"

Connected through hyperedge HE-4 (induced by source paper "distributed convergence verification for gaussian belief propagation"):
  with members:
    - "convergence analysis of the information matrix in gaussian belief propagation"
    - "convergence analysis of belief propagation for pairwise linear gaussian models"
    - "distributed hybrid power state estimation under pmu sampling phase errors"
    - "distributed clock skew and offset estimation in wireless sensor networks asynchronous algorithm and convergence analysis"
    - "gaussian belief propagation solver for systems of linear equations"

Connected through hyperedge HE-5 (induced by source paper "a low complexity graph based lmmse receiver for mimo isi channels with m qam modulation"):
  with members:
    - "a low complexity graph based lmmse receiver designed for colored noise induced by ftn signaling"

Connected through hyperedge HE-6 (induced by source paper "fifty years of mimo detection the road to large scale mimos"):
  with members:
    - "large scale mimo detection for 3gpp lte algorithms and fpga implementations"
    - "an esprit based approach for 2 d localization of incoherently distributed sources in massive mimo systems"
    - "massive mimo for next generation wireless systems"
    - "what will 5g be"
    - "approximate bayesian probabilistic data association aided iterative detection for mimo systems using arbitrary m ary modulation"
    - "channel hardening exploiting message passing chemp receiver in large scale mimo systems"
    - "five disruptive technology directions for 5g"
    - "scaling up mimo opportunities and challenges with very large arrays"

Connected through hyperedge HE-7 (induced by source paper "message passing receiver for joint channel estimation and decoding in 3d massive mimo ofdm systems"):
  with members:
    - "pilot beam pattern design for channel estimation in massive mimo systems"
    - "bilinear generalized approximate message passing part i derivation"
    - "massive mimo with optimal power and training duration allocation"
    - "massive mimo for next generation wireless systems"
    - "kronecker product correlation model and limited feedback codebook design in a 3d channel model"
    - "variational free energies for compressed sensing"
    - "low complexity polynomial channel estimation in large scale mimo with arbitrary statistics"
    - "scaling up mimo opportunities and challenges with very large arrays"

Connected through hyperedge HE-8 (induced by source paper "channel hardening exploiting message passing chemp receiver in large scale mimo systems"):
  with members:
    - "scaling up mimo opportunities and challenges with very large arrays"
    - "sumis near optimal soft in soft out mimo detection with low and fixed complexity"
    - "mimo detection for high order qam based on a gaussian tree approximation"
    - "high rate space time coded large mimo systems low complexity detection and channel estimation"

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)