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 "block sparse recovery of semidefinite systems and generalized null space conditions"):
  Abstract: This article considers the recovery of low-rank matrices via a convex nuclear-norm minimization problem and presents two null space properties (NSP) which characterize uniform recovery for the case of block-diagonal matrices and block-diagonal positive semidefinite matrices. These null-space conditions turn out to be special cases of a new general setup, which allows to derive the mentioned NSPs and well-known NPSs from the literature. We discuss the relative strength of these conditions and also present a deterministic class of matrices that satisfies the block-diagonal semidefinite NSP.

Includes members:
  Member "sparse recovery with integrality constraints":
    also connected through other hyperedges:
      (none)
  Member "guarantees of total variation minimization for signal recovery":
    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 "compressed sensing of block sparse positive vectors":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on sparse sensing and sparse sampling of coded signals at sub landau rates")
  Member "stable image reconstruction using total variation minimization":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "compressed sensing with 1d total variation breaking sample complexity barriers via non uniform recovery")
  Member "block sparse signals uncertainty relations and efficient recovery":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "dr2 net deep residual reconstruction network for image compressive sensing")

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)