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 "stochastic shortest paths and weight bounded properties in markov decision processes"):
  Abstract: The paper deals with finite-state Markov decision processes (MDPs) with integer weights assigned to each state-action pair. New algorithms are presented to classify end components according to their limiting behavior with respect to the accumulated weights. These algorithms are used to provide solutions for two types of fundamental problems for integer-weighted MDPs. First, a polynomial-time algorithm for the classical stochastic shortest path problem is presented, generalizing known results for special classes of weighted MDPs. Second, qualitative probability constraints for weight-bounded (repeated) reachability conditions are addressed. Among others, it is shown that the problem to decide whether a disjunction of weight-bounded reachability conditions holds almost surely under some scheduler belongs to $\textrm{NP}\cap \textrm{coNP}$, is solvable in pseudo-polynomial time and is at least as hard as solving two-player mean-payoff games, while the corresponding problem for universal quantification over schedulers is solvable in polynomial time.

Includes members:
  Member "mdps with energy parity objectives":
    also connected through other hyperedges:
      (none)
  Member "optimizing the expected mean payoff in energy markov decision processes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "energy mean payoff games")
  Member "qualitative analysis of vass induced mdps":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "mdps with energy parity objectives")
  Member "variations on the stochastic shortest path problem":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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-4 (induced by source paper "life is random time is not markov decision processes with window objectives")
  Member "computing quantiles in markov reward models":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "conditional value at risk for reachability and mean payoff in markov decision processes")
  Member "meet your expectations with guarantees beyond worst case synthesis in quantitative games":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "games where you can play optimally with finite memory")
  Member "energy and mean payoff parity markov decision processes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "probabilistic motion planning under temporal tasks and soft constraints")

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)