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 "extra space during initialization of succinct data structures and of dynamical initializable arrays"):
  Abstract: Many succinct data structures on a word RAM require precomputed tables to start operating. Usually, the tables can be constructed in sublinear time. In this time, most of the data structure is not initialized, i.e., there is plenty of unused space allocated for the data structure. We present a general framework to store temporary extra buffers between the real data so that data can be processed immediately, stored first in the buffers and then moved into the real data structure after finishing the tables. As a further application of our temporary extra buffers, we present an in-place dynamical initializable array.

Includes members:
  Member "linear time in place dfs and bfs on the word ram":
    also connected through other hyperedges:
      (none)
  Member "in place initializable arrays":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "space efficient vertex separators for treewidth")
  Member "frameworks for designing in place graph algorithms":
    also connected through other hyperedges:
      (none)
  Member "succinct choice dictionaries":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "space efficient vertex separators for treewidth")
  Member "succinct representations of permutations and functions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "path query data structures in practice")

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)