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 "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.

Includes members:
  Member "unifying two views on multiple mean payoff objectives in markov decision processes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "multi weighted markov decision processes with reachability objectives")
  Member "the complexity of the kth largest subset problem and related problems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "expected window mean payoff")
  Member "exact and approximate determinization of discounted sum automata":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "comparator automata in quantitative verification")
  Member "variations on the stochastic shortest path problem":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "reinforcement learning of risk constrained policies in markov decision processes")
  Member "the odds of staying on budget":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "life is random time is not markov decision processes with window objectives")
  Member "quantitative games with interval objectives":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "decidability results for multi objective stochastic games")
  Member "decidability problems for actor systems":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "promptness and bounded fairness in concurrent and parameterized systems")
  Member "markov decision processes with multiple long run averageobjectives":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "deciding fast termination for probabilistic vass with nondeterminism")

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