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 "linear time in place dfs and bfs on the word ram"):
  Abstract: We present an in-place depth first search (DFS) and an in-place breadth first search (BFS) that runs on a word RAM in linear time such that, if the adjacency arrays of the input graph are given in a sorted order, the input is restored after running the algorithm. To obtain our results we use properties of the representation used to store the given graph and show several linear-time in-place graph transformations from one representation into another.

Includes members:
  Member "small uncolored and colored choice dictionaries":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "space efficient vertex separators for treewidth")
  Member "succinct choice dictionaries":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "space efficient vertex separators for treewidth")
  Member "space efficient biconnected components and recognition of outerplanar graphs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "indexing graph search trees and applications")
  Member "space time trade offs for stack based algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "common tangents of two disjoint polygons in linear time and constant workspace")
  Member "radix sorting with no extra space":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "partial sums on the ultra wide word ram")

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)