human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "unifying semantic foundations for automated verification tools in isabelle utp"):
  Abstract: The growing complexity and diversity of models used in the engineering of dependable systems implies that a variety of formal methods, across differing abstractions, paradigms, and presentations, must be integrated. Such an integration relies on unified semantic foundations for the various notations, and co-ordination of a variety of automated verification tools. The contribution of this paper is Isabelle/UTP, an implementation of Hoare and He's Unifying Theories of Programming, a framework for unification of formal semantics. Isabelle/UTP permits the mechanisation of computational theories for diverse paradigms, and their use in constructing formalised semantic models. These can be further applied in the development of verification tools, harnessing Isabelle's proof automation facilities. Several layers of mathematical foundations are developed, including lenses to model variables and state spaces as algebraic objects, alphabetised predicates and relations to model programs, including algebraic and axiomatic semantics, proof tools for Hoare logic and refinement calculus, and UTP theories to encode computational paradigms.

Includes members:
  Member "differential hoare logics and refinement calculi for hybrid systems with isabelle hol":
    also connected through other hyperedges:
      (none)
  Member "calculational verification of reactive programs with reactive relations and kleene algebra":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "automating verification of state machines with reactive designs and isabelle utp")
  Member "automating verification of state machines with reactive designs and isabelle utp":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "mechanised assurance cases with integrated formal methods in isabelle")
  Member "unifying theories of time with generalised reactive processes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "calculational verification of reactive programs with reactive relations and kleene algebra")
  Member "robotics and integrated formal methods necessity meets opportunity":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "towards a framework for certification of reliable autonomous systems")
  Member "unifying theories of reactive design contracts":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "calculational verification of reactive programs with reactive relations and kleene algebra")
  Member "profunctor optics modular data accessors":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "profunctor optics and traversals")

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