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 "frequent directions simple and deterministic matrix sketching"):
  Abstract: We describe a new algorithm called Frequent Directions for deterministic matrix sketching in the row-updates model. The algorithm is presented an arbitrary input matrix $A \in R^{n \times d}$ one row at a time. It performed $O(d \times \ell)$ operations per row and maintains a sketch matrix $B \in R^{\ell \times d}$ such that for any $k < \ell$ #R##N#$\|A^TA - B^TB \|_2 \leq \|A - A_k\|_F^2 / (\ell-k)$ and $\|A - \pi_{B_k}(A)\|_F^2 \leq \big(1 + \frac{k}{\ell-k}\big) \|A-A_k\|_F^2 $ . #R##N#Here, $A_k$ stands for the minimizer of $\|A - A_k\|_F$ over all rank $k$ matrices (similarly $B_k$) and $\pi_{B_k}(A)$ is the rank $k$ matrix resulting from projecting $A$ on the row span of $B_k$. We show both of these bounds are the best possible for the space allowed. The summary is mergeable, and hence trivially parallelizable. Moreover, Frequent Directions outperforms exemplar implementations of existing streaming algorithms in the space-error tradeoff.

Includes members:
  Member "improved practical matrix sketching with guarantees":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a deterministic streaming sketch for ridge regression")
  Member "relative errors for deterministic low rank matrix approximations":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "blinkml efficient maximum likelihood estimation with probabilistic guarantees")
  Member "low rank approximation and regression in input sparsity time":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "sketching transformed matrices with applications to natural language processing")
  Member "simple and deterministic matrix sketching":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "distributed stochastic algorithms for high rate streaming principal component analysis")
  Member "near optimal column based matrix reconstruction":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "good feature matching towards accurate robust vo vslam with low latency")
  Member "sparser johnson lindenstrauss transforms":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "sketching transformed matrices with applications to natural language processing")
  Member "an improved approximation algorithm for the column subset selection problem":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "good feature matching towards accurate robust vo vslam with low latency")
  Member "relative error cur matrix decompositions":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "good feature matching towards accurate robust vo vslam with low latency")

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)