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 "uniform recovery in infinite dimensional compressed sensing and applications to structured binary sampling"):
  Abstract: Infinite-dimensional compressed sensing deals with the recovery of analog signals (functions) from linear measurements, often in the form of integral transforms such as the Fourier transform. This framework is well-suited to many real-world inverse problems, which are typically modelled in infinite-dimensional spaces, and where the application of finite-dimensional approaches can lead to noticeable artefacts. Another typical feature of such problems is that the signals are not only sparse in some dictionary, but possess a so-called local sparsity in levels structure. Consequently, the sampling scheme should be designed so as to exploit this additional structure. In this paper, we introduce a series of uniform recovery guarantees for infinite-dimensional compressed sensing based on sparsity in levels and so-called multilevel random subsampling. By using a weighted $\ell^1$-regularizer we derive measurement conditions that are sharp up to log factors, in the sense they agree with those of certain oracle estimators. These guarantees also apply in finite dimensions, and improve existing results for unweighted $\ell^1$-regularization. To illustrate our results, we consider the problem of binary sampling with the Walsh transform using orthogonal wavelets. Binary sampling is an important mechanism for certain imaging modalities. Through carefully estimating the local coherence between the Walsh and wavelet bases, we derive the first known recovery guarantees for this problem.

Includes members:
  Member "linear reconstructions and the analysis of the stable sampling rate":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "close encounters of the binary kind signal reconstruction guarantees for compressive hadamard sampling with haar wavelet basis")
  Member "on oracle type local recovery guarantees in compressed sensing":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "close encounters of the binary kind signal reconstruction guarantees for compressive hadamard sampling with haar wavelet basis")
  Member "robustness to unknown error in sparse regularization":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the gap between theory and practice in function approximation with deep neural networks")
  Member "compressed sensing with local structure uniform recovery guarantees for the sparsity in levels class":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the troublesome kernel why deep learning for inverse problems is typically unstable")
  Member "stable recovery of low dimensional cones in hilbert spaces one rip to rule them all":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the importance of phase in complex compressive sensing")
  Member "breaking the coherence barrier a new theory for compressed sensing":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "the troublesome kernel why deep learning for inverse problems is typically unstable")

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)