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 "sparse subspace clustering via two step reweighted l1 minimization algorithm and provable neighbor recovery rates"):
  Abstract: Sparse subspace clustering (SSC) relies on sparse regression for accurate neighbor identification. Inspired by recent progress in compressive sensing, this paper proposes a new sparse regression scheme for SSC via two-step reweighted $\ell_1$-minimization, which also generalizes a two-step $\ell_1$-minimization algorithm introduced by E. J. Cand\`es et al in [The Annals of Statistics, vol. 42, no. 2, pp. 669-699, 2014] without incurring extra algorithmic complexity. To fully exploit the prior information offered by the computed sparse representation vector in the first step, our approach places a weight on each component of the regression vector, and solves a weighted LASSO in the second step. We propose a data weighting rule suitable for enhancing neighbor identification accuracy. Then, under the formulation of the dual problem of weighted LASSO, we study in depth the theoretical neighbor recovery rates of the proposed scheme. Specifically, an interesting connection between the locations of nonzeros of the optimal sparse solution to the weighted LASSO and the indexes of the active constraints of the dual problem is established. Afterwards, under the semi-random model, analytic probability lower/upper bounds for various neighbor recovery events are derived. Our analytic results confirm that, with the aid of data weighting and if the prior neighbor information is enough accurate, the proposed scheme with a higher probability can produce many correct neighbors and few incorrect neighbors as compared to the solution without data weighting. Computer simulations are provided to validate our analytic study and evidence the effectiveness of the proposed approach.

Includes members:
  Member "noisy subspace clustering via matching pursuits":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "restricted connection orthogonal matching pursuit for sparse subspace clustering")
  Member "iteratively reweighted ell_1 approaches to sparse composite regularization":
    also connected through other hyperedges:
      (none)
  Member "robust subspace clustering":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "provably efficient exploration for rl with unsupervised learning")
  Member "greedy feature selection for subspace clustering":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "multi level representation learning for deep subspace clustering")
  Member "a geometric analysis of subspace clustering with outliers":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "arae adversarially robust training of autoencoders improves novelty detection")
  Member "lasso screening rules via dual polytope projection":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "stable safe screening and structured dictionaries for faster ell _ 1 regularization")
  Member "improving the thresholds of sparse recovery an analysis of a two step reweighted basis pursuit algorithm":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "performance bounds for sparse signal reconstruction with multiple side information")
  Member "recovering compressively sampled signals using partial support information":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "exploiting prior information in block sparse signals")

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)