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: "non deterministic kleene coalgebras"
  Abstract: htmlabstractIn this paper, we present a systematic way of deriving (1) languages of (generalised)#R##N#regular expressions, and (2) sound and complete axiomatizations thereof, for a wide#R##N#variety of systems. This generalizes both the results of Kleene (on regular languages and deterministic#R##N#finite automata) and Milner (on regular behaviours and finite labelled transition#R##N#systems), and includes many other systems such as Mealy and Moore machines.

Connected through hyperedge HE-1 (induced by source paper "toward a uniform theory of effectful state machines"):
  with members:
    - "presenting distributive laws"
    - "towards a coalgebraic chomsky hierarchy"
    - "sound and complete axiomatizations of coalgebraic language equivalence"
    - "coalgebraic characterizations of context free languages"
    - "generalizing determinization from automata to coalgebras"
    - "reactive turing machines"

Connected through hyperedge HE-2 (induced by source paper "a new foundation for finitary corecursion and iterative algebras"):
  with members:
    - "proper functors and fixed points for finite behaviour"
    - "towards a coalgebraic chomsky hierarchy"
    - "sound and complete axiomatizations of coalgebraic language equivalence"
    - "coalgebraic characterizations of context free languages"
    - "generalizing determinization from automata to coalgebras"
    - "on the specification of operations on the rational behaviour of systems"
    - "semantics of higher order recursion schemes"
    - "the category theoretic solution of recursive program schemes"

Connected through hyperedge HE-3 (induced by source paper "predicate liftings and functor presentations in coalgebraic expression languages"):
  with members:
    - "towards a coalgebraic chomsky hierarchy"
    - "subsumption checking in conjunctive coalgebraic fixpoint logics"
    - "simulations and bisimulations for coalgebraic modal logics"
    - "generalizing determinization from automata to coalgebras"
    - "exptime tableaux for the coalgebraic mu calculus"
    - "completeness of flat coalgebraic fixpoint logics"

Connected through hyperedge HE-4 (induced by source paper "sound and complete axiomatizations of coalgebraic language equivalence"):
  with members:
    - "semantics of higher order recursion schemes"
    - "free iterative and iteration k semialgebras"
    - "simulation vs equivalence"
    - "simulations of weighted tree automata"
    - "generic trace semantics via coinduction"

Connected through hyperedge HE-5 (induced by source paper "automatic equivalence proofs for non deterministic coalgebras"):
  with members:
    - "relating coalgebraic notions of bisimulation"

Connected through hyperedge HE-6 (induced by source paper "coalgebraic characterizations of context free languages"):
  with members:
    - "presenting distributive laws"

Connected through hyperedge HE-7 (induced by source paper "an algorithm for probabilistic alternating simulation"):
  with members:
    - "on probabilistic alternating simulations"
    - "flow faster efficient decision algorithms for probabilistic simulations"
    - "first order and temporal logics for nested words"
    - "game refinement relations and metrics"

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)