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 "a compressed dynamic self index for highly repetitive text collections"):
  Abstract: We present a novel compressed dynamic self-index for highly repetitive text collections. Signature encoding is a compressed dynamic self-index for highly repetitive texts and has a large disadvantage that the pattern search for short patterns is slow. We improve this disadvantage for faster pattern search by leveraging an idea behind truncated suffix tree and present the first compressed dynamic self-index named TST-index that supports not only fast pattern search but also dynamic update operation of index for highly repetitive texts. Experiments using a benchmark dataset of highly repetitive texts show that the pattern search of TST-index is significantly improved.

Includes members:
  Member "optimal time dictionary compressed indexes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "towards a definitive measure of repetitiveness")
  Member "universal compressed text indexing":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "top tree compression of tries")
  Member "small space encoding lce data structure with constant time queries":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "in place longest common extensions")
  Member "time space trade offs for lempel ziv compressed indexing":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "top tree compression of tries")
  Member "at the roots of dictionary compression string attractors":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "towards a definitive measure of repetitiveness")
  Member "compressed indexing with signature grammars":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "top tree compression of tries")
  Member "optimal time text indexing in bwt runs bounded space":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "fast indexes for gapped pattern matching")
  Member "a self index on block trees":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "fully functional suffix trees and optimal text searching in bwt runs bounded space")

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)