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 "space efficient deterministic approximation of string measures"):
  Abstract: We study approximation algorithms for the following three string measures that are widely used in practice: edit distance, longest common subsequence, and longest increasing sequence.\ All three problems can be solved exactly by standard algorithms that run in polynomial time with roughly $O(n)$ space, where $n$ is the input length, and our goal is to design deterministic approximation algorithms that run in polynomial time with significantly smaller space. Towards this, we design several algorithms that achieve $1+\epsilon$ or $1-\epsilon$ approximation for all three problems, where $\epsilon>0$ can be any constant. Our algorithms use space $n^{\delta}$ for any constant $\delta>0$ and have running time essentially the same as or slightly more than the standard algorithms. Our algorithms significantly improve previous results in terms of space complexity, where all known results need to use space at least $\Omega(\sqrt{n})$. Some of our algorithms can also be adapted to work in the asymmetric streaming model \cite{saks2013space}, and output the corresponding sequence. #R##N#Our algorithms are based on the idea of using recursion as in Savitch's theorem \cite{Savitch70}, and a careful modification of previous techniques to make the recursion work. Along the way we also give a new logspace reduction from longest common subsequence to longest increasing sequence, which may be of independent interest.

Includes members:
  Member "streaming with oracle new streaming algorithms for edit distance and lcs":
    also connected through other hyperedges:
      (none)
  Member "approximating lcs in linear time beating the sqrt n barrier":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "streaming with oracle new streaming algorithms for edit distance and lcs")
  Member "constant factor approximation of near linear edit distance in near linear time":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "streaming with oracle new streaming algorithms for edit distance and lcs")
  Member "constant factor approximations to edit distance on far input pairs in nearly linear time":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "streaming with oracle new streaming algorithms for edit distance and lcs")
  Member "space efficient algorithms for longest increasing subsequence":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "space efficient algorithms for breadth depth search")
  Member "the 2cnf boolean formula satisfiability problem and the linear space hypothesis":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "nonuniform families of polynomial size quantum finite automata and quantum logarithmic space computation with polynomial size advice")
  Member "edit distance sketching streaming and document exchange":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "streaming with oracle new streaming algorithms for edit distance and lcs")
  Member "edit distance cannot be computed in strongly subquadratic time unless seth is false":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "streaming with oracle new streaming algorithms for edit distance and lcs")

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)