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: "accelerating parametric probabilistic verification"
  Abstract: We present a novel method for computing reachability probabilities of parametric discrete-time Markov chains whose transition probabilities are fractions of polynomials over a set of parameters. Our algorithm is based on two key ingredients: a graph decomposition into strongly connected subgraphs combined with a novel factorization strategy for polynomials. Experimental evaluations show that these approaches can lead to a speed-up of up to several orders of magnitude in comparison to existing approaches

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"
    - "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-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"
    - "parametric markov chains pctl complexity and fraction free gaussian elimination"
    - "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"

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"
    - "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"
    - "parameter synthesis for markov models faster than ever"

Connected through hyperedge HE-4 (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"
    - "parameter synthesis for markov models faster than ever"
    - "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-5 (induced by source paper "incremental verification of parametric and reconfigurable markov chains"):
  with members:
    - "the power of synchronisation formal analysis of power consumption in networks of pulse coupled oscillators"
    - "a storm is coming a modern probabilistic model checker"
    - "parameter synthesis for markov models faster than ever"

Connected through hyperedge HE-6 (induced by source paper "probabilistic model checking of robots deployed in extreme environments"):
  with members:
    - "formal specification and verification of autonomous robotic systems a survey"
    - "robotics and integrated formal methods necessity meets opportunity"
    - "probabilistically safe vehicle control in a hostile environment"

Connected through hyperedge HE-7 (induced by source paper "sequential convex programming for the efficient verification of parametric mdps"):
  with members:
    - "parameter synthesis for markov models faster than ever"
    - "the probabilistic model checker storm extended abstract"
    - "smoothed model checking for uncertain continuous time markov chains"
    - "pareto curves for probabilistic model checking"
    - "multi objective model checking of markov decision processes"

Connected through hyperedge HE-8 (induced by source paper "sea param exploring schedulers in parametric mdps"):
  with members:
    - "sequential convex programming for the efficient verification of parametric mdps"
    - "parameter synthesis for markov models faster than ever"
    - "smoothed model checking for uncertain continuous time markov chains"

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.SE(Software Engineering)