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: "inference for generalized linear models via alternating directions and bethe free energy minimization"
  Abstract: Generalized Linear Models (GLMs), where a random vector $\mathbf{x}$ is observed through a noisy, possibly nonlinear, function of a linear transform $\mathbf{z}=\mathbf{Ax}$ arise in a range of applications in nonlinear filtering and regression. Approximate Message Passing (AMP) methods, based on loopy belief propagation, are a promising class of approaches for approximate inference in these models. AMP methods are computationally simple, general, and admit precise analyses with testable conditions for optimality for large i.i.d. transforms $\mathbf{A}$. However, the algorithms can easily diverge for general $\mathbf{A}$. This paper presents a convergent approach to the generalized AMP (GAMP) algorithm based on direct minimization of a large-system limit approximation of the Bethe Free Energy (LSL-BFE). The proposed method uses a double-loop procedure, where the outer loop successively linearizes the LSL-BFE and the inner loop minimizes the linearized LSL-BFE using the Alternating Direction Method of Multipliers (ADMM). The proposed method, called ADMM-GAMP, is similar in structure to the original GAMP method, but with an additional least-squares minimization. It is shown that for strictly convex, smooth penalties, ADMM-GAMP is guaranteed to converge to a local minima of the LSL-BFE, thus providing a convergent alternative to GAMP that is stable under arbitrary transforms. Simulations are also presented that demonstrate the robustness of the method for non-convex penalties as well.

Connected through hyperedge HE-1 (induced by source paper "an approximate message passing framework for side information"):
  with members:
    - "an analysis of state evolution for approximate message passing with side information"
    - "plug in estimation in high dimensional linear inverse problems a rigorous analysis"
    - "finite sample analysis of approximate message passing algorithms"
    - "state evolution for approximate message passing with non separable functions"
    - "rapid fading due to human blockage in pedestrian crowds at 5g millimeter wave frequencies"
    - "mutual information and optimality of approximate message passing in random linear estimation"
    - "the replica symmetric prediction for compressed sensing with gaussian matrices is exact"
    - "optimal trade offs in multi processor approximate message passing"

Connected through hyperedge HE-2 (induced by source paper "asymptotics of map inference in deep networks"):
  with members:
    - "entropy and mutual information in models of deep neural networks"
    - "amp inspired deep networks for sparse linear inverse problems"
    - "rigorous dynamics of expectation propagation based signal recovery from unitarily invariant measurements"
    - "multi layer generalized linear estimation"
    - "additivity of information in multilayer networks via additive gaussian noise transforms"
    - "inference in deep networks in high dimensions"
    - "global guarantees for enforcing deep generative priors by empirical risk"
    - "semantic image inpainting with deep generative models"

Connected through hyperedge HE-3 (induced by source paper "an online plug and play algorithm for regularized image reconstruction"):
  with members:
    - "regularization by denoising clarifications and new interpretations"
    - "plug in estimation in high dimensional linear inverse problems a rigorous analysis"
    - "convolutional dictionary learning a comparative review and new algorithms"
    - "learning proximal operators using denoising networks for regularizing inverse imaging problems"
    - "trainable nonlinear reaction diffusion a flexible framework for fast and effective image restoration"
    - "learning deep cnn denoiser prior for image restoration"
    - "seagle sparsity driven image reconstruction under multiple scattering"
    - "online convolutional dictionary learning for multimodal imaging"

Connected through hyperedge HE-4 (induced by source paper "an overview of multi processor approximate message passing"):
  with members:
    - "finite sample analysis of approximate message passing algorithms"
    - "multiprocessor approximate message passing with column wise partitioning"
    - "hybrid approximate message passing"
    - "statistical physics and information theory perspectives on linear inverse problems"
    - "approximate message passing algorithm with universal denoising and gaussian mixture learning"
    - "optimal trade offs in multi processor approximate message passing"
    - "phase transitions and sample complexity in bayes optimal matrix factorization"
    - "performance trade offs in multi processor approximate message passing"

Connected through hyperedge HE-5 (induced by source paper "inference in deep networks in high dimensions"):
  with members:
    - "multi layer generalized linear estimation"
    - "hybrid approximate message passing"
    - "generalized expectation consistent signal recovery for nonlinear measurements"
    - "the replica symmetric prediction for compressed sensing with gaussian matrices is exact"
    - "learning and free energies for vector approximate message passing"
    - "the mutual information in random linear estimation"
    - "inferring sparsity compressed sensing using generalized restricted boltzmann machines"
    - "vector approximate message passing for the generalized linear model"

Connected through hyperedge HE-6 (induced by source paper "a gamp based low complexity sparse bayesian learning algorithm"):
  with members:
    - "type i and type ii bayesian methods for sparse signal recovery using scale mixtures"
    - "adaptive damping and mean removal for the generalized approximate message passing algorithm"
    - "fixed points of generalized approximate message passing with arbitrary matrices"
    - "efficient high dimensional inference in the multiple measurement vector problem"
    - "expectation maximization gaussian mixture approximate message passing"
    - "the dynamics of message passing on dense graphs with applications to compressed sensing"
    - "generalized approximate message passing for estimation with random linear mixing"
    - "message passing algorithms for compressed sensing i motivation and construction"

Connected through hyperedge HE-7 (induced by source paper "analysis of regularized ls reconstruction and random matrix ensembles in compressed sensing"):
  with members:
    - "isotropically random orthogonal matrices performance of lasso and minimum conic singular values"
    - "on the performance of turbo signal recovery with partial dft sensing matrices"
    - "s amp approximate message passing for general matrix ensembles"
    - "signal recovery using expectation consistent approximation for linear observations"
    - "on sparse vector recovery performance in structurally orthogonal matrices via lasso"
    - "asymptotic mmse analysis under sparse representation modeling"
    - "statistical mechanics approach to sparse noise denoising"
    - "support recovery with sparsely sampled free random matrices"

Connected through hyperedge HE-8 (induced by source paper "learning and free energies for vector approximate message passing"):
  with members:
    - "hybrid approximate message passing"
    - "the replica symmetric prediction for compressed sensing with gaussian matrices is exact"
    - "expectation consistent approximate inference generalizations and convergence"
    - "the mutual information in random linear estimation"
    - "adaptive damping and mean removal for the generalized approximate message passing algorithm"
    - "compressive phase retrieval via generalized approximate message passing"
    - "binary linear classification and feature selection via generalized approximate message passing"
    - "an empirical bayes approach to recovering linearly constrained non negative sparse signals"

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)