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 time dependent route planning in road networks with user preferences"):
  Abstract: There has been tremendous progress in algorithmic methods for computing driving directions on road networks. Most of that work focuses on time-independent route planning, where it is assumed that the cost on each arc is constant per query. In practice, the current traffic situation significantly influences the travel time on large parts of the road network, and it changes over the day. One can distinguish between traffic congestion that can be predicted using historical traffic data, and congestion due to unpredictable events, e.g., accidents. In this work, we study the \emph{dynamic and time-dependent} route planning problem, which takes both prediction (based on historical data) and live traffic into account. To this end, we propose a practical algorithm that, while robust to user preferences, is able to integrate global changes of the time-dependent metric~(e.g., due to traffic updates or user restrictions) faster than previous approaches, while allowing subsequent queries that enable interactive applications.

Includes members:
  Member "hierarchical oracles for time dependent networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "engineering oracles for time dependent road networks")
  Member "engineering oracles for time dependent road networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "space efficient fast and exact routing in time dependent road networks")
  Member "graph bisection with pareto optimization":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "load balanced bottleneck objectives in process mapping")
  Member "route planning in transportation networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "survey of deep reinforcement learning for motion planning of autonomous vehicles")
  Member "salt a unified framework for all shortest path query variants on road networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "route planning in transportation networks")
  Member "customizable contraction hierarchies":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "scalable graph algorithms")
  Member "distance oracles for time dependent networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "efficient optimal planning in non fifo time dependent flow fields")
  Member "distributed evolutionary graph partitioning":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "multilevel acyclic hypergraph partitioning")

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)