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 "longest common substring with approximately k mismatches"):
  Abstract: In the longest common substring problem we are given two strings of length $n$ and must find a substring of maximal length that occurs in both strings. It is well-known that the problem can be solved in linear time, but the solution is not robust and can vary greatly when the input strings are changed even by one letter. To circumvent this, Leimeister and Morgenstern introduced the problem of the longest common substring with $k$ mismatches. Lately, this problem has received a lot of attention in the literature. In this paper we first show a conditional lower bound based on the SETH hypothesis implying that there is little hope to improve existing solutions. We then introduce a new but closely related problem of the longest common substring with approximately $k$ mismatches and use computational geometry techniques to show that it admits a solution with strongly subquadratic running time. We also apply these results to obtain a strongly subquadratic approximation algorithm for the longest common substring with $k$ mismatches problem and show conditional hardness of improving its approximation ratio.

Includes members:
  Member "linear time algorithm for long lcf with k mismatches":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "longest property preserved common factor")
  Member "longest common substrings with k mismatches":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "time space tradeoffs for finding a long common substring")
  Member "clustered integer 3sum via additive combinatorics":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "all non trivial variants of 3 ldt are equivalent")
  Member "edit distance cannot be computed in strongly subquadratic time unless seth is false":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "streaming with oracle new streaming algorithms for edit distance and lcs")
  Member "sublinear space algorithms for the longest common substring problem":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "time space tradeoffs for finding a long common substring")
  Member "a note on the longest common substring with k mismatches problem":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "linear time algorithm for long lcf with k mismatches")

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)