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: "a unified bayesian inference framework for generalized linear models"
  Abstract: In this letter, we present a unified Bayesian inference framework for generalized linear models (GLM), which iteratively reduces the GLM problem to a sequence of standard linear model (SLM) problems. This framework provides new perspectives on some established GLM algorithms derived from SLM ones and also suggests novel extensions for some other SLM algorithms. Specific instances elucidated under such framework are the GLM versions of approximate message passing (AMP), vector AMP, and sparse Bayesian learning. It is proved that the resultant GLM version of AMP is equivalent to the well-known generalized approximate message passing. Numerical results for one-bit quantized compressed sensing demonstrate the effectiveness of this unified framework.

Connected through hyperedge HE-1 (induced by source paper "a new insight into gamp and amp"):
  with members:
    - "capacity achieving mimo noma iterative lmmse detection"
    - "capacity optimality of amp in coded systems"
    - "bilinear adaptive generalized vector approximate message passing"
    - "gaussian message passing for overloaded massive mimo noma"
    - "massive connectivity with massive mimo part i device activity detection and channel estimation"
    - "beam on graph simultaneous channel estimation for mmwave mimo systems with multiple users"
    - "rigorous dynamics of expectation propagation based signal recovery from unitarily invariant measurements"
    - "hybrid approximate message passing"

Connected through hyperedge HE-2 (induced by source paper "expectation propagation line spectral estimation"):
  with members:
    - "bilinear adaptive generalized vector approximate message passing"
    - "sparse methods for direction of arrival estimation"
    - "multi snapshot newtonized orthogonal matching pursuit for line spectrum estimation with multiple measurement vectors"
    - "an iterative receiver for ofdm with sparsity based parametric channel estimation"
    - "variational bayesian inference of line spectra"
    - "newtonized orthogonal matching pursuit frequency estimation over the continuum"
    - "off the grid line spectrum denoising and estimation with multiple measurement vectors"
    - "robust spectral compressed sensing via structured matrix completion"

Connected through hyperedge HE-3 (induced by source paper "matrix completion from quantized samples via generalized sparse bayesian learning"):
  with members:
    - "fast low rank bayesian matrix completion with hierarchical gaussian prior models"
    - "millimeter wave channel estimation via exploiting joint sparse and low rank structures"
    - "bayes optimal joint channel and data estimation for massive mimo with low precision adcs"
    - "low rank tensor decomposition aided channel estimation for millimeter wave mimo ofdm systems"
    - "channel estimation in broadband millimeter wave mimo systems with few bit adcs"
    - "categorical matrix completion"
    - "matrix completion from a few entries"
    - "exact matrix completion via convex optimization"

Connected through hyperedge HE-4 (induced by source paper "grid less variational bayesian inference of line spectral from quantized samples"):
  with members:
    - "variational bayesian inference of line spectral estimation with multiple measurement vectors"
    - "bilinear adaptive generalized vector approximate message passing"
    - "sparse methods for direction of arrival estimation"
    - "newtonized orthogonal matching pursuit for line spectrum estimation with multiple measurement vectors"
    - "hybrid approximate message passing"
    - "variational bayesian inference of line spectra"
    - "newtonized orthogonal matching pursuit frequency estimation over the continuum"
    - "vector approximate message passing for the generalized linear model"

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)