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 "range predecessor and lempel ziv parsing"):
  Abstract: The Lempel-Ziv parsing of a string (LZ77 for short) is one of the most important and widely-used algorithmic tools in data compression and string processing. We show that the Lempel-Ziv parsing of a string of length $n$ on an alphabet of size $\sigma$ can be computed in $O(n\log\log\sigma)$ time ($O(n)$ time if we allow randomization) using $O(n\log\sigma)$ bits of working space; that is, using space proportional to that of the input string in bits. The previous fastest algorithm using $O(n\log\sigma)$ space takes $O(n(\log\sigma+\log\log n))$ time. We also consider the important rightmost variant of the problem, where the goal is to associate with each phrase of the parsing its most recent occurrence in the input string. We solve this problem in $O(n(1 + (\log\sigma/\sqrt{\log n}))$ time, using the same working space as above. The previous best solution for rightmost parsing uses $O(n(1+\log\sigma/\log\log n))$ time and $O(n\log n)$ space. As a bonus, in our solution for rightmost parsing we provide a faster construction method for efficient 2D orthogonal range reporting, which is of independent interest.

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 "wavelet trees meet suffix trees":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "translating between wavelet tree and wavelet matrix construction")
  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 "queries on lz bounded encodings":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "top tree compression of tries")
  Member "lightweight lempel ziv parsing":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "re pair in place")
  Member "faster compact on line lempel ziv factorization":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "suffix trees dawgs and cdawgs for forward and backward tries")
  Member "linear time lempel ziv factorization simple fast small":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "lempel ziv like parsing in small space")
  Member "succinct indices for range queries with applications to orthogonal range maxima":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "four dimensional dominance range reporting in linear 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)