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: "automating verification of state machines with reactive designs and isabelle utp"
  Abstract: State-machine based notations are ubiquitous in the description of component systems, particularly in the robotic domain. To ensure these systems are safe and predictable, formal verification techniques are important, and can be cost-effective if they are both automated and scalable. In this paper, we present a verification approach for a diagrammatic state machine language that utilises theorem proving and a denotational semantics based on Unifying Theories of Programming (UTP). We provide the necessary theory to underpin state machines (including induction theorems for iterative processes), mechanise an action language for states and transitions, and use these to formalise the semantics. We then describe the verification approach, which supports infinite state systems, and exemplify it with a fully automated deadlock-freedom check. The work has been mechanised in our proof tool, Isabelle/UTP, and so also illustrates the use of UTP to build practical verification tools.

Connected through hyperedge HE-1 (induced by source paper "unifying semantic foundations for automated verification tools in isabelle utp"):
  with members:
    - "differential hoare logics and refinement calculi for hybrid systems with isabelle hol"
    - "calculational verification of reactive programs with reactive relations and kleene algebra"
    - "unifying theories of time with generalised reactive processes"
    - "robotics and integrated formal methods necessity meets opportunity"
    - "unifying theories of reactive design contracts"
    - "profunctor optics modular data accessors"

Connected through hyperedge HE-2 (induced by source paper "mechanised assurance cases with integrated formal methods in isabelle"):
  with members:
    - "new opportunities for integrated formal methods"

Connected through hyperedge HE-3 (induced by source paper "formal specification and verification of autonomous robotic systems a survey"):
  with members:
    - "modular verification of vehicle platooning with respect to decisions space and time"
    - "robotics and integrated formal methods necessity meets opportunity"
    - "formal verification of obstacle avoidance and navigation of ground robots"
    - "developing bug free machine learning systems with formal mathematics"
    - "a rational agent controlling an autonomous vehicle implementation and formal verification"
    - "a stochastically verifiable autonomous control architecture with reasoning"
    - "towards the verification of safety critical autonomous systems in dynamic environments"
    - "formal specification and analysis of autonomous systems under partial compliance"

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)