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 "performance guarantees for schatten p quasi norm minimization in recovery of low rank matrices"):
  Abstract: We address some theoretical guarantees for Schatten-$p$ quasi-norm minimization ($p \in (0,1]$) in recovering low-rank matrices from compressed linear measurements. Firstly, using null space properties of the measurement operator, we provide a sufficient condition for exact recovery of low-rank matrices. This condition guarantees unique recovery of matrices of ranks equal or larger than what is guaranteed by nuclear norm minimization. Secondly, this sufficient condition leads to a theorem proving that all restricted isometry property (RIP) based sufficient conditions for $\ell_p$ quasi-norm minimization generalize to Schatten-$p$ quasi-norm minimization. Based on this theorem, we provide a few RIP-based recovery conditions.

Includes members:
  Member "sparse signal recovery by ell_q minimization under restricted isometry property":
    also connected through other hyperedges:
      (none)
  Member "doa estimation in partially correlated noise using low rank sparse matrix decomposition":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "non iterative subspace based doa estimation in the presence of nonuniform noise")
  Member "calibration using matrix completion with application to ultrasound tomography":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "localization from incomplete euclidean distance matrix performance analysis for the svd mds approach")
  Member "new ric bounds via l_q minimization with 0 q 1 in compressed sensing":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "sparse signal recovery by ell_q minimization under restricted isometry property")
  Member "matrix completion in colocated mimo radar recoverability bounds theoretical guarantees":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "optimum co design for spectrum sharing between matrix completion based mimo radars and a mimo communication system")
  Member "on ric bounds of compressed sensing matrices for approximating sparse solutions using l q quasi norms":
    also connected through other hyperedges:
      (none)
  Member "collaborative spectrum sensing from sparse observations in cognitive radio networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "20 years of evolution from cognitive to intelligent communications")
  Member "matrix completion with noise":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "matrix completion with prior subspace information via maximizing correlation")

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)