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 construction of compressed indexes in deterministic linear time"):
  Abstract: We show that the compressed suffix array and the compressed suffix tree of a string $T$ can be built in $O(n)$ deterministic time using $O(n\log\sigma)$ bits of space, where $n$ is the string length and $\sigma$ is the alphabet size. Previously described deterministic algorithms either run in time that depends on the alphabet size or need $\omega(n\log \sigma)$ bits of working space. Our result has immediate applications to other problems, such as yielding the first linear-time LZ77 and LZ78 parsing algorithms that use $O(n \log\sigma)$ bits.

Includes members:
  Member "linear time string indexing and analysis in small space":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fully functional bidirectional burrows wheeler indexes")
  Member "range predecessor and lempel ziv parsing":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "computing runs on a trie")
  Member "dynamic data structures for document collections and graphs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on dynamic succinct graph representations")
  Member "linear time construction of compressed text indices in compact space":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the complexity of bwt runs minimization via alphabet reordering")
  Member "optimal dynamic sequence representations":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "o log log n worst case local decoding and update efficiency for data compression")
  Member "efficient fully compressed sequence representations":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "lyndon array construction during burrows wheeler inversion")
  Member "more haste less waste lowering the redundancy in fully indexable dictionaries":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "four dimensional dominance range reporting in linear space")
  Member "fully functional static and dynamic succinct trees":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "fully functional bidirectional burrows wheeler indexes")

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)