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 "the convergence guarantees of a non convex approach for sparse recovery"):
  Abstract: In the area of sparse recovery, numerous researches hint that non-convex penalties might induce better sparsity than convex ones, but up until now those corresponding non-convex algorithms lack convergence guarantees from the initial solution to the global optimum. This paper aims to provide performance guarantees of a non-convex approach for sparse recovery. Specifically, the concept of weak convexity is incorporated into a class of sparsity-inducing penalties to characterize the non-convexity. Borrowing the idea of the projected subgradient method, an algorithm is proposed to solve the non-convex optimization problem. In addition, a uniform approximate projection is adopted in the projection step to make this algorithm computationally tractable for large scale problems. The convergence analysis is provided in the noisy scenario. It is shown that if the non-convexity of the penalty is below a threshold (which is in inverse proportion to the distance between the initial solution and the sparse signal), the recovered solution has recovery error linear in both the step size and the noise term. Numerical simulations are implemented to test the performance of the proposed approach and verify the theoretical analysis.

Includes members:
  Member "robustness of sparse recovery via f minimization a topological viewpoint":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "e_ gamma resolvability")
  Member "proof of convergence and performance analysis for sparse recovery via zero point attracting projection":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "robustness of sparse recovery via f minimization a topological viewpoint")
  Member "the dynamics of message passing on dense graphs with applications to compressed sensing":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "capacity achieving spatially coupled sparse superposition codes with amp decoding")
  Member "sparse recovery using smoothed ell 0 sl0 convergence analysis":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "block sparsity induced adaptive filter for multi clustering system identification")
  Member "beyond nyquist efficient sampling of sparse bandlimited signals":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "secure and efficient compressed sensing based encryption with sparse matrices")
  Member "a stochastic gradient approach on compressive sensing signal reconstruction based on adaptive filtering framework":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "recursive recovery of sparse signal sequences from compressive measurements a review")
  Member "from theory to practice sub nyquist sampling of sparse wideband analog signals":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "image guided depth sampling and reconstruction")
  Member "a fast approach for overcomplete sparse decomposition based on smoothed ell 0 norm":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "ell_0 motivated low rank sparse subspace clustering")

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)