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: "improved message passing for inference in densely connected systems"
  Abstract: An improved inference method for densely connected systems is presented. The approach is based on passing condensed messages between variables, representing macroscopic averages of microscopic messages. We extend previous work that showed promising results in cases where the solution space is contiguous to cases where fragmentation occurs. We apply the method to the signal detection problem of Code Division Multiple Access (CDMA) for demonstrating its potential. A highly efficient practical algorithm is also derived on the basis of insight gained from the analysis. © EDP Sciences.

Connected through hyperedge HE-1 (induced by source paper "capacity optimality of amp in coded systems"):
  with members:
    - "capacity achieving mimo noma iterative lmmse detection"
    - "a unified framework of state evolution for message passing algorithms"
    - "optimal data detection in large mimo"
    - "near gaussian multiple access channel capacity detection and decoding"
    - "approximate message passing decoder and capacity achieving sparse superposition codes"
    - "capacity achieving sparse superposition codes via approximate message passing decoding"
    - "mutual information and optimality of approximate message passing in random linear estimation"
    - "compressive phase retrieval via generalized approximate message passing"

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"
    - "belief propagation based decoding of large non orthogonal stbcs"
    - "high rate space time coded large mimo systems low complexity detection and channel estimation"
    - "sufficient conditions for convergence of the sum product algorithm"
    - "belief propagation based multi user detection"

Connected through hyperedge HE-3 (induced by source paper "the dynamics of message passing on dense graphs with applications to compressed sensing"):
  with members:
    - "asymptotic analysis of map estimation via the replica method and applications to compressed sensing"
    - "optimally tuned iterative reconstruction algorithms for compressed sensing"
    - "a typical reconstruction limit of compressed sensing based on lp norm minimization"
    - "message passing algorithms for compressed sensing i motivation and construction"
    - "message passing algorithms for compressed sensing"
    - "analysis of belief propagation for non linear problems the example of cdma or how to prove tanaka s formula"
    - "randomly spread cdma asymptotics via statistical physics"

Connected through hyperedge HE-4 (induced by source paper "generalized approximate message passing for estimation with random linear mixing"):
  with members:
    - "message passing de quantization with applications to compressed sensing"
    - "asymptotic analysis of map estimation via the replica method and applications to compressed sensing"
    - "compressed sensing over ell_p balls minimax mean square error"
    - "a message passing receiver for bicm ofdm over unknown clustered sparse channels"
    - "the dynamics of message passing on dense graphs with applications to compressed sensing"
    - "compressive imaging using approximate message passing and a markov tree prior"
    - "belief propagation methods for intercell interference coordination"
    - "estimation with random linear mixing belief propagation and compressed sensing"

Connected through hyperedge HE-5 (induced by source paper "estimation with random linear mixing belief propagation and compressed sensing"):
  with members:
    - "asymptotic analysis of map estimation via the replica method and applications to compressed sensing"
    - "the dynamics of message passing on dense graphs with applications to compressed sensing"
    - "a typical reconstruction limit of compressed sensing based on lp norm minimization"
    - "message passing algorithms for compressed sensing"
    - "bayesian compressive sensing via belief propagation"
    - "low density lattice codes"
    - "analysis of belief propagation for non linear problems the example of cdma or how to prove tanaka s formula"
    - "randomly spread cdma asymptotics via statistical physics"

Connected through hyperedge HE-6 (induced by source paper "mimo detection for high order qam based on a gaussian tree approximation"):
  with members:
    - "loopy belief propagation for approximate inference an empirical study"
    - "the equivalence of semidefinite relaxation mimo detectors for higher order qam"
    - "gaussian belief propagation based multiuser detection"
    - "belief propagation based multi user detection"

Connected through hyperedge HE-7 (induced by source paper "message passing algorithms for compressed sensing i motivation and construction"):
  with members:
    - "asymptotic analysis of map estimation via the replica method and applications to compressed sensing"
    - "optimally tuned iterative reconstruction algorithms for compressed sensing"
    - "a typical reconstruction limit of compressed sensing based on lp norm minimization"
    - "message passing algorithms for compressed sensing"
    - "message passing algorithms for compressed sensing ii analysis and validation"
    - "bayesian compressive sensing via belief propagation"
    - "combining geometry and combinatorics a unified approach to sparse signal recovery"

Connected through hyperedge HE-8 (induced by source paper "statistical mechanical analysis of the kronecker channel model for multiple input multiple output wireless communication"):
  with members:
    - "an efficient cdma decoder for correlated information sources"
    - "vector precoding for wireless mimo systems and its replica analysis"
    - "statistical mechanical analysis of the linear vector channel in digital communication"
    - "analysis of cdma systems that are characterized by eigenvalue spectrum"
    - "randomly spread cdma asymptotics via statistical physics"

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)