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 "symblicit exploration and elimination for probabilistic model checking"):
  Abstract: Binary decision diagrams can compactly represent vast sets of states, mitigating the state space explosion problem in model checking. Probabilistic systems, however, require multi-terminal diagrams storing rational numbers. They are inefficient for models with many distinct probabilities and for iterative numeric algorithms like value iteration. In this paper, we present a new "symblicit" approach to checking Markov chains and related probabilistic models: We first generate a decision diagram that symbolically collects all reachable states and their predecessors. We then concretise states one-by-one into an explicit partial state space representation. Whenever all predecessors of a state have been concretised, we eliminate it from the explicit state space in a way that preserves all relevant probabilities and rewards. We thus keep few explicit states in memory at any time. Experiments show that very large models can be model-checked in this way with very low memory consumption.

Includes members:
  Member "optimistic value iteration":
    also connected through other hyperedges:
      (none)
  Member "incremental verification of parametric and reconfigurable markov chains":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "scenario based verification of uncertain mdps")
  Member "sound value iteration":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "stopping criteria for value and strategy iteration on concurrent stochastic reachability games")
  Member "accelerated model checking of parametric markov chains":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the complexity of reachability in parametric markov decision processes")
  Member "continuous time markov decisions based on partial exploration":
    also connected through other hyperedges:
      (none)
  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 "explicit model checking of very large mdp using partitioning and secondary storage":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the probabilistic model checker storm")
  Member "verification of markov decision processes using learning algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "tractable reinforcement learning of signal temporal logic 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)