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: "kleene algebra with domain"
  Abstract: We propose Kleene algebra with domain (KAD), an extension of Kleene algebra with two equational axioms for a domain and a codomain operation, respectively. KAD considerably augments the expressiveness of Kleene algebra, in particular for the specification and analysis of state transition systems. We develop the basic calculus, discuss some related theories and present the most important models of KAD. We demonstrate applicability by two examples: First, an algebraic reconstruction of Noethericity and well-foundedness; second, an algebraic reconstruction of propositional Hoare logic.

Connected through hyperedge HE-1 (induced by source paper "specification and inference of trace refinement relations"):
  with members:
    - "datalog based scalable semantic diffing of concurrent programs"
    - "verifying equivalence of database driven applications"
    - "kleene algebra modulo theories"
    - "automating induction for solving horn clauses"
    - "symbolic algorithms for language equivalence and kleene algebra with tests"
    - "a temporal logic for hyperproperties"

Connected through hyperedge HE-2 (induced by source paper "predicate transformer semantics for hybrid systems verification components for isabelle hol"):
  with members:
    - "a recipe for state and effect triangles"
    - "on the expressive power of kleene algebra with domain"
    - "the structure of differential invariants and differential cut elimination"

Connected through hyperedge HE-3 (induced by source paper "generalising kat to verify weighted computations"):
  with members:
    - "algebraic notions of termination"

Connected through hyperedge HE-4 (induced by source paper "probabilistic concurrent kleene algebra"):
  with members:
    - "assume guarantee abstraction refinement for probabilistic systems"

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)