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: "off the grid line spectrum denoising and estimation with multiple measurement vectors"
  Abstract: Compressed Sensing suggests that the required number of samples for reconstructing a signal can be greatly reduced if it is sparse in a known discrete basis, yet many real-world signals are sparse in a continuous dictionary. One example is the spectrally-sparse signal, which is composed of a small number of spectral atoms with arbitrary frequencies on the unit interval. In this paper we study the problem of line spectrum denoising and estimation with an ensemble of spectrally-sparse signals composed of the same set of continuous-valued frequencies from their partial and noisy observations. Two approaches are developed based on atomic norm minimization and structured covariance estimation, both of which can be solved efficiently via semidefinite programming. The first approach aims to estimate and denoise the set of signals from their partial and noisy observations via atomic norm minimization, and recover the frequencies via examining the dual polynomial of the convex program. We characterize the optimality condition of the proposed algorithm and derive the expected convergence rate for denoising, demonstrating the benefit of including multiple measurement vectors. The second approach aims to recover the population covariance matrix from the partially observed sample covariance matrix by motivating its low-rank Toeplitz structure without recovering the signal ensemble. Performance guarantee is derived with a finite number of measurement vectors. The frequencies can be recovered via conventional spectrum estimation methods such as MUSIC from the estimated covariance matrix. Finally, numerical examples are provided to validate the favorable performance of the proposed algorithms, with comparisons against several existing approaches.

Connected through hyperedge HE-1 (induced by source paper "approximate support recovery of atomic line spectral estimation a tale of resolution and precision"):
  with members:
    - "atomic norm minimization for modal analysis from random and compressed samples"
    - "super resolution of positive sources the discrete setup"
    - "sparse spikes deconvolution on thin grids"
    - "forward backward greedy algorithms for atomic norm regularization"
    - "exact joint sparse frequency recovery via optimization methods"
    - "near minimax line spectral estimation"
    - "support detection in super resolution"
    - "atomic norm denoising with applications to line spectral estimation"

Connected through hyperedge HE-2 (induced by source paper "recovery analysis of damped spectrally sparse signals and its relation to music"):
  with members:
    - "approximate support recovery of atomic line spectral estimation a tale of resolution and precision"
    - "atomic norm denoising for complex exponentials with unknown waveform modulations"
    - "atomic norm minimization for modal analysis from random and compressed samples"
    - "robust spectral compressed sensing via structured matrix completion"
    - "exact matrix completion via convex optimization"

Connected through hyperedge HE-3 (induced by source paper "low rank matrix completion a contemporary survey"):
  with members:
    - "generalized sparse and low rank optimization for ultra dense networks"
    - "neural collaborative filtering"
    - "geometric matrix completion with recurrent multi graph neural networks"
    - "overview of full dimension mimo in lte advanced pro"
    - "millimeter wave channel estimation via exploiting joint sparse and low rank structures"
    - "no spurious local minima in nonconvex low rank problems a unified geometric analysis"
    - "low rank matrix completion for topological interference management by riemannian pursuit"
    - "nips 2016 tutorial generative adversarial networks"

Connected through hyperedge HE-4 (induced by source paper "expectation propagation line spectral estimation"):
  with members:
    - "a unified bayesian inference framework for generalized linear models"
    - "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"
    - "robust spectral compressed sensing via structured matrix completion"

Connected through hyperedge HE-5 (induced by source paper "atomic norm denoising for complex exponentials with unknown waveform modulations"):
  with members:
    - "approximate support recovery of atomic line spectral estimation a tale of resolution and precision"
    - "atomic norm minimization for modal analysis from random and compressed samples"
    - "guaranteed blind sparse spikes deconvolution via lifting and convex optimization"
    - "generalized line spectral estimation via convex optimization"
    - "super resolution of complex exponentials from modulations with unknown waveforms"
    - "robust recovery of complex exponential signals from random gaussian projections via low rank hankel matrix reconstruction"
    - "exact joint sparse frequency recovery via optimization methods"
    - "super resolution radar"

Connected through hyperedge HE-6 (induced by source paper "on the stable resolution limit of total variation regularization for spike deconvolution"):
  with members:
    - "approximate support recovery of atomic line spectral estimation a tale of resolution and precision"
    - "a tight converse to the spectral resolution limit via convex programming"
    - "a theory of super resolution from short time fourier transform measurements"
    - "super resolution of positive sources the discrete setup"
    - "the recoverability limit for superresolution via sparsity"
    - "robust recovery of stream of pulses using convex optimization"
    - "music for single snapshot spectral estimation stability and super resolution"
    - "super resolution extremal functions and the condition number of vandermonde matrices"

Connected through hyperedge HE-7 (induced by source paper "off the grid recovery of time and frequency shifts with multiple measurement vectors"):
  with members:
    - "exploiting prior information in block sparse signals"
    - "distribution aware block sparse recovery via convex optimization"
    - "super resolution mimo radar"
    - "exact joint sparse frequency recovery via optimization methods"
    - "super resolution radar"
    - "compressed sensing off the grid"
    - "towards a mathematical theory of super resolution"
    - "on the sensitivity of continuous time noncoherent fading channel capacity"

Connected through hyperedge HE-8 (induced by source paper "sparse methods for direction of arrival estimation"):
  with members:
    - "a compact formulation for the ell_ 2 1 mixed norm minimization problem"
    - "fast and provable algorithms for spectrally sparse signal reconstruction via low rank hankel matrix completion"
    - "an overview of low rank matrix recovery from incomplete observations"
    - "robust recovery of complex exponential signals from random gaussian projections via low rank hankel matrix reconstruction"
    - "vandermonde decomposition of multilevel toeplitz matrices with application to multidimensional super resolution"
    - "robust spectral compressed sensing via structured matrix completion"
    - "exact joint sparse frequency recovery via optimization methods"
    - "continuous compressed sensing with a single or multiple measurement vectors"

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)