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 "dynamic data structures for document collections and graphs"):
  Abstract: In the dynamic indexing problem, we must maintain a changing collection of text documents so that we can efficiently support insertions, deletions, and pattern matching queries. We are especially interested in developing efficient data structures that store and query the documents in compressed form. All previous compressed solutions to this problem rely on answering rank and select queries on a dynamic sequence of symbols. Because of the lower bound in [Fredman and Saks, 1989], answering rank queries presents a bottleneck in compressed dynamic indexing. In this paper we show how this lower bound can be circumvented using our new framework. We demonstrate that the gap between static and dynamic variants of the indexing problem can be almost closed. Our method is based on a novel framework for adding dynamism to static compressed data structures. Our framework also applies more generally to dynamizing other problems. We show, for example, how our framework can be applied to develop compressed representations of dynamic graphs and binary relations.

Includes members:
  Member "optimal top k document retrieval":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "spaces trees and colors the algorithmic landscape of document retrieval on sequences")
  Member "optimal dynamic sequence representations":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "o log log n worst case local decoding and update efficiency for data compression")
  Member "succinct representations of dynamic strings":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "compressed dynamic range majority and minority data structures")
  Member "efficient fully compressed sequence representations":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "lyndon array construction during burrows wheeler inversion")
  Member "fully functional static and dynamic succinct trees":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "fully functional bidirectional burrows wheeler indexes")
  Member "dynamic ordered sets with exponential search trees":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "improved dynamic graph coloring")

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)