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 "tight lower bounds for the longest common extension problem"):
  Abstract: The longest common extension problem is the problem of preprocessing a given string of length $n$ into a data structure that uses $S(n)$ bits on top of the input and answers in $T(n)$ time the queries $\mathit{LCE}(i,j)$ computing the length of the longest string that occurs at both positions $i$ and $j$ in the input. We prove that the trade-off $S(n)T(n) = \Omega(n\log n)$ holds in the non-uniform cell-probe model provided that the input string is read-only, each letter occupies a separate memory cell, $S(n) = \Omega(n)$, and the size of the input alphabet is at least $2^{8\lceil S(n) / n\rceil}$. It is known that this trade-off is tight.

Includes members:
  Member "small space encoding lce data structure with constant time queries":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a compressed dynamic self index for highly repetitive text collections")
  Member "fast longest common extensions in small space":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "in place longest common extensions")
  Member "faster longest common extension queries in strings over general alphabets":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "cartesian trees and lyndon trees")
  Member "sparse suffix tree construction in optimal time and space":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "time space tradeoffs for finding a long common substring")
  Member "in place longest common extensions":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "burrows wheeler transform and lcp array construction in constant space")
  Member "longest common extensions with recompression":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "compressed indexing with signature grammars")
  Member "deterministic sub linear space lce data structures with efficient construction":
    also connected through other hyperedges:
      (none)
  Member "longest common extensions in sublinear space":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "string indexing with compressed patterns")

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)