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 "lempel ziv computation in small space lz ciss"):
  Abstract: For both the Lempel Ziv 77- and 78-factorization we propose algorithms generating the respective factorization using $(1+\epsilon) n \lg n + O(n)$ bits (for any positive constant $\epsilon \le 1$) working space (including the space for the output) for any text of size \$n\$ over an integer alphabet in $O(n / \epsilon^{2})$ time.

Includes members:
  Member "alphabet dependent string searching with wexponential search trees":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "achieving optimal backlog in the vanilla multi processor cup game")
  Member "simpler and faster lempel ziv factorization":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "bidirectional text compression in external memory")
  Member "a linear time algorithm for seeds computation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "internal dictionary matching")
  Member "fully functional static and dynamic succinct trees":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "fully functional bidirectional burrows wheeler indexes")
  Member "optimal succinctness for range minimum queries":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "space efficient construction of lyndon arrays in linear time")

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)