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: "robust spectral compressed sensing via structured matrix completion"
  Abstract: This paper explores the problem of spectral compressed sensing, which aims to recover a spectrally sparse signal from a small random subset of its n time domain samples. The signal of interest is assumed to be a superposition of r multidimensional complex sinusoids, while the underlying frequencies can assume any continuous values in the normalized frequency domain. Conventional compressed sensing paradigms suffer from the basis mismatch issue when imposing a discrete dictionary on the Fourier representation. To address this issue, we develop a novel algorithm, called enhanced matrix completion (EMaC), based on structured matrix completion that does not require prior knowledge of the model order. The algorithm starts by arranging the data into a low-rank enhanced form exhibiting multifold Hankel structure, and then attempts recovery via nuclear norm minimization. Under mild incoherence conditions, EMaC allows perfect recovery as soon as the number of samples exceeds the order of r log#N# 4#N# n, and is stable against bounded noise. Even if a constant portion of samples are corrupted with arbitrary magnitude, EMaC still allows exact recovery, provided that the sample complexity exceeds the order of r#N# 2#N# log#N# 3#N# n. Along the way, our results demonstrate the power of convex relaxation in completing a low-rank multifold Hankel or Toeplitz matrix from minimal observed entries. The performance of our algorithm and its applicability to super resolution are further validated by numerical experiments.

Connected through hyperedge HE-1 (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"
    - "off the grid line spectrum denoising and estimation with multiple measurement vectors"
    - "exact matrix completion via convex optimization"

Connected through hyperedge HE-2 (induced by source paper "nonconvex low rank symmetric tensor completion from noisy data"):
  with members:
    - "nonconvex optimization meets low rank matrix factorization an overview"
    - "iterative collaborative filtering for sparse noisy tensor estimation"
    - "tensor robust principal component analysis exact recovery of corrupted low rank tensors via convex optimization"
    - "fundamental conditions for low cp rank tensor completion"
    - "exact tensor completion with sum of squares"
    - "on the optimization landscape of tensor decompositions"
    - "implicit regularization in nonconvex statistical estimation gradient descent converges linearly for phase retrieval matrix completion and blind deconvolution"
    - "fast algorithms for robust pca via gradient descent"

Connected through hyperedge HE-3 (induced by source paper "on the convex geometry of blind deconvolution and matrix completion"):
  with members:
    - "phase retrieval without small ball probability assumptions"
    - "blind deconvolution by a steepest descent algorithm on a quotient manifold"
    - "blind demixing and deconvolution at near optimal rate"
    - "implicit regularization in nonconvex statistical estimation gradient descent converges linearly for phase retrieval matrix completion and blind deconvolution"
    - "low rank matrix recovery from clifford orbits"
    - "rapid robust and reliable blind deconvolution via nonconvex optimization"
    - "matrix completion has no spurious local minimum"
    - "guaranteed matrix completion via non convex factorization"

Connected through hyperedge HE-4 (induced by source paper "multi dimensional spectral super resolution with prior knowledge via frequency selective vandermonde decomposition and admm"):
  with members:
    - "multi target position and velocity estimation using ofdm communication signals"
    - "adaptive interference removal for uncoordinated radar communication coexistence"
    - "recovery of structured signals with prior information via maximizing correlation"
    - "near optimal sample complexity for convex tensor completion"
    - "millimeter wave beamformed full dimensional mimo channel estimation based on atomic norm minimization"
    - "super resolution delay doppler estimation for ofdm passive radar"
    - "rank determination for low rank data completion"
    - "characterization of deterministic and probabilistic sampling patterns for finite completability of low tensor train rank tensor"

Connected through hyperedge HE-5 (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"
    - "off the grid line spectrum denoising and estimation with multiple measurement vectors"

Connected through hyperedge HE-6 (induced by source paper "exact matrix completion based on low rank hankel structure in the fourier domain"):
  with members:
    - "nonconvex optimization meets low rank matrix factorization an overview"
    - "blind demixing and deconvolution at near optimal rate"
    - "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"
    - "incoherence optimal matrix completion"
    - "exact tensor completion using t svd"
    - "blind deconvolution meets blind demixing algorithms and performance bounds"
    - "the achievable performance of convex demixing"

Connected through hyperedge HE-7 (induced by source paper "fast and robust spectrally sparse signal recovery a provable non convex approach via robust low rank hankel matrix reconstruction"):
  with members:
    - "analog to digital cognitive radio sampling detection and hardware"
    - "accelerated alternating projections for robust principal component analysis"
    - "fast and provable algorithms for spectrally sparse signal reconstruction via low rank hankel matrix completion"
    - "a general framework for compressed sensing and parallel mri using annihilating filter based low rank hankel matrix"
    - "music for single snapshot spectral estimation stability and super resolution"
    - "fixed rank matrix factorizations and riemannian low rank optimization"
    - "compressed sensing and matrix completion with constant proportion of corruptions"
    - "beyond nyquist efficient sampling of sparse bandlimited signals"

Connected through hyperedge HE-8 (induced by source paper "multidimensional variational line spectra estimation"):
  with members:
    - "grid less variational bayesian inference of line spectral from quantized samples"
    - "efficient downlink channel reconstruction for fdd multi antenna systems"
    - "variational bayesian inference of line spectra"
    - "compressive channel estimation and tracking for large arrays in mm wave picocells"
    - "vandermonde decomposition of multilevel toeplitz matrices with application to multidimensional super resolution"

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)