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 "efficient lz78 factorization of grammar compressed text"):
  Abstract: We present an efficient algorithm for computing the LZ78 factorization of a text, where the text is represented as a straight line program (SLP), which is a context free grammar in the Chomsky normal form that generates a single string. Given an SLP of size n representing a text S of length N, our algorithm computes the LZ78 factorization of T in $O(n\sqrt{N}+m\log N)$ time and $O(n\sqrt{N}+m)$ space, where m is the number of resulting LZ78 factors. We also show how to improve the algorithm so that the $n\sqrt{N}$ term in the time and space complexities becomes either nL, where L is the length of the longest LZ78 factor, or (N−α) where α≥0 is a quantity which depends on the amount of redundancy that the SLP captures with respect to substrings of S of a certain length. Since m=O(N/logσN) where σ is the alphabet size, the latter is asymptotically at least as fast as a linear time algorithm which runs on the uncompressed string when σ is constant, and can be more efficient when the text is compressible, i.e. when m and n are small.

Includes members:
  Member "speeding up q gram mining on grammar based compressed texts":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "compact q gram profiling of compressed strings")
  Member "lyndon words and short superstrings":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "lyndon words versus inverse lyndon words queries on suffixes and bordered words")
  Member "a bijective string sorting transform":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "lyndon words versus inverse lyndon words queries on suffixes and bordered words")
  Member "fast q gram mining on slp compressed strings":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "compressed range minimum queries")
  Member "tying up the loose ends in fully lzw compressed pattern matching":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the complexity of compressed membership problems for finite automata")
  Member "pattern matching in lempel ziv compressed strings fast simple and deterministic":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "optimal time dictionary compressed indexes")
  Member "faster fully compressed pattern matching by recompression":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "grammar compression with probabilistic context free grammar")
  Member "random access to grammar compressed strings":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "local decode and update for big data compression")

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)