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: "model based compressive sensing"
  Abstract: Compressive sensing (CS) is an alternative to Shannon/Nyquist sampling for the acquisition of sparse or compressible signals that can be well approximated by just K ? N elements from an N -dimensional basis. Instead of taking periodic samples, CS measures inner products with M < N random vectors and then recovers the signal via a sparsity-seeking optimization or greedy algorithm. Standard CS dictates that robust signal recovery is possible from M = O(K log(N/K)) measurements. It is possible to substantially decrease M without sacrificing robustness by leveraging more realistic signal models that go beyond simple sparsity and compressibility by including structural dependencies between the values and locations of the signal coefficients. This paper introduces a model-based CS theory that parallels the conventional theory and provides concrete guidelines on how to create model-based recovery algorithms with provable performance guarantees. A highlight is the introduction of a new class of structured compressible signals along with a new sufficient condition for robust structured compressible signal recovery that we dub the restricted amplification property, which is the natural counterpart to the restricted isometry property of conventional CS. Two examples integrate two relevant signal models-wavelet trees and block sparsity-into two state-of-the-art CS recovery algorithms and prove that they offer robust recovery from just M = O(K) measurements. Extensive numerical simulations demonstrate the validity and applicability of our new theory and algorithms.

Connected through hyperedge HE-1 (induced by source paper "compressed sensing with invertible generative models and dependent noise"):
  with members:
    - "deep compressed sensing"
    - "invertible generative models for inverse problems mitigating representation error and dataset bias"
    - "benchmarking neural network robustness to common corruptions and surface variations"
    - "invertible residual networks"
    - "ffjord free form continuous dynamics for scalable reversible generative models"
    - "global guarantees for enforcing deep generative priors by empirical risk"
    - "density estimation using real nvp"
    - "phase retrieval via wirtinger flow theory and algorithms"

Connected through hyperedge HE-2 (induced by source paper "the importance of phase in complex compressive sensing"):
  with members:
    - "one bit compressed sensing with partial gaussian circulant matrices"
    - "time for dithering fast and quantized random embeddings via the restricted isometry property"
    - "stable recovery of low dimensional cones in hilbert spaces one rip to rule them all"
    - "uniform recovery of fusion frame structured sparse signals"
    - "quantized iterative hard thresholding bridging 1 bit and high resolution quantized compressed sensing"
    - "sparse representation of a polytope and recovery of sparse signals and low rank matrices"
    - "robust 1 bit compressed sensing and sparse logistic regression a convex programming approach"
    - "compressive optical deflectometric tomography a constrained total variation minimization approach"

Connected through hyperedge HE-3 (induced by source paper "channel estimation and hybrid precoding for distributed phased arrays based mimo wireless communications"):
  with members:
    - "modeling and analyzing millimeter wave cellular systems"
    - "framework of channel estimation for hybrid analog and digital processing enabled massive mimo communications"
    - "5g cellular user equipment from theory to practical hardware design"
    - "alternating minimization algorithms for hybrid precoding in millimeter wave mimo systems"
    - "an overview of signal processing techniques for millimeter wave mimo systems"
    - "codebook design for millimeter wave channel estimation with hybrid precoding structure"
    - "the world s first real time testbed for massive mimo design implementation and validation"
    - "an overview of transmission theory and techniques of large scale antenna systems for 5g wireless communications"

Connected through hyperedge HE-4 (induced by source paper "information theoretic lower bounds for compressive sensing with generative models"):
  with members:
    - "an introductory guide to fano s inequality with applications in statistical estimation"
    - "lower bounds for compressed sensing with generative models"
    - "solving inverse problems via auto encoders"
    - "deep decoder concise image representations from untrained non convolutional networks"
    - "the universal approximation power of finite width deep relu networks"
    - "global guarantees for enforcing deep generative priors by empirical risk"
    - "benefits of depth in neural networks"
    - "understanding deep neural networks with rectified linear units"

Connected through hyperedge HE-5 (induced by source paper "algorithmic guarantees for inverse imaging with untrained network priors"):
  with members:
    - "towards moderate overparameterization global convergence guarantees for training shallow neural networks"
    - "deep compressed sensing"
    - "regularizing linear inverse problems with convolutional neural networks"
    - "alternating phase projected gradient descent with generative priors for solving compressive phase retrieval"
    - "one dimensional deep image prior for time series inverse problems"
    - "audio denoising with deep network priors"
    - "deep decoder concise image representations from untrained non convolutional networks"
    - "multilayer convolutional sparse modeling pursuit and dictionary learning"

Connected through hyperedge HE-6 (induced by source paper "dr2 net deep residual reconstruction network for image compressive sensing"):
  with members:
    - "deep fully connected networks for video compressive sensing"
    - "compression artifacts removal using convolutional neural networks"
    - "reconnet non iterative reconstruction of images from compressively sensed random measurements"
    - "deepbinarymask learning a binary mask for video compressive sensing"
    - "a deep learning approach to structured signal recovery"
    - "deep residual learning for image recognition"
    - "batch normalization accelerating deep network training by reducing internal covariate shift"
    - "going deeper with convolutions"

Connected through hyperedge HE-7 (induced by source paper "stochastic iterative hard thresholding for graph structured sparsity optimization"):
  with members:
    - "dual iterative hard thresholding from non convex sparse minimization to non smooth concave maximization"
    - "how to escape saddle points efficiently"
    - "a survey on social media anomaly detection"
    - "unregularized online learning algorithms with general loss functions"
    - "train faster generalize better stability of stochastic gradient descent"
    - "adam a method for stochastic optimization"
    - "approximation algorithms for model based compressive sensing"
    - "on iterative hard thresholding methods for high dimensional m estimation"

Connected through hyperedge HE-8 (induced by source paper "do log factors matter on optimal wavelet approximation and the foundations of compressed sensing"):
  with members:
    - "uniform recovery in infinite dimensional compressed sensing and applications to structured binary sampling"
    - "on oracle type local recovery guarantees in compressed sensing"
    - "robustness to unknown error in sparse regularization"
    - "compressed sensing with local structure uniform recovery guarantees for the sparsity in levels class"
    - "compressed sensing with structured sparsity and structured acquisition"
    - "structure dependent sampling in compressed sensing theoretical guarantees for tight frames"
    - "stable recovery of low dimensional cones in hilbert spaces one rip to rule them all"
    - "on the absence of the rip in real world applications of compressed sensing and the rip in levels"

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)