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 "signal space cosamp for sparse recovery with redundant dictionaries"):
  Abstract: Compressive sensing (CS) has recently emerged as a powerful framework for acquiring sparse signals. The bulk of the CS literature has focused on the case where the acquired signal has a sparse or compressible representation in an orthonormal basis. In practice, however, there are many signals that cannot be sparsely represented or approximated using an orthonormal basis, but that do have sparse representations in a redundant dictionary. Standard results in CS can sometimes be extended to handle this case provided that the dictionary is sufficiently incoherent or well-conditioned, but these approaches fail to address the case of a truly redundant or overcomplete dictionary. In this paper we describe a variant of the iterative recovery algorithm CoSaMP for this more challenging setting. We utilize the D-RIP, a condition on the sensing matrix analogous to the well-known restricted isometry property. In contrast to prior work, the method and analysis are "signal-focused"; that is, they are oriented around recovering the signal rather than its dictionary coefficients. Under the assumption that we have a near-optimal scheme for projecting vectors in signal space onto the model family of candidate sparse signals, we provide provable recovery guarantees. Developing a practical algorithm that can provably compute the required near-optimal projections remains a significant open problem, but we include simulation results using various heuristics that empirically exhibit superior performance to traditional recovery algorithms.

Includes members:
  Member "towards a mathematical theory of super resolution":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "approximate support recovery of atomic line spectral estimation a tale of resolution and precision")
  Member "compressive sensing of analog signals using discrete prolate spheroidal sequences":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a universal sampling method for reconstructing signals with simple fourier transforms")
  Member "sparse recovery with orthogonal matching pursuit under rip":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "efficient active learning of sparse halfspaces with arbitrary bounded noise")
  Member "new and improved johnson lindenstrauss embeddings via the restricted isometry property":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "finding the mode of a kernel density estimate")
  Member "model based compressive sensing":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "compressed sensing with invertible generative models and dependent noise")
  Member "sampling and reconstructing signals from a union of linear subspaces":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "neumann networks for inverse problems in imaging")
  Member "iterative hard thresholding for compressed sensing":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "efficient active learning of sparse halfspaces with arbitrary bounded noise")

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)