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: "coalgebraic automata theory basic results"
  Abstract: We generalize some of the central results in automata theory to the abstraction level of coalgebras and thus lay out the foundations of a universal theory of automata operating on infinite objects. Let F be any set functor that preserves weak pullbacks. We show that the class of recognizable languages of F-coalgebras is closed under taking unions, intersections, and projections. We also prove that if a nondeterministic F-automaton accepts some coalgebra it accepts a finite one of the size of the automaton. Our main technical result concerns an explicit construction which transforms a given alternating F-automaton into an equivalent nondeterministic one, whose size is exponentially bound by the size of the original automaton.

Connected through hyperedge HE-1 (induced by source paper "some model theory for the modal mu calculus syntactic characterisations of semantic properties"):
  with members:
    - "aleph1 and the modal mu calculus"
    - "weak mso automata and expressiveness modulo bisimilarity"
    - "exptime tableaux for the coalgebraic mu calculus"

Connected through hyperedge HE-2 (induced by source paper "disjunctive bases normal forms and model theory for modal logics"):
  with members:
    - "uniform interpolation for coalgebraic fixpoint logic"
    - "monadic second order logic and bisimulation invariance for coalgebras"
    - "completeness for the coalgebraic cover modality"
    - "exptime tableaux for the coalgebraic mu calculus"
    - "pspace bounds for rank 1 modal logics"

Connected through hyperedge HE-3 (induced by source paper "monadic second order logic and bisimulation invariance for coalgebras"):
  with members:
    - "exptime tableaux for the coalgebraic mu calculus"

Connected through hyperedge HE-4 (induced by source paper "completeness for the coalgebraic cover modality"):
  with members:
    - "relating coalgebraic notions of bisimulation"
    - "completeness for flat modal fixpoint logics"

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

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)