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: "percentile queries in multi dimensional markov decision processes"
  Abstract: Markov decision processes (MDPs) with multi-dimensional weights are useful to analyze systems with multiple objectives that may be conflicting and require the analysis of trade-offs. We study the complexity of percentile queries in such MDPs and give algorithms to synthesize strategies that enforce such constraints. Given a multi-dimensional weighted MDP and a quantitative payoff function $f$, thresholds $v_i$ (one per dimension), and probability thresholds $\alpha_i$, we show how to compute a single strategy to enforce that for all dimensions $i$, the probability of outcomes $\rho$ satisfying $f_i(\rho) \geq v_i$ is at least $\alpha_i$. We consider classical quantitative payoffs from the literature (sup, inf, lim sup, lim inf, mean-payoff, truncated sum, discounted sum). Our work extends to the quantitative case the multi-objective model checking problem studied by Etessami et al. in unweighted MDPs.

Connected through hyperedge HE-1 (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-2 (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"
    - "variations on the stochastic shortest path problem"
    - "mixed integer quadratic programming is in np"
    - "a survey of multi objective sequential decision making"

Connected through hyperedge HE-3 (induced by source paper "approximating values of generalized reachability stochastic games"):
  with members:
    - "efficient strategy iteration for mean payoff in markov decision processes"
    - "decidability results for multi objective stochastic games"
    - "perfect information stochastic games with generalized mean payoff objectives"
    - "multigain a controller synthesis tool for mdps with multiple mean payoff objectives"
    - "verification of markov decision processes using learning algorithms"
    - "robust multidimensional mean payoff games are undecidable"
    - "trading performance for stability in markov decision processes"
    - "pareto curves for probabilistic model checking"

Connected through hyperedge HE-4 (induced by source paper "non deterministic weighted automata evaluated over markov chains"):
  with members:
    - "convex language semantics for nondeterministic probabilistic automata"
    - "quantitative automata under probabilistic semantics"
    - "strategy synthesis for multi dimensional quantitative objectives"

Connected through hyperedge HE-5 (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"
    - "variations on the stochastic shortest path problem"

Connected through hyperedge HE-6 (induced by source paper "conditional value at risk for reachability and mean payoff in markov decision processes"):
  with members:
    - "quantile markov decision process"
    - "value iteration for long run average reward in markov decision processes"
    - "maximizing the conditional expected reward for reaching the goal"
    - "multidimensional beyond worst case and almost sure problems for mean payoff objectives"
    - "the odds of staying on budget"
    - "trading performance for stability in markov decision processes"
    - "computing quantiles in markov reward models"
    - "meet your expectations with guarantees beyond worst case synthesis in quantitative games"

Connected through hyperedge HE-7 (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"
    - "variations on the stochastic shortest path problem"
    - "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"

Connected through hyperedge HE-8 (induced by source paper "multi objective robust strategy synthesis for interval markov decision processes"):
  with members:
    - "approximation of lorenz optimal solutions in multiobjective markov decision processes"
    - "pareto curves for probabilistic model checking"
    - "multi objective model checking of markov decision processes"

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)