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 "competitive online search trees on trees"):
  Abstract: We consider the design of adaptive data structures for searching elements of a tree-structured space. We use a natural generalization of the rotation-based online binary search tree model in which the underlying search space is the set of vertices of a tree. This model is based on a simple structure for decomposing graphs, previously known under several names including elimination trees, vertex rankings, and tubings. The model is equivalent to the classical binary search tree model exactly when the underlying tree is a path. We describe an online $O(\log \log n)$-competitive search tree data structure in this model, matching the best known competitive ratio of binary search trees. Our method is inspired by Tango trees, an online binary search tree algorithm, but critically needs several new notions including one which we call Steiner-closed search trees, which may be of independent interest. Moreover our technique is based on a novel use of two levels of decomposition, first from search space to a set of Steiner-closed trees, and secondly from these trees into paths.

Includes members:
  Member "weighted dynamic finger in binary search trees":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "new paths from splay to dynamic optimality")
  Member "on the tree search problem with non uniform costs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a framework for searching in graphs in the presence of errors")
  Member "deterministic and probabilistic binary search in graphs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "corrupted multidimensional binary search learning in the presence of irrational agents")
  Member "self adjusting binary search trees what makes them tick":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "new paths from splay to dynamic optimality")
  Member "the power and limitations of static binary search trees with lazy finger":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "belga b trees")
  Member "in pursuit of the dynamic optimality conjecture":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "new paths from splay to dynamic optimality")
  Member "searching in dynamic tree like partial orders":
    also connected through other hyperedges:
      (none)

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)