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: "variations on the stochastic shortest path problem"
  Abstract: In this invited contribution, we revisit the stochastic shortest path problem, and show how recent results allow one to improve over the classical solutions: we present algorithms to synthesize strategies with multiple guarantees on the distribution of the length of paths reaching a given target, rather than simply minimizing its expected value. The concepts and algorithms that we propose here are applications of more general results that have been obtained recently for Markov decision processes and that are described in a series of recent papers.

Connected through hyperedge HE-1 (induced by source paper "reinforcement learning of risk constrained policies in markov decision processes"):
  with members:
    - "expectation optimization with probabilistic guarantees in pomdps with discounted sum objectives"
    - "vulcan a monte carlo algorithm for large chance constrained mdps with risk bounding functions"
    - "meet your expectations with guarantees beyond worst case synthesis in quantitative games"
    - "heuristic search value iteration for pomdps"
    - "reinforcement learning a survey"

Connected through hyperedge HE-2 (induced by source paper "life is random time is not markov decision processes with window objectives"):
  with members:
    - "multi weighted markov decision processes with reachability objectives"
    - "expected window mean payoff"
    - "universal trees grow inside separating automata quasi polynomial lower bounds for parity games"
    - "the complexity of mean payoff games using universal graphs"
    - "extending finite memory determinacy by boolean combination of winning conditions"
    - "value iteration for long run average reward in markov decision processes"
    - "threshold constraints with guarantees for parity objectives in markov decision processes"
    - "a storm is coming a modern probabilistic model checker"

Connected through hyperedge HE-3 (induced by source paper "simple strategies in multi objective mdps technical report"):
  with members:
    - "multi weighted markov decision processes with reachability objectives"
    - "markov automata with multiple objectives"
    - "threshold constraints with guarantees for parity objectives in markov decision processes"
    - "a storm is coming a modern probabilistic model checker"
    - "multi objective approaches to markov decision processes with uncertain transition parameters"
    - "mixed integer quadratic programming is in np"
    - "percentile queries in multi dimensional markov decision processes"
    - "a survey of multi objective sequential decision making"

Connected through hyperedge HE-4 (induced by source paper "multi weighted markov decision processes with reachability objectives"):
  with members:
    - "stochastic shortest paths and weight bounded properties in markov decision processes"
    - "stream differential equations specification formats and solution methods"
    - "threshold constraints with guarantees for parity objectives in markov decision processes"
    - "maximizing the conditional expected reward for reaching the goal"
    - "unifying two views on multiple mean payoff objectives in markov decision processes"
    - "multidimensional beyond worst case and almost sure problems for mean payoff objectives"
    - "knowledge spaces and the completeness of learning strategies"
    - "the odds of staying on budget"

Connected through hyperedge HE-5 (induced by source paper "stochastic shortest paths and weight bounded properties in markov decision processes"):
  with members:
    - "mdps with energy parity objectives"
    - "optimizing the expected mean payoff in energy markov decision processes"
    - "qualitative analysis of vass induced mdps"
    - "the odds of staying on budget"
    - "computing quantiles in markov reward models"
    - "meet your expectations with guarantees beyond worst case synthesis in quantitative games"
    - "energy and mean payoff parity markov decision processes"
    - "energy parity games"

Connected through hyperedge HE-6 (induced by source paper "expectation optimization with probabilistic guarantees in pomdps with discounted sum objectives"):
  with members:
    - "optimal cost almost sure reachability in pomdps"
    - "meet your expectations with guarantees beyond worst case synthesis in quantitative games"
    - "heuristic search value iteration for pomdps"
    - "online planning algorithms for pomdps"
    - "reinforcement learning a survey"

Connected through hyperedge HE-7 (induced by source paper "infinite duration bidding games"):
  with members:
    - "determinacy in discrete bidding infinite duration games"
    - "infinite duration poorman bidding games"
    - "how much lookahead is needed to win infinite games"
    - "discrete all pay bidding games"
    - "non zero sum games for reactive synthesis"
    - "pure nash equilibria in concurrent deterministic games"
    - "the odds of staying on budget"
    - "secure equilibria in weighted games"

Connected through hyperedge HE-8 (induced by source paper "probabilistic motion planning under temporal tasks and soft constraints"):
  with members:
    - "risk averse ω regular markov decision process control"
    - "multigain a controller synthesis tool for mdps with multiple mean payoff objectives"
    - "pareto efficiency in synthesizing shared autonomy policies with temporal logic constraints"
    - "percentile queries in multi dimensional markov decision processes"
    - "a survey of multi objective sequential decision making"
    - "meet your expectations with guarantees beyond worst case synthesis in quantitative games"
    - "pareto curves for probabilistic model checking"
    - "control of noisy differential drive vehicles from time bounded temporal logic specifications"

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.LO(Logic in Computer Science)