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 compressed space lz cics"):
  Abstract: We show that both the Lempel Ziv 77- and the 78-factorization of a text of length $n$ on an integer alphabet of size $\sigma$ can be computed in $O(n \lg \lg \sigma)$ time (linear time if we allow randomization) using $O(n \lg \sigma)$ bits of working space. Given that a compressed representation of the suffix tree is loaded into RAM, we can compute both factorizations in $O(n)$ time using $z \lg n + O(n)$ bits of space, where $z$ is the number of factors.

Includes members:
  Member "faster lightweight lempel ziv parsing":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "refining the r index")
  Member "range predecessor and lempel ziv parsing":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "computing runs on a trie")
  Member "linear time construction of compressed text indices in compact space":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the complexity of bwt runs minimization via alphabet reordering")
  Member "alphabet dependent string searching with wexponential search trees":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "achieving optimal backlog in the vanilla multi processor cup game")
  Member "lightweight lempel ziv parsing":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "re pair in place")
  Member "the rightmost equal cost position problem":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "relations between greedy and bit optimal lz77 encodings")
  Member "fully functional static and dynamic succinct trees":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "fully functional bidirectional burrows wheeler indexes")
  Member "succinct indexable dictionaries with applications to encoding k ary trees prefix sums and multisets":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "path query data structures in practice")

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)