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 "grammar compressed sequences with rank select support"):
  Abstract: Abstract   Sequence representations supporting not only direct access to their symbols, but also rank/select operations, are a fundamental building block in many compressed data structures. Several recent applications need to represent highly repetitive sequences, and classical statistical compression proves ineffective. We introduce, instead, grammar-based representations for repetitive sequences, which use up to 6% of the space needed by statistically compressed representations, and support direct access and rank/select operations within tens of microseconds. We demonstrate the impact of our structures in text indexing applications.

Includes members:
  Member "queries on lz bounded encodings":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "top tree compression of tries")
  Member "spaces trees and colors the algorithmic landscape of document retrieval on sequences":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "fast small and simple document listing on repetitive text collections")
  Member "a succinct grammar compression":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "practical repetition aware grammar compression")
  Member "compact binary relation representations with rich functionality":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "compressed data structures for binary relations in practice")
  Member "data structure lower bounds on random access to grammar compressed strings":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "fully functional suffix trees and optimal text searching in bwt runs bounded space")
  Member "optimal lower and upper bounds for representing sequences":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "energy consumption in compact integer vectors a study case")
  Member "on compressing permutations and adaptive sorting":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on adaptive algorithms for maximum matching")
  Member "optimal trade off for succinct string indexes":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "range predecessor and lempel ziv parsing")

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)