human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "parameter synthesis for markov models faster than ever"
  Abstract: We propose a simple technique for verifying probabilistic models whose transition probabilities are parametric. The key is to replace parametric transitions by nondeterministic choices of extremal values. Analysing the resulting parameter-free model using off-the-shelf means yields (refinable) lower and upper bounds on probabilities of regions in the parameter space. The technique outperforms the existing analysis of parametric Markov chains by several orders of magnitude regarding both run-time and scalability. Its beauty is its applicability to various probabilistic models. It in particular provides the first sound and feasible method for performing parameter synthesis of Markov decision processes.

Connected through hyperedge HE-1 (induced by source paper "the probabilistic model checker storm"):
  with members:
    - "counterexample driven synthesis for probabilistic program sketches"
    - "safety analysis for vehicle guidance systems with dynamic fault trees"
    - "parameter synthesis for markov models"
    - "value iteration for long run average reward in markov decision processes"
    - "markov automata with multiple objectives"
    - "maximizing the conditional expected reward for reaching the goal"
    - "a storm is coming a modern probabilistic model checker"
    - "high level counterexamples for probabilistic automata"

Connected through hyperedge HE-2 (induced by source paper "parameter synthesis for markov models"):
  with members:
    - "shepherding hordes of markov chains"
    - "parameter independent strategies for pmdps via pomdps"
    - "sea param exploring schedulers in parametric mdps"
    - "multi objective robust strategy synthesis for interval markov decision processes"
    - "parametric markov chains pctl complexity and fraction free gaussian elimination"
    - "sequential convex programming for the efficient verification of parametric mdps"
    - "reachability in augmented interval markov chains"
    - "a storm is coming a modern probabilistic model checker"

Connected through hyperedge HE-3 (induced by source paper "counterexample driven synthesis for probabilistic program sketches"):
  with members:
    - "shepherding hordes of markov chains"
    - "structured synthesis for probabilistic systems"
    - "safety aware apprenticeship learning"
    - "a storm is coming a modern probabilistic model checker"
    - "high level counterexamples for probabilistic automata"
    - "safety constrained reinforcement learning for mdps"
    - "a symbolic sat based algorithm for almost sure reachability with small strategies in pomdps"
    - "optimal cost almost sure reachability in pomdps"

Connected through hyperedge HE-4 (induced by source paper "on the complexity of reachability in parametric markov decision processes"):
  with members:
    - "parameter synthesis for markov models"
    - "qualitative reachability for open interval markov chains"
    - "accelerated model checking of parametric markov chains"
    - "sea param exploring schedulers in parametric mdps"
    - "parametric markov chains pctl complexity and fraction free gaussian elimination"
    - "a storm is coming a modern probabilistic model checker"
    - "a symbolic sat based algorithm for almost sure reachability with small strategies in pomdps"
    - "accelerating parametric probabilistic verification"

Connected through hyperedge HE-5 (induced by source paper "are parametric markov chains monotonic"):
  with members:
    - "on the complexity of reachability in parametric markov decision processes"
    - "accelerated model checking of parametric markov chains"
    - "parametric markov chains pctl complexity and fraction free gaussian elimination"
    - "reachability in augmented interval markov chains"
    - "a storm is coming a modern probabilistic model checker"
    - "the complexity of graph based reductions for reachability in markov decision processes"
    - "accelerating parametric probabilistic verification"

Connected through hyperedge HE-6 (induced by source paper "scenario based verification of uncertain mdps"):
  with members:
    - "parameter synthesis for markov models"
    - "parameter independent strategies for pmdps via pomdps"
    - "incremental verification of parametric and reconfigurable markov chains"
    - "sequential convex programming for the efficient verification of parametric mdps"
    - "a storm is coming a modern probabilistic model checker"
    - "multi objective approaches to markov decision processes with uncertain transition parameters"
    - "incremental pruning a simple fast exact method for partially observable markov decision processes"

Connected through hyperedge HE-7 (induced by source paper "safety analysis for vehicle guidance systems with dynamic fault trees"):
  with members:
    - "one net fits all a unifying semantics of dynamic fault trees using gspns"
    - "a storm is coming a modern probabilistic model checker"
    - "quantum quantitative safety analysis of uml models"
    - "statistical model checking an overview"

Connected through hyperedge HE-8 (induced by source paper "parameter independent strategies for pmdps via pomdps"):
  with members:
    - "sea param exploring schedulers in parametric mdps"
    - "sequential convex programming for the efficient verification of parametric mdps"
    - "automated experiment design for data efficient verification of parametric markov decision processes"
    - "a storm is coming a modern probabilistic model checker"
    - "ares adaptive receding horizon synthesis of optimal plans"
    - "a symbolic sat based algorithm for almost sure reachability with small strategies in pomdps"
    - "optimal cost almost sure reachability in pomdps"
    - "pomdps under probabilistic semantics"

Question: Please tell me which class the center node 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)