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: "optimal errors and phase transitions in high dimensional generalized linear models"
  Abstract: Generalized linear models (GLMs) are used in high-dimensional machine learning, statistics, communications, and signal processing. In this paper we analyze GLMs when the data matrix is random, as relevant in problems such as compressed sensing, error-correcting codes, or benchmark models in neural networks. We evaluate the mutual information (or “free entropy”) from which we deduce the Bayes-optimal estimation and generalization errors. Our analysis applies to the high-dimensional limit where both the number of samples and the dimension are large and their ratio is fixed. Nonrigorous predictions for the optimal errors existed for special cases of GLMs, e.g., for the perceptron, in the field of statistical physics based on the so-called replica method. Our present paper rigorously establishes those decades-old conjectures and brings forward their algorithmic interpretation in terms of performance of the generalized approximate message-passing algorithm. Furthermore, we tightly characterize, for many learning problems, regions of parameters for which this algorithm achieves the optimal performance and locate the associated sharp phase transitions separating learnable and nonlearnable regions. We believe that this random version of GLMs can serve as a challenging benchmark for multipurpose algorithms.

Connected through hyperedge HE-1 (induced by source paper "inference in multi layer networks with matrix valued unknowns"):
  with members:
    - "inference with deep generative priors in high dimensions"
    - "asymptotics of map inference in deep networks"
    - "entropy and mutual information in models of deep neural networks"
    - "sunlayer stable denoising with generative networks"
    - "correction by projection denoising images with generative adversarial networks"
    - "task aware compressed sensing with generative adversarial networks"
    - "rigorous dynamics of expectation propagation based signal recovery from unitarily invariant measurements"
    - "deep image prior"

Connected through hyperedge HE-2 (induced by source paper "capacity bounds for communication systems with quantization and spectral constraints"):
  with members:
    - "tradeoff between delay and high snr capacity in quantized mimo systems"
    - "on low resolution adcs in practical 5g millimeter wave massive mimo systems"
    - "on mimo channel capacity with output quantization constraints"
    - "throughput analysis of massive mimo uplink with low resolution adcs"
    - "a general framework for low resolution receivers for mimo channels"
    - "additivity of information in multilayer networks via additive gaussian noise transforms"
    - "generalized expectation consistent signal recovery for nonlinear measurements"
    - "uplink performance of wideband massive mimo with one bit adcs"

Connected through hyperedge HE-3 (induced by source paper "thresholds of descending algorithms in inference problems"):
  with members:
    - "passed spurious descent algorithms and local minima in spiked matrix tensor models"
    - "marvels and pitfalls of the langevin algorithm in noisy high dimensional inference"
    - "no spurious local minima in nonconvex low rank problems a unified geometric analysis"
    - "matrix completion has no spurious local minimum"
    - "message passing algorithms for compressed sensing"

Connected through hyperedge HE-4 (induced by source paper "inference with deep generative priors in high dimensions"):
  with members:
    - "bilinear recovery using adaptive vector amp"
    - "asymptotics of map inference in deep networks"
    - "entropy and mutual information in models of deep neural networks"
    - "inverting deep generative models one layer at a time"
    - "plug in estimation in high dimensional linear inverse problems a rigorous analysis"
    - "finite sample analysis of approximate message passing algorithms"
    - "sunlayer stable denoising with generative networks"
    - "correction by projection denoising images with generative adversarial networks"

Connected through hyperedge HE-5 (induced by source paper "understanding phase transitions via mutual information and mmse"):
  with members:
    - "multi layer generalized linear estimation"
    - "additivity of information in multilayer networks via additive gaussian noise transforms"
    - "generalized expectation consistent signal recovery for nonlinear measurements"
    - "dynamical functional theory for compressed sensing"
    - "phase transitions optimal errors and optimality of message passing in generalized linear models"
    - "the replica symmetric prediction for compressed sensing with gaussian matrices is exact"
    - "expectation consistent approximate inference generalizations and convergence"
    - "a survey of stochastic simulation and optimization methods in signal processing"

Connected through hyperedge HE-6 (induced by source paper "overlap matrix concentration in optimal bayesian inference"):
  with members:
    - "asymptotics of map inference in deep networks"
    - "entropy and mutual information in models of deep neural networks"
    - "mutual information for low rank even order symmetric tensor factorization"
    - "the committee machine computational to statistical gaps in learning a two layers neural network"
    - "rank one matrix estimation analysis of algorithmic and information theoretic limits by the spatial coupling method"
    - "the mutual information in random linear estimation beyond i i d matrices"
    - "adaptive path interpolation for sparse systems application to a simple censored block model"
    - "estimation in the spiked wigner model a short proof of the replica formula"

Connected through hyperedge HE-7 (induced by source paper "concentration of the matrix valued minimum mean square error in optimal bayesian inference"):
  with members:
    - "overlap matrix concentration in optimal bayesian inference"
    - "asymptotics of map inference in deep networks"
    - "entropy and mutual information in models of deep neural networks"
    - "mutual information for low rank even order symmetric tensor factorization"
    - "the committee machine computational to statistical gaps in learning a two layers neural network"
    - "rank one matrix estimation analysis of algorithmic and information theoretic limits by the spatial coupling method"
    - "the mutual information in random linear estimation beyond i i d matrices"
    - "adaptive path interpolation for sparse systems application to a simple censored block model"

Connected through hyperedge HE-8 (induced by source paper "entropy and mutual information in models of deep neural networks"):
  with members:
    - "the stochastic interpolation method a simple scheme to prove replica formulas in bayesian inference"
    - "the layered structure of tensor estimation and its mutual information"
    - "multi layer generalized linear estimation"
    - "additivity of information in multilayer networks via additive gaussian noise transforms"
    - "opening the black box of deep neural networks via information"
    - "inference in deep networks in high dimensions"
    - "estimating mixture entropy with pairwise distances"
    - "the mutual information in random linear estimation"

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)