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 "constant delay traversal of grammar compressed graphs with bounded rank"):
  Abstract: We present a pointer-based data structure for constant time traversal of the edges of an edge-labeled (alphabet $\Sigma$) directed hypergraph (a graph where edges can be incident to more than two vertices, and the incident vertices are ordered) given as hyperedge-replacement grammar $G$. It is assumed that the grammar has a fixed rank $\kappa$ (maximal number of vertices connected to a nonterminal hyperedge) and that each vertex of the represented graph is incident to at most one $\sigma$-edge per direction ($\sigma \in \Sigma$). Precomputing the data structure needs $O(|G||\Sigma|\kappa r h)$ space and $O(|G||\Sigma|\kappa rh^2)$ time, where $h$ is the height of the derivation tree of $G$ and $r$ is the maximal rank of a terminal edge occurring in the grammar.

Includes members:
  Member "balancing straight line programs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "compressed range minimum queries")
  Member "grammar based graph compression":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "survey and taxonomy of lossless graph compression and space efficient graph representations")
  Member "fast and tiny structural self indexes for xml":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "grammar based graph compression")
  Member "fully functional static and dynamic succinct trees":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "fully functional bidirectional burrows wheeler indexes")

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)