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 "optimal dynamic sequence representations"):
  Abstract: We describe a data structure that supports access, rank and select queries, as well as symbol insertions and deletions, on a string $S[1,n]$ over alphabet $[1..\sigma]$ in time $O(\lg n/\lg\lg n)$, which is optimal even on binary sequences and in the amortized sense. Our time is worst-case for the queries and amortized for the updates. This complexity is better than the best previous ones by a $\Theta(1+\lg\sigma/\lg\lg n)$ factor. We also design a variant where times are worst-case, yet rank and updates take $O(\lg n)$ time. Our structure uses $nH_0(S)+o(n\lg\sigma) + O(\sigma\lg n)$ bits, where $H_0(S)$ is the zero-order entropy of $S$. Finally, we pursue various extensions and applications of the result.

Includes members:
  Member "new lower and upper bounds for representing sequences":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "run compressed rank select for large alphabets")
  Member "a dynamic stabbing max data structure with sub logarithmic query time":
    also connected through other hyperedges:
      (none)
  Member "fixed block compression boosting in fm indexes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "compressed multiple pattern matching")
  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 "compressed representations of permutations and applications":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "compression in the space of permutations")
  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")

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)