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 "re pair in place"):
  Abstract: Re-Pair is a grammar compression scheme with favorably good compression rates. The computation of Re-Pair comes with the cost of maintaining large frequency tables, which makes it hard to compute Re-Pair on large scale data sets. As a solution for this problem we present, given a text of length $n$ whose characters are drawn from an integer alphabet, an $O(n^2) \cap O(n^2 \lg \log_\tau n \lg \lg \lg n / \log_\tau n)$ time algorithm computing Re-Pair in $n \lg \max(n,\tau)$ bits of space including the text space, where $\tau$ is the number of terminals and non-terminals. The algorithm works in the restore model, supporting the recovery of the original input in the time for the Re-Pair computation with $O(\lg n)$ additional bits of working space. We give variants of our solution working in parallel or in the external memory model.

Includes members:
  Member "a study for image compression using re pair algorithm":
    also connected through other hyperedges:
      (none)
  Member "a faster external memory priority queue with decreasekeys":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "external memory priority queues with decrease key and applications to graph algorithms")
  Member "mr repair grammar compression based on maximal repeats":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "grammar compression with probabilistic context free grammar")
  Member "repair in compressed space and time":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "practical repetition aware grammar compression")
  Member "burrows wheeler transform and lcp array construction in constant space":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "when a dollar makes a bwt")
  Member "practical and effective re pair compression":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "repair in compressed space and time")
  Member "optimal time and space construction of suffix arrays and lcp arrays for integer alphabets":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "in place longest common extensions")
  Member "optimal in place suffix sorting":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "optimal time and space construction of suffix arrays and lcp arrays for integer alphabets")

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)