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 "multi weighted markov decision processes with reachability objectives"):
  Abstract: In this paper, we are interested in the synthesis of schedulers in double-weighted Markov decision processes, which satisfy both a percentile constraint over a weighted reachability condition, and a quantitative constraint on the expected value of a random variable defined using a weighted reachability condition. This problem is inspired by the modelization of an electric-vehicle charging problem. We study the cartography of the problem, when one parameter varies, and show how a partial cartography can be obtained via two sequences of opimization problems. We discuss completeness and feasability of the method.

Includes members:
  Member "stochastic shortest paths and weight bounded properties in markov decision processes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "partial and conditional expectations in markov decision processes with integer weights")
  Member "stream differential equations specification formats and solution methods":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "differentiable causal computations via delayed trace")
  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 "maximizing the conditional expected reward for reaching the goal":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the probabilistic model checker storm")
  Member "unifying two views on multiple mean payoff objectives in markov decision processes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "value iteration for long run average reward in markov decision processes")
  Member "multidimensional beyond worst case and almost sure problems for mean payoff objectives":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "conditional value at risk for reachability and mean payoff in markov decision processes")
  Member "knowledge spaces and the completeness of learning strategies":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "no value restriction is needed for algebraic effects and handlers")
  Member "variations on the stochastic shortest path problem":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "reinforcement learning of risk constrained policies in markov decision processes")

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)