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 "fast compressed self indexes with deterministic linear time construction"):
  Abstract: We introduce a compressed suffix array representation that, on a text $T$ of length $n$ over an alphabet of size $\sigma$, can be built in $O(n)$ deterministic time, within $O(n\log\sigma)$ bits of working space, and counts the number of occurrences of any pattern $P$ in $T$ in time $O(|P| + \log\log_w \sigma)$ on a RAM machine of $w=\Omega(\log n)$-bit words. This new index outperforms all the other compressed indexes that can be built in linear deterministic time, and some others. The only faster indexes can be built in linear time only in expectation, or require $\Theta(n\log n)$ bits. We also show that, by using $O(n\log\sigma)$ bits, we can build in linear time an index that counts in time $O(|P|/\log_\sigma n + \log n(\log\log n)^2)$, which is RAM-optimal for $w=\Theta(\log n)$ and sufficiently long patterns.

Includes members:
  Member "fast prefix search in little space with applications":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fully functional suffix trees and optimal text searching in bwt runs bounded space")
  Member "linear time string indexing and analysis in small space":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "fully functional bidirectional burrows wheeler indexes")
  Member "space efficient construction of compressed indexes in deterministic linear time":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the complexity of bwt runs minimization via alphabet reordering")
  Member "deterministic indexing for packed strings":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "top tree compression of tries")
  Member "linear time construction of compressed text indices in compact space":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the complexity of bwt runs minimization via alphabet reordering")
  Member "suffix trays and suffix trists structures for faster text indexing":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "text indexing and searching in sublinear time")
  Member "alphabet dependent string searching with wexponential search trees":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "achieving optimal backlog in the vanilla multi processor cup game")
  Member "optimal lower and upper bounds for representing sequences":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "energy consumption in compact integer vectors a study case")

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)