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: "uppaal smc statistical model checking for priced timed automata"
  Abstract: This paper offers a survey of UPPAAL-SMC, a major extension of the real-time verification tool UPPAAL. UPPAAL-SMC allows for the efficient analysis of performance properties of networks of priced timed automata under a natural stochastic semantics. In particular, U PPAAL-SMC relies on a series of extensions of the statistical model checking app roach generalized to handle real-time systems and estimate undecidable problems. UPPAAL-SMC comes together with a friendly user interface that allows a user to specify complex problems in an efficient manner as well as to get feedback in the form of probability distributions and compare probabilities to analyze performance aspects of systems. The focus of the survey is on the evolution of the tool ‐ including modeling and specification formalisms as well as techniques applied ‐ tog ether with applications of the tool to case studies.

Connected through hyperedge HE-1 (induced by source paper "quantitative aspects of programming languages and systems over the past 2 4 years and beyond"):
  with members:
    - "paws a tool for the analysis of weighted systems"
    - "divide and conquer variable set separation in hybrid systems reachability analysis"
    - "logical characterization of trace metrics"
    - "design and optimisation of the flyfast front end for attribute based coordination"
    - "language based abstractions for dynamical systems"
    - "limit your consumption finding bounds in average energy games"
    - "mela modelling in ecology with location attributes"
    - "logical characterization of bisimulation metrics"

Connected through hyperedge HE-2 (induced by source paper "formal verification of a programmable hypersurface"):
  with members:
    - "automated analysis of aodv using uppaal"

Connected through hyperedge HE-3 (induced by source paper "probabilistic analysis of weakly hard real time systems"):
  with members:
    - "statistical model checking for stochastic hybrid systems"

Connected through hyperedge HE-4 (induced by source paper "modelling verification and comparative performance analysis of the b a t m a n protocol"):
  with members:
    - "automated analysis of aodv using uppaal"
    - "sequence numbers do not guarantee loop freedom aodv can yield routing loops"

Connected through hyperedge HE-5 (induced by source paper "the probabilistic model checker storm extended abstract"):
  with members:
    - "parameter synthesis for markov models faster than ever"
    - "bounded model checking for probabilistic programs"
    - "safety constrained reinforcement learning for mdps"
    - "permissive controller synthesis for probabilistic systems"

Connected through hyperedge HE-6 (induced by source paper "applying formal methods to networking theory techniques and applications"):
  with members:
    - "automated analysis of aodv using uppaal"
    - "a review of automated formal verification of ad hoc routing protocols for wireless sensor networks"
    - "toward synthesis of network updates"
    - "statistical model checking an overview"

Connected through hyperedge HE-7 (induced by source paper "statistical model checking for biological applications"):
  with members:
    - "on the robustness of temporal properties for stochastic models"
    - "delta decidability over the reals"

Connected through hyperedge HE-8 (induced by source paper "faster statistical model checking for unbounded temporal properties"):
  with members:
    - "verification of markov decision processes using learning algorithms"
    - "robustness of structurally equivalent concurrent parity games"

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)