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 "fully functional bidirectional burrows wheeler indexes"):
  Abstract: Given a string $T$ on an alphabet of size $\sigma$, we describe a bidirectional Burrows-Wheeler index that takes $O(|T|\log{\sigma})$ bits of space, and that supports the addition \emph{and removal} of one character, on the left or right side of any substring of $T$, in constant time. Previously known data structures that used the same space allowed constant-time addition to any substring of $T$, but they could support removal only from specific substrings of $T$. We also describe an index that supports bidirectional addition and removal in $O(\log{\log{|T|}})$ time, and that occupies a number of words proportional to the number of left and right extensions of the maximal repeats of $T$. We use such fully-functional indexes to implement bidirectional, frequency-aware, variable-order de Bruijn graphs in small space, with no upper bound on their order, and supporting natural criteria for increasing and decreasing the order during traversal.

Includes members:
  Member "simulating the dna string graph in succinct space":
    also connected through other hyperedges:
      (none)
  Member "assembling omnitigs using hidden order de bruijn graphs":
    also connected through other hyperedges:
      (none)
  Member "representing the suffix tree with the cdawg":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "towards a definitive measure of repetitiveness")
  Member "fast label extraction in the cdawg":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "towards a definitive measure of repetitiveness")
  Member "linear time string indexing and analysis in small space":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "space efficient construction of compressed suffix trees")
  Member "space efficient construction of compressed indexes in deterministic linear time":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the complexity of bwt runs minimization via alphabet reordering")
  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 "variable order de bruijn graphs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "lightweight merging of compressed indices based on bwt variants")

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)