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 "algorithms for ell_p low rank approximation"):
  Abstract: We consider the problem of approximating a given matrix by a low-rank matrix so as to minimize the entrywise $\ell_p$-approximation error, for any $p \geq 1$; the case $p = 2$ is the classical SVD problem. We obtain the first provably good approximation algorithms for this version of low-rank approximation that work for every value of $p \geq 1$, including $p = \infty$. Our algorithms are simple, easy to implement, work well in practice, and illustrate interesting tradeoffs between the approximation quality, the running time, and the rank of the approximating matrix.

Includes members:
  Member "on the complexity of robust pca and l1 norm low rank matrix approximation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "low rank approximation from communication complexity")
  Member "on low rank approximation of binary matrices":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "low rank approximation from communication complexity")
  Member "sketching as a tool for numerical linear algebra":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "approximating spectral clustering via sampling a review")
  Member "robust pca via outlier pursuit":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "finding the sparsest vectors in a subspace theory algorithms and applications")
  Member "robust principal component analysis":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "finding the sparsest vectors in a subspace theory algorithms and applications")
  Member "algorithms and hardness for subspace approximation":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "turning big data into tiny data constant size coresets for k means pca and projective clustering")

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.DS(Data Structures and Algorithms)