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: "exptime tableaux for the coalgebraic mu calculus"
  Abstract: The coalgebraic approach to modal logic provides a uniform framework that captures the semantics of a large class of structurally different modal logics, including e.g. graded and probabilistic modal logics and coalition logic. In this paper, we introduce the coalgebraic mu-calculus, an extension of the general (coalgebraic) framework with fixpoint operators. Our main results are completeness of the associated tableau calculus and EXPTIME decidability for guarded formulas. Technically, this is achieved by reducing satisfiability to the existence of non-wellfounded tableaux, which is in turn equivalent to the existence of winning strategies in parity games. Our results are parametric in the underlying class of models and yield, as concrete applications, previously unknown complexity bounds for the probabilistic mu-calculus and for an extension of coalition logic with fixpoints.

Connected through hyperedge HE-1 (induced by source paper "np reasoning in the monotone mu calculus"):
  with members:
    - "completeness for game logic"
    - "monadic second order logic and bisimulation invariance for coalgebras"

Connected through hyperedge HE-2 (induced by source paper "optimal satisfiability checking for arithmetic mu calculi"):
  with members:
    - "permutation games for the weakly aconjunctive mu calculus"
    - "satisfiability games for branching time logics"
    - "unifying buchi complementation constructions"
    - "strong completeness of coalgebraic modal logics"
    - "pspace bounds for rank 1 modal logics"
    - "decisive markov chains"

Connected through hyperedge HE-3 (induced by source paper "computing nested fixpoints in quasipolynomial time"):
  with members:
    - "parity games zielonka s algorithm in quasi polynomial time"
    - "universal trees grow inside separating automata quasi polynomial lower bounds for parity games"
    - "succinct progress measures for solving parity games"
    - "monadic second order logic and bisimulation invariance for coalgebras"
    - "the fixpoint iteration algorithm for parity games"
    - "completeness of flat coalgebraic fixpoint logics"

Connected through hyperedge HE-4 (induced by source paper "completeness for game logic"):
  with members:
    - "differential game logic"
    - "weak completeness of coalgebraic dynamic logics"

Connected through hyperedge HE-5 (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"
    - "non deterministic kleene coalgebras"
    - "completeness of flat coalgebraic fixpoint logics"

Connected through hyperedge HE-6 (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"
    - "coalgebraic automata theory basic results"

Connected through hyperedge HE-7 (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"
    - "pspace bounds for rank 1 modal logics"
    - "coalgebraic automata theory basic results"

Connected through hyperedge HE-8 (induced by source paper "permutation games for the weakly aconjunctive mu calculus"):
  with members:
    - "buchi determinization made tighter"
    - "determinising parity automata"
    - "the fixpoint iteration algorithm for parity games"

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)