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 simple algorithm for computing the document array"):
  Abstract: We present a simple algorithm for computing the document array given a string collection and its suffix array as input. Our algorithm runs in linear time using constant additional space for strings from constant alphabets.

Includes members:
  Member "algorithms to compute the burrows wheeler similarity distribution":
    also connected through other hyperedges:
      (none)
  Member "haplotype aware graph indexes":
    also connected through other hyperedges:
      (none)
  Member "external memory bwt and lcp computation for sequence collections with applications":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the alternating bwt an algorithmic perspective")
  Member "space efficient construction of compressed indexes in deterministic linear time":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the complexity of bwt runs minimization via alphabet reordering")
  Member "document retrieval on repetitive string collections":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "fast small and simple document listing on repetitive text collections")
  Member "from theory to practice plug and play with succinct data structures":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "bitvectors with runs and the successor predecessor problem")

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)