human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "stochastic shortest paths and risk measures"
  Abstract: We consider three shortest path problems in directed graphs with random arc lengths. For the first and the second problems, a risk measure is involved. While the first problem consists in finding a path minimizing this risk measure, the second one consists in finding a path minimizing a deterministic cost, while satisfying a constraint on the risk measure. We propose algorithms solving these problems for a wide range of risk measures, which includes among several others the $CVaR$ and the probability of being late. Their performances are evaluated through experiments. One of the key elements in these algorithms is the use of stochastic lower bounds that allow to discard partial solutions. Good stochastic lower bounds are provided by the so-called Stochastic Ontime Arrival Problem. This latter problem is the third one studied in this paper and we propose a new and very efficient algorithm solving it. Complementary discussions on the complexity of the problems are also provided.

Connected through hyperedge HE-1 (induced by source paper "stochastic on time arrival problem in transit networks"):
  with members:
    - "tractable pathfinding for the stochastic on time arrival problem"
    - "robust adaptive routing under uncertainty"

Connected through hyperedge HE-2 (induced by source paper "tractable pathfinding for the stochastic on time arrival problem"):
  with members:
    - "robust adaptive routing under uncertainty"
    - "travel time estimation for urban road networks using low frequency probe vehicle data"

Connected through hyperedge HE-3 (induced by source paper "finding risk averse shortest path with time dependent stochastic costs"):
  with members:
    - "route planning in transportation networks"

Connected through hyperedge HE-4 (induced by source paper "algorithms for non linear and stochastic resource constrained shortest paths"):
  with members:
    - "route planning in transportation networks"
    - "robust adaptive routing under uncertainty"

Question: Please tell me which class the center node 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)