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: "stable principal component pursuit"
  Abstract: In this paper, we study the problem of recovering a low-rank matrix (the principal components) from a high-dimensional data matrix despite both small entry-wise noise and gross sparse errors. Recently, it has been shown that a convex program, named Principal Component Pursuit (PCP), can recover the low-rank matrix when the data matrix is corrupted by gross sparse errors. We further prove that the solution to a related convex program (a relaxed PCP) gives an estimate of the low-rank matrix that is simultaneously stable to small entrywise noise and robust to gross sparse errors. More precisely, our result shows that the proposed convex program recovers the low-rank matrix even though a positive fraction of its entries are arbitrarily corrupted, with an error bound proportional to the noise level. We present simulation results to support our result and demonstrate that the new convex program accurately recovers the principal components (the low-rank matrix) under quite broad conditions. To our knowledge, this is the first result that shows the classical Principal Component Analysis (PCA), optimal for small i.i.d. noise, can be made robust to gross sparse errors; or the first that shows the newly proposed PCP can be made stable to small entry-wise perturbations.

Connected through hyperedge HE-1 (induced by source paper "on the convex geometry of blind deconvolution and matrix completion"):
  with members:
    - "phase retrieval without small ball probability assumptions"
    - "blind deconvolution by a steepest descent algorithm on a quotient manifold"
    - "blind demixing and deconvolution at near optimal rate"
    - "implicit regularization in nonconvex statistical estimation gradient descent converges linearly for phase retrieval matrix completion and blind deconvolution"
    - "low rank matrix recovery from clifford orbits"
    - "rapid robust and reliable blind deconvolution via nonconvex optimization"
    - "matrix completion has no spurious local minimum"
    - "guaranteed matrix completion via non convex factorization"

Connected through hyperedge HE-2 (induced by source paper "a dictionary based generalization of robust pca part ii applications to hyperspectral demixing"):
  with members:
    - "target based hyperspectral demixing via generalized robust pca"
    - "a dictionary based generalization of robust pca"
    - "simultaneously sparse and low rank abundance matrix estimation for hyperspectral image unmixing"
    - "identifying outliers in large matrices via randomized adaptive compressive sampling"
    - "semi blind source separation via sparse representations and online dictionary learning"
    - "recovery of low rank plus compressed sparse matrices with application to unveiling traffic anomalies"
    - "compressive principal component pursuit"
    - "low rank matrix recovery from errors and erasures"

Connected through hyperedge HE-3 (induced by source paper "a dictionary based generalization of robust pca part i study of theoretical properties"):
  with members:
    - "target based hyperspectral demixing via generalized robust pca"
    - "a dictionary based generalization of robust pca"
    - "identifying outliers in large matrices via randomized adaptive compressive sampling"
    - "recovery of low rank plus compressed sparse matrices with application to unveiling traffic anomalies"
    - "compressive principal component pursuit"
    - "low rank matrix recovery from errors and erasures"
    - "robust principal component analysis"

Connected through hyperedge HE-4 (induced by source paper "error bounded foreground and background modeling for moving object detection in satellite videos"):
  with members:
    - "tracking in aerial hyperspectral videos using deep kernelized correlation filters"
    - "background subtraction via generalized fused lasso foreground modeling"
    - "corola a sequential solution to moving object detection using low rank approximation"
    - "decomposition into low rank plus additive matrices for background foreground separation a review for a comparative evaluation with a large scale dataset"
    - "moving object detection by detecting contiguous outliers in the low rank representation"
    - "robust principal component analysis"

Connected through hyperedge HE-5 (induced by source paper "res pca a scalable approach to recovering low rank matrices"):
  with members:
    - "robust subspace learning robust pca robust subspace tracking and robust subspace recovery"
    - "a fast factorization based approach to robust pca"
    - "robust pca via nonconvex rank approximation"
    - "robust pca via outlier pursuit"
    - "robust principal component analysis"

Connected through hyperedge HE-6 (induced by source paper "robust alignment for panoramic stitching via an exact rank constraint"):
  with members:
    - "image stitching by line guided local warping with global similarity constraint"
    - "quasi homography warps in image stitching"
    - "robust subspace clustering"
    - "compressive principal component pursuit"
    - "robust principal component analysis"

Connected through hyperedge HE-7 (induced by source paper "side information for face completion a robust pca approach"):
  with members:
    - "disentangling 3d pose in a dendritic cnn for unconstrained 2d face alignment"
    - "arcface additive angular margin loss for deep face recognition"
    - "a fast and accurate system for face detection identification and verification"
    - "multicolumn networks for face recognition"
    - "comparator networks"
    - "vggface2 a dataset for recognising faces across pose and age"
    - "sphereface deep hypersphere embedding for face recognition"
    - "beyond face rotation global and local perception gan for photorealistic and identity preserving frontal view synthesis"

Connected through hyperedge HE-8 (induced by source paper "an overview of robust subspace recovery"):
  with members:
    - "fast robust and non convex subspace recovery"
    - "static and dynamic robust pca via low rank sparse matrix decomposition a review"
    - "on the complexity of robust pca and l1 norm low rank matrix approximation"
    - "estimation of camera locations in highly corrupted scenarios all about that base no shape trouble"
    - "static and dynamic robust pca and matrix completion a review"
    - "being robust in high dimensions can be practical"
    - "a new rank constraint on multi view fundamental matrices and its application to camera location recovery"
    - "a well tempered landscape for non convex robust subspace recovery"

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)