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 "gaussian belief propagation for solving systems of linear equations theory and application"):
  Abstract: The canonical problem of solving a system of linear equations arises in numerous contexts in information theory, communication theory, and related fiel ds. In this contribution, we develop a solution based upon Gaussian belief propagation (GaBP) that does not involve direct matrix inversion. The iterative nature of our approach allows for a distribute d message-passing implementation of the solution algorithm. We address the properties of the GaBP solver, including convergence, exactness, computational complexity, message-passing efficiency and its relation to classical solution methods. We use numerical examples and applications, like linear detection, to illustrate these properties through the use of computer simulations. This empirical study demonstrates the attractiveness (e.g. , faster convergence rate) of the proposed GaBP solver in comparison to conventional linear-algebraic iterative solution methods.

Includes members:
  Member "loopy belief propagation for approximate inference an empirical study":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "analyzing differentiable fuzzy logic operators")
  Member "residual belief propagation informed scheduling for asynchronous message passing":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "nonlinear equation solving a faster alternative to feedforward computation")
  Member "a gaussian belief propagation solver for large scale support vector machines":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "fixing convergence of gaussian belief propagation")
  Member "gaussian belief propagation based multiuser detection":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "fixed symbol aided random access scheme for machine to machine communications")
  Member "gaussian belief propagation solver for systems of linear equations":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "distributed convergence verification for gaussian belief propagation")
  Member "analysis of belief propagation for non linear problems the example of cdma or how to prove tanaka s formula":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "understanding phase transitions via mutual information and mmse")
  Member "belief propagation based multi user detection":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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)