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: "sublinear space algorithms for the longest common substring problem"
  Abstract: Given $m$ documents of total length $n$, we consider the problem of finding a longest string common to at least $d \geq 2$ of the documents. This problem is known as the \emph{longest common substring (LCS) problem} and has a classic $O(n)$ space and $O(n)$ time solution (Weiner [FOCS'73], Hui [CPM'92]). However, the use of linear space is impractical in many applications. In this paper we show that for any trade-off parameter $1 \leq \tau \leq n$, the LCS problem can be solved in $O(\tau)$ space and $O(n^2/\tau)$ time, thus providing the first smooth deterministic time-space trade-off from constant to linear space. The result uses a new and very simple algorithm, which computes a $\tau$-additive approximation to the LCS in $O(n^2/\tau)$ time and $O(1)$ space. We also show a time-space trade-off lower bound for deterministic branching programs, which implies that any deterministic RAM algorithm solving the LCS problem on documents from a sufficiently large alphabet in $O(\tau)$ space must use $\Omega(n\sqrt{\log(n/(\tau\log n))/\log\log(n/(\tau\log n)})$ time.

Connected through hyperedge HE-1 (induced by source paper "time space tradeoffs for finding a long common substring"):
  with members:
    - "faster queries for longest substring palindrome after block edit"
    - "locally consistent parsing for text indexing in small space"
    - "longest common substring made fully dynamic"
    - "sparse suffix tree construction in optimal time and space"
    - "longest common substrings with k mismatches"
    - "approximating lz77 via small space multiple pattern matching"

Connected through hyperedge HE-2 (induced by source paper "longest property preserved common factor"):
  with members:
    - "linear time algorithm for long lcf with k mismatches"
    - "indexing weighted sequences neat and efficient"
    - "the runs theorem"
    - "a hardness result and new algorithm for the longest common palindromic subsequence problem"
    - "computing a longest common palindromic subsequence"

Connected through hyperedge HE-3 (induced by source paper "longest alignment with edits in data streams"):
  with members:
    - "streaming for aibohphobes longest palindrome with mismatches"
    - "tight tradeoffs for real time approximation of longest palindromes in streams"
    - "streaming algorithms for computing edit distance without exploiting suffix trees"
    - "edit distance sketching streaming and document exchange"
    - "longest common substrings with k mismatches"
    - "the k mismatch problem revisited"
    - "edit distance cannot be computed in strongly subquadratic time unless seth is false"
    - "palindrome recognition in the streaming model"

Connected through hyperedge HE-4 (induced by source paper "longest common substring with approximately k mismatches"):
  with members:
    - "linear time algorithm for long lcf with k mismatches"
    - "longest common substrings with k mismatches"
    - "clustered integer 3sum via additive combinatorics"
    - "edit distance cannot be computed in strongly subquadratic time unless seth is false"
    - "a note on the longest common substring with k mismatches problem"

Connected through hyperedge HE-5 (induced by source paper "approximating lz77 via small space multiple pattern matching"):
  with members:
    - "dictionary matching in a stream"
    - "lightweight lempel ziv parsing"

Connected through hyperedge HE-6 (induced by source paper "a note on the longest common abelian factor problem"):
  with members:
    - "algorithms for longest common abelian factors"
    - "zig zag sort a simple deterministic data oblivious sorting algorithm running in o n log n time"

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