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 "exact matrix completion based on low rank hankel structure in the fourier domain"):
  Abstract: Matrix completion is about recovering a matrix from its partial revealed entries, and it can often be achieved by exploiting the inherent simplicity or low dimensional structure of the target matrix. For instance, a typical notion of matrix simplicity is low rank. In this paper we study matrix completion based on another low dimensional structure, namely the low rank Hankel structure in the Fourier domain. It is shown that matrices with this structure can be exactly recovered by solving a convex optimization program provided the sampling complexity is nearly optimal. Empirical results are also presented to justify the effectiveness of the convex method.

Includes members:
  Member "nonconvex optimization meets low rank matrix factorization an overview":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "finding the sparsest vectors in a subspace theory algorithms and applications")
  Member "blind demixing and deconvolution at near optimal rate":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the convex geometry of blind deconvolution and matrix completion")
  Member "fast and provable algorithms for spectrally sparse signal reconstruction via low rank hankel matrix completion":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "fast and robust spectrally sparse signal recovery a provable non convex approach via robust low rank hankel matrix reconstruction")
  Member "an overview of low rank matrix recovery from incomplete observations":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "bilinear recovery using adaptive vector amp")
  Member "incoherence optimal matrix completion":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "matrix completion with prior subspace information via maximizing correlation")
  Member "exact tensor completion using t svd":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "low rank tensor grid for image completion")
  Member "blind deconvolution meets blind demixing algorithms and performance bounds":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "support recovery for sparse signals with unknown non stationary modulation")
  Member "robust spectral compressed sensing via structured matrix completion":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "recovery analysis of damped spectrally sparse signals and its relation to music")

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)