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 "incorporating prior information in compressive online robust principal component analysis"):
  Abstract: We consider an online version of the robust Principle Component Analysis (PCA), which arises naturally in time-varying source separations such as video foreground-background separation. This paper proposes a compressive online robust PCA with prior information for recursively separating a sequences of frames into sparse and low-rank components from a small set of measurements. In contrast to conventional batch-based PCA, which processes all the frames directly, the proposed method processes measurements taken from each frame. Moreover, this method can efficiently incorporate multiple prior information, namely previous reconstructed frames, to improve the separation and thereafter, update the prior information for the next frame. We utilize multiple prior information by solving $n\text{-}\ell_{1}$ minimization for incorporating the previous sparse components and using incremental singular value decomposition ($\mathrm{SVD}$) for exploiting the previous low-rank components. We also establish theoretical bounds on the number of measurements required to guarantee successful separation under assumptions of static or slowly-changing low-rank components. Using numerical experiments, we evaluate our bounds and the performance of the proposed algorithm. In addition, we apply the proposed algorithm to online video foreground and background separation from compressive measurements. Experimental results show that the proposed method outperforms the existing methods.

Includes members:
  Member "recursive recovery of sparse signal sequences from compressive measurements a review":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "real time reconstruction of counting process through queues")
  Member "sparse signal reconstruction with multiple side information using adaptive weights for multiview sources":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "online decomposition of compressive streaming data using n ell_1 cluster weighted minimization")
  Member "an online algorithm for separating sparse and low dimensional signal sequences from their sum":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "provable dynamic robust pca or robust subspace tracking")
  Member "compressed sensing with side information geometrical interpretation and performance bounds":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "multimodal image super resolution via deep unfolding with side information")
  Member "living on the edge phase transitions in convex programs with random data":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the convex geometry of blind deconvolution and matrix completion")
  Member "recursive robust pca or recursive sparse recovery in large but structured noise":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "provable subspace tracking from missing data and matrix completion")
  Member "compressive principal component pursuit":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "bilinear recovery using adaptive vector amp")
  Member "support predicted modified cs for recursive robust principal components pursuit":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "provable low rank phase retrieval and compressive pca")

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)