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 "hybrid approximate message passing"):
  Abstract: Gaussian and quadratic approximations of message passing algorithms on graphs have attracted considerable recent attention due to their computational simplicity, analytic tractability, and wide applicability in optimization and statistical inference problems. This paper presents a systematic framework for incorporating such approximate message passing (AMP) methods in general graphical models. The key concept is a partition of dependencies of a general graphical model into strong and weak edges, with the weak edges representing interactions through aggregates of small, linearizable couplings of variables. AMP approximations based on the Central Limit Theorem can be readily applied to aggregates of many weak edges and integrated with standard message passing updates on the strong edges. The resulting algorithm, which we call hybrid generalized approximate message passing (HyGAMP), can yield significantly simpler implementations of sum-product and max-sum loopy belief propagation. By varying the partition of strong and weak edges, a performance--complexity trade-off can be achieved. Group sparsity and multinomial logistic regression problems are studied as examples of the proposed methodology.

Includes members:
  Member "rigorous dynamics of expectation propagation based signal recovery from unitarily invariant measurements":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "inference in multi layer networks with matrix valued unknowns")
  Member "decoding from pooled data phase transitions of message passing":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "group testing with runlength constraints for topological molecular storage")
  Member "random access in c ran for user activity detection with limited capacity fronthaul":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a dimension reduction based joint activity detection and channel estimation algorithm for massive access")
  Member "the replica symmetric prediction for compressed sensing with gaussian matrices is exact":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "unsourced multiuser sparse regression codes achieve the symmetric mac capacity")
  Member "expectation consistent approximate inference generalizations and convergence":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "inference in multi layer networks with matrix valued unknowns")
  Member "sparse multinomial logistic regression via approximate message passing":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "performance limits with additive error metrics in noisy multimeasurement vector problems")
  Member "a survey of stochastic simulation and optimization methods in signal processing":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "inference with deep generative priors in high dimensions")
  Member "learning and free energies for vector approximate message passing":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "inference with deep generative priors in high dimensions")

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)