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 "matrix completion with prior subspace information via maximizing correlation"):
  Abstract: This paper studies the problem of completing a low-rank matrix from a few random entries with the help of prior subspace information. Assuming that we have access to the column and row subspaces of the desired matrix, a new approach is proposed to incorporate the prior subspace information into the vanilla matrix completion program. Apart from promoting low-rank property, the proposed approach maximizes the correlation between the desired matrix and the matrix constructed by prior subspace information. The theoretical guarantee is established for the proposed method, which shows that with suitable prior information, the proposed approach can reduce the sample size of matrix completion by a logarithmic factor.

Includes members:
  Member "optimal weighted low rank matrix recovery with subspace prior information":
    also connected through other hyperedges:
      (none)
  Member "recovery of structured signals with prior information via maximizing correlation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "interference removal for radar communication co existence the random scattering case")
  Member "weighted matrix completion and recovery with prior subspace information":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "weighted matrix completion from non random non uniform sampling patterns")
  Member "incoherence optimal matrix completion":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the convex geometry of blind deconvolution and matrix completion")
  Member "provable inductive matrix completion":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "rich item recommendations for rich users via gcnn exploiting dynamic and static side information")
  Member "recovering low rank matrices from few coefficients in any basis":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "optimal adaptive matrix completion")
  Member "clustering partially observed graphs via convex optimization":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "self expressive subspace clustering to recognize motion dynamics of a multi joint coordination for chronic ankle instability")
  Member "learning with the weighted trace norm under arbitrary sampling distributions":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "low rank matrix completion in a general non orthogonal basis")

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)