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 "side information in robust principal component analysis algorithms and applications"):
  Abstract: Robust Principal Component Analysis (RPCA) aims at recovering a low-rank subspace from grossly corrupted high-dimensional (often visual) data and is a cornerstone in many machine learning and computer vision applications. Even though RPCA has been shown to be very successful in solving many rank minimisation problems, there are still cases where degenerate or suboptimal solutions are obtained. This is likely to be remedied by taking into account of domain-dependent prior knowledge. In this paper, we propose two models for the RPCA problem with the aid of side information on the low-rank structure of the data. The versatility of the proposed methods is demonstrated by applying them to four applications, namely background subtraction, facial image denoising, face and facial expression recognition. Experimental results on synthetic and five real world datasets indicate the robustness and effectiveness of the proposed methods on these application domains, largely outperforming six previous approaches.

Includes members:
  Member "fast robust pca on graphs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "predicting graph signals using kernel regression where the input signal is agnostic to a graph")
  Member "partial sum minimization of singular values in robust pca algorithm and applications":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a benchmark for sparse coding when group sparsity meets rank minimization")
  Member "robust principal component analysis on graphs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "wasserstein based graph alignment")
  Member "justification of logarithmic loss via the benefit of side information":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the information bottleneck problems models connections applications and information theoretic views")
  Member "deception with side information in biometric authentication systems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "exponential strong converse for content identification with lossy recovery")
  Member "adaptive rate compressive sensing using side information":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "compressive online robust principal component analysis with optical flow for video foreground background separation")
  Member "compressed sensing with side information geometrical interpretation and performance bounds":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "multimodal image super resolution via deep unfolding with side information")
  Member "robust recovery of subspace structures by low rank representation":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "gated fusion network for degraded image super resolution")

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.CV(Computer Vision and Pattern Recognition)