human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "compressed sensing with 1d total variation breaking sample complexity barriers via non uniform recovery"):
  Abstract: This paper investigates total variation minimization in one spatial dimension for the recovery of gradient-sparse signals from undersampled Gaussian measurements. Recently established bounds for the required sampling rate state that uniform recovery of all $s$-gradient-sparse signals in $\mathbb{R}^n$ is only possible with $m \gtrsim \sqrt{s n} \cdot \text{PolyLog}(n)$ measurements. Such a condition is especially prohibitive for high-dimensional problems, where $s$ is much smaller than $n$. However, previous empirical findings seem to indicate that the latter sampling rate does not reflect the typical behavior of total variation minimization. Indeed, this work provides a rigorous analysis that breaks the $\sqrt{s n}$-bottleneck for a large class of "natural" signals. The main result shows that non-uniform recovery succeeds with high probability for $m \gtrsim s \cdot \text{PolyLog}(n)$ measurements if the jump discontinuities of the signal vector are sufficiently well separated. In particular, this guarantee allows for signals arising from a discretization of piecewise constant functions defined on an interval. The key ingredient of the proof is a novel upper bound for the associated conic Gaussian mean width, which is based on a signal-dependent, non-dyadic Haar wavelet transform. Furthermore, a natural extension to stable and robust recovery is addressed.

Includes members:
  Member "total variation minimization in compressed sensing":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "living near the edge a lower bound on the phase transition of total variation minimization")
  Member "ell 1 analysis minimization and generalized co sparsity when does recovery succeed":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "infinite dimensional compressed sensing from anisotropic measurements and applications to inverse problems in pde")
  Member "precise phase transition of total variation minimization":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "living near the edge a lower bound on the phase transition of total variation minimization")
  Member "convex recovery of a structured signal from independent random linear measurements":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "complex phase retrieval from subgaussian measurements")
  Member "the generalized lasso with non linear observations":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the convex geometry of blind deconvolution and matrix completion")
  Member "robust analysis l1 recovery from gaussian measurements and total variation minimization":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "living near the edge a lower bound on the phase transition of total variation minimization")
  Member "sharp mse bounds for proximal denoising":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "near optimal matrix recovery from random linear measurements")
  Member "stable image reconstruction using total variation minimization":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "living near the edge a lower bound on the phase transition of total variation minimization")

Question: Please tell me which class the source paper 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)