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 "simple strategies in multi objective mdps technical report"):
  Abstract: We consider the verification of multiple expected reward objectives at once on Markov decision processes (MDPs). This enables a trade-off analysis among multiple objectives by obtaining the Pareto front. We focus on strategies that are easy to employ and implement. That is, strategies that are pure (no randomization) and have bounded memory. We show that checking whether a point is achievable by a pure stationary strategy is NP-complete, even for two objectives, and we provide an MILP encoding to solve the corresponding problem. The bounded memory case can be reduced to the stationary one by a product construction. Experimental results using \Storm and Gurobi show the feasibility of our algorithms.

Includes members:
  Member "multi weighted markov decision processes with reachability objectives":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "life is random time is not markov decision processes with window objectives")
  Member "markov automata with multiple objectives":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the probabilistic model checker storm")
  Member "threshold constraints with guarantees for parity objectives in markov decision processes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "life is random time is not markov decision processes with window objectives")
  Member "a storm is coming a modern probabilistic model checker":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the probabilistic model checker storm")
  Member "multi objective approaches to markov decision processes with uncertain transition parameters":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "scenario based verification of uncertain mdps")
  Member "variations on the stochastic shortest path problem":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "reinforcement learning of risk constrained policies in markov decision processes")
  Member "mixed integer quadratic programming is in np":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "deep hypernetwork based mimo detection")
  Member "percentile queries in multi dimensional markov decision processes":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "life is random time is not markov decision processes with window objectives")

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)