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: "parametric markov chains pctl complexity and fraction free gaussian elimination"
  Abstract: Parametric Markov chains have been introduced as a model for families of stochastic systems that rely on the same graph structure, but differ in the concrete transition probabilities. The latter are specified by polynomial constraints for the parameters. Among the tasks typically addressed in the analysis of parametric Markov chains are (1) the computation of closed-form solutions for reachabilty probabilities and other quantitative measures and (2) finding symbolic representations of the set of parameter valuations for which a given temporal logical formula holds as well as (3) the decision variant of (2) that asks whether there exists a parameter valuation where a temporal logical formula holds. Our contribution to (1) is to show that existing implementations for computing rational functions for reachability probabilities or expected costs in parametric Markov chains can be improved by using fraction-free Gaussian elimination, a long-known technique for linear equation systems with parametric coefficients. Our contribution to (2) and (3) is a complexity-theoretic discussion of the model checking problem for parametric Markov chains and probabilistic computation tree logic (PCTL) formulas. We present an exponential-time algorithm for (2) and a PSPACE upper bound for (3). Moreover, we identify fragments of PCTL and subclasses of parametric Markov chains where (1) and (3) are solvable in polynomial time and establish NP-hardness for other PCTL fragments.

Connected through hyperedge HE-1 (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"
    - "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"
    - "parameter synthesis for markov models faster than ever"

Connected through hyperedge HE-2 (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"
    - "a storm is coming a modern probabilistic model checker"
    - "parameter synthesis for markov models faster than ever"
    - "a symbolic sat based algorithm for almost sure reachability with small strategies in pomdps"
    - "accelerating parametric probabilistic verification"

Connected through hyperedge HE-3 (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"
    - "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"
    - "parameter synthesis for markov models faster than ever"
    - "accelerating parametric probabilistic verification"

Connected through hyperedge HE-4 (induced by source paper "permissive finite state controllers of pomdps using parameter synthesis"):
  with members:
    - "sequential convex programming for the efficient verification of parametric mdps"
    - "a storm is coming a modern probabilistic model checker"
    - "parameter synthesis for markov models faster than ever"
    - "safety constrained reinforcement learning for mdps"
    - "permissive controller synthesis for probabilistic systems"
    - "a symbolic sat based algorithm for almost sure reachability with small strategies in pomdps"
    - "optimal cost almost sure reachability in pomdps"
    - "solving pomdps by searching the space of finite policies"

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)