human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "support predicted modified cs for recursive robust principal components pursuit"
  Abstract: This work proposes a causal and recursive algorithm for solving the "robust" principal components' analysis (PCA) problem. We primarily focus on robustness to correlated outliers. In recent work, we proposed a new way to look at this problem and showed how a key part of its solution strategy involves solving a noisy compressive sensing(CS) problem. However, if the support size of the outliers becomes too large, for a given dimension of the current PC space, then the number of "measurements" available for CS may become too small. In this work, we show how to address this issue by utilizing the correlation of the outliers to predict their support at the current time; and using this as "partial support knowledge" for solving Modified-CS instead of CS.

Connected through hyperedge HE-1 (induced by source paper "provable low rank phase retrieval and compressive pca"):
  with members:
    - "nonconvex optimization meets low rank matrix factorization an overview"
    - "provable subspace tracking from missing data and matrix completion"
    - "phaseless pca low rank matrix recovery from column wise phaseless measurements"
    - "provable dynamic robust pca or robust subspace tracking"
    - "low rank phase retrieval"
    - "nearly optimal robust subspace tracking"
    - "implicit regularization in nonconvex statistical estimation gradient descent converges linearly for phase retrieval matrix completion and blind deconvolution"
    - "sparse phase retrieval via truncated amplitude flow"

Connected through hyperedge HE-2 (induced by source paper "phaseless pca low rank matrix recovery from column wise phaseless measurements"):
  with members:
    - "provable dynamic robust pca or robust subspace tracking"
    - "phaseless subspace tracking"
    - "low rank phase retrieval"
    - "nearly optimal robust subspace tracking"
    - "solving random quadratic systems of equations is nearly as easy as solving linear systems"
    - "subspace learning with partial information"
    - "phaselift exact and stable signal recovery from magnitude measurements via convex programming"
    - "phase retrieval via matrix completion"

Connected through hyperedge HE-3 (induced by source paper "background subtraction in real applications challenges current models and future directions"):
  with members:
    - "on deterministic sampling patterns for robust low rank matrix completion"
    - "a comparison between background modelling methods for vehicle segmentation in highway traffic videos"
    - "recognition in terra incognita"
    - "robust subspace learning robust pca robust subspace tracking and robust subspace recovery"
    - "on the role and the importance of features for background modeling and foreground detection"
    - "towards benchmarking scene background initialization"
    - "decomposition into low rank plus additive matrices for background foreground separation a review for a comparative evaluation with a large scale dataset"
    - "image segmentation in video sequences a probabilistic approach"

Connected through hyperedge HE-4 (induced by source paper "static and dynamic robust pca and matrix completion a review"):
  with members:
    - "provable dynamic robust pca or robust subspace tracking"
    - "an overview of robust subspace recovery"
    - "video denoising via dynamic video layering"
    - "robust subspace learning robust pca robust subspace tracking and robust subspace recovery"
    - "low rank phase retrieval"
    - "nearly optimal robust subspace tracking"
    - "no spurious local minima in nonconvex low rank problems a unified geometric analysis"
    - "fast algorithms for robust pca via gradient descent"

Connected through hyperedge HE-5 (induced by source paper "static and dynamic robust pca via low rank sparse matrix decomposition a review"):
  with members:
    - "provable dynamic robust pca or robust subspace tracking"
    - "video denoising via dynamic video layering"
    - "low rank phase retrieval"
    - "nearly optimal robust subspace tracking"
    - "no spurious local minima in nonconvex low rank problems a unified geometric analysis"
    - "fast algorithms for robust pca via gradient descent"
    - "correlated pca principal components analysis when data and noise are correlated"
    - "matrix completion has no spurious local minimum"

Connected through hyperedge HE-6 (induced by source paper "weighted low rank approximation of matrices and background modeling"):
  with members:
    - "background subtraction via generalized fused lasso foreground modeling"
    - "towards benchmarking scene background initialization"
    - "decomposition into low rank plus additive matrices for background foreground separation a review for a comparative evaluation with a large scale dataset"
    - "an online algorithm for separating sparse and low dimensional signal sequences from their sum"
    - "moving object detection by detecting contiguous outliers in the low rank representation"
    - "robust principal component analysis"

Connected through hyperedge HE-7 (induced by source paper "robust subspace learning robust pca robust subspace tracking and robust subspace recovery"):
  with members:
    - "provable dynamic robust pca or robust subspace tracking"
    - "an overview of robust subspace recovery"
    - "low rank phase retrieval"
    - "nearly optimal robust subspace tracking"
    - "robust online matrix factorization for dynamic background subtraction"
    - "fast algorithms for robust pca via gradient descent"
    - "correlated pca principal components analysis when data and noise are correlated"
    - "nearly optimal robust matrix completion"

Connected through hyperedge HE-8 (induced by source paper "incorporating prior information in compressive online robust principal component analysis"):
  with members:
    - "recursive recovery of sparse signal sequences from compressive measurements a review"
    - "sparse signal reconstruction with multiple side information using adaptive weights for multiview sources"
    - "an online algorithm for separating sparse and low dimensional signal sequences from their sum"
    - "compressed sensing with side information geometrical interpretation and performance bounds"
    - "living on the edge phase transitions in convex programs with random data"
    - "recursive robust pca or recursive sparse recovery in large but structured noise"
    - "compressive principal component pursuit"
    - "modified cs modifying compressive sensing for problems with partially known support"

Question: Please tell me which class the center node 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)