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 "vector approximate message passing for the generalized linear model"):
  Abstract: The generalized linear model (GLM), where a random vector $\boldsymbol{x}$ is observed through a noisy, possibly nonlinear, function of a linear transform output $\boldsymbol{z}=\boldsymbol{Ax}$, arises in a range of applications such as robust regression, binary classification, quantized compressed sensing, phase retrieval, photon-limited imaging, and inference from neural spike trains. When $\boldsymbol{A}$ is large and i.i.d. Gaussian, the generalized approximate message passing (GAMP) algorithm is an efficient means of MAP or marginal inference, and its performance can be rigorously characterized by a scalar state evolution. For general $\boldsymbol{A}$, though, GAMP can misbehave. Damping and sequential-updating help to robustify GAMP, but their effects are limited. Recently, a "vector AMP" (VAMP) algorithm was proposed for additive white Gaussian noise channels. VAMP extends AMP's guarantees from i.i.d. Gaussian $\boldsymbol{A}$ to the larger class of rotationally invariant $\boldsymbol{A}$. In this paper, we show how VAMP can be extended to the GLM. Numerical experiments show that the proposed GLM-VAMP is much more robust to ill-conditioning in $\boldsymbol{A}$ than damped GAMP.

Includes members:
  Member "hybrid approximate message passing":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "bilinear recovery using adaptive vector amp")
  Member "expectation consistent approximate inference generalizations and convergence":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "inference in multi layer networks with matrix valued unknowns")
  Member "a survey of stochastic simulation and optimization methods in signal processing":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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-4 (induced by source paper "inference with deep generative priors in high dimensions")
  Member "denoising based vector approximate message passing":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "plug and play methods for magnetic resonance imaging")
  Member "adaptive damping and mean removal for the generalized approximate message passing algorithm":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "bilinear recovery using adaptive vector amp")
  Member "compressive phase retrieval via generalized approximate message passing":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "capacity achieving spatially coupled sparse superposition codes with amp decoding")
  Member "s amp approximate message passing for general matrix ensembles":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "inference in multi layer networks with matrix valued unknowns")

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)