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: "sharp recovery bounds for convex demixing with applications"
  Abstract: Demixing refers to the challenge of identifying two structured signals given only the sum of the two signals and prior information about their structures. Examples include the problem of separating a signal that is sparse with respect to one basis from a signal that is sparse with respect to a second basis, and the problem of decomposing an observed matrix into a low-rank matrix plus a sparse matrix. This paper describes and analyzes a framework, based on convex optimization, for solving these demixing problems, and many others. This work introduces a randomized signal model which ensures that the two structures are incoherent, i.e., generically oriented. For an observation from this model, this approach identifies a summary statistic that reflects the complexity of a particular signal. The difficulty of separating two structured, incoherent signals depends only on the total complexity of the two structures. Some applications include (i) demixing two signals that are sparse in mutually incoherent bases; (ii) decoding spread-spectrum transmissions in the presence of impulsive errors; and (iii) removing sparse corruptions from a low-rank matrix. In each case, the theoretical analysis of the convex demixing method closely matches its empirical behavior.

Connected through hyperedge HE-1 (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-2 (induced by source paper "recovery of structured signals from corrupted non linear measurements"):
  with members:
    - "corrupted sensing with sub gaussian measurements"
    - "stable recovery of structured signals from corrupted sub gaussian measurements"
    - "on the phase transition of corrupted sensing"
    - "convex recovery of a structured signal from independent random linear measurements"
    - "the generalized lasso with non linear observations"
    - "corrupted sensing novel guarantees for separating structured signals"
    - "living on the edge phase transitions in convex programs with random data"

Connected through hyperedge HE-3 (induced by source paper "nonconvex demixing from bilinear measurements"):
  with members:
    - "blind demixing for low latency communication"
    - "complete dictionary recovery over the sphere i overview and the geometric picture"
    - "regularized gradient descent a nonconvex recipe for fast joint blind deconvolution and demixing"
    - "theoretical insights into the optimization landscape of over parameterized shallow neural networks"
    - "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"
    - "no spurious local minima in nonconvex low rank problems a unified geometric analysis"
    - "low rank matrix completion for topological interference management by riemannian pursuit"

Connected through hyperedge HE-4 (induced by source paper "algorithmic aspects of inverse problems using generative models"):
  with members:
    - "rate optimal denoising with deep neural networks"
    - "deep denoising rate optimal recovery of structured signals with a deep prior"
    - "large scale gan training for high fidelity natural image synthesis"
    - "began boundary equilibrium generative adversarial networks"
    - "unpaired image to image translation using cycle consistent adversarial networks"
    - "global guarantees for enforcing deep generative priors by empirical risk"
    - "photo realistic single image super resolution using a generative adversarial network"
    - "reconnet non iterative reconstruction of images from compressively sensed random measurements"

Connected through hyperedge HE-5 (induced by source paper "blind demixing for low latency communication"):
  with members:
    - "nonconvex demixing from bilinear measurements"
    - "regularized gradient descent a nonconvex recipe for fast joint blind deconvolution and demixing"
    - "painless breakups efficient demixing of low rank matrices"
    - "blind deconvolution by a steepest descent algorithm on a quotient manifold"
    - "a survey on low latency towards 5g ran core network and caching solutions"
    - "no spurious local minima in nonconvex low rank problems a unified geometric analysis"
    - "low rank matrix completion for topological interference management by riemannian pursuit"
    - "blind deconvolution meets blind demixing algorithms and performance bounds"

Connected through hyperedge HE-6 (induced by source paper "complete dictionary recovery over the sphere i overview and the geometric picture"):
  with members:
    - "complete dictionary recovery over the sphere ii recovery by riemannian trust region method"
    - "polynomial time tensor decompositions with sum of squares"
    - "finding a sparse vector in a subspace linear sparsity using alternating directions"
    - "matrix completion has no spurious local minimum"
    - "guaranteed matrix completion via non convex factorization"
    - "a geometric analysis of phase retrieval"
    - "optimal injectivity conditions for bilinear inverse problems with applications to identifiability of deconvolution problems"
    - "simple efficient and neural algorithms for sparse coding"

Connected through hyperedge HE-7 (induced by source paper "blind demixing and deconvolution at near optimal rate"):
  with members:
    - "regularized gradient descent a nonconvex recipe for fast joint blind deconvolution and demixing"
    - "recovering structured data from superimposed non linear measurements"
    - "robust nonnegative sparse recovery and the nullspace property of 0 1 measurements"
    - "rapid robust and reliable blind deconvolution via nonconvex optimization"
    - "low rank tensor recovery via iterative hard thresholding"
    - "optimal injectivity conditions for bilinear inverse problems with applications to identifiability of deconvolution problems"
    - "self calibration and biconvex compressive sensing"
    - "rip like properties in subsampled blind deconvolution"

Connected through hyperedge HE-8 (induced by source paper "stable recovery of structured signals from corrupted sub gaussian measurements"):
  with members:
    - "corrupted sensing with sub gaussian measurements"
    - "on the phase transition of corrupted sensing"
    - "data recovery from corrupted observations via l1 minimization"
    - "corrupted sensing novel guarantees for separating structured signals"
    - "living on the edge phase transitions in convex programs with random data"
    - "probabilistic recovery guarantees for sparsely corrupted signals"
    - "compressed sensing and matrix completion with constant proportion of corruptions"
    - "stable restoration and separation of approximately sparse signals"

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)