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: "monadic second order logic and bisimulation invariance for coalgebras"
  Abstract: Generalizing standard monadic second-order logic for Kripke models, we introduce monadic second-order logic interpreted over coalgebras for an arbitrary set functor. Similar to well-known results for monadic second-order logic over trees, we provide a translation of this logic into a class of automata, relative to the class of coalgebras that admit a tree-like supporting Kripke frame. We then consider invariance under behavioral equivalence of formulas; more in particular, we investigate whether the coalgebraic mu-calculus is the bisimulation-invariant fragment of monadic second-order logic. Building on recent results by the third author we show that in order to provide such a coalgebraic generalization of the Janin-Walukiewicz Theorem, it suffices to find what we call an adequate uniform construction for the functor. As applications of this result we obtain a partly new proof of the Janin-Walukiewicz Theorem, and bisimulation invariance results for the bag functor (graded modal logic) and all exponential polynomial functors. #R##N#Finally, we consider in some detail the monotone neighborhood functor, which provides coalgebraic semantics for monotone modal logic. It turns out that there is no adequate uniform construction for this functor, whence the automata-theoretic approach towards bisimulation invariance does not apply directly. This problem can be overcome if we consider global bisimulations between neighborhood models: one of our main technical results provides a characterization of the monotone modal mu-calculus extended with the global modalities, as the fragment of monadic second-order logic for the monotone neighborhood functor that is invariant for global bisimulations.

Connected through hyperedge HE-1 (induced by source paper "np reasoning in the monotone mu calculus"):
  with members:
    - "completeness for game logic"
    - "exptime tableaux for the coalgebraic mu calculus"

Connected through hyperedge HE-2 (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"
    - "the fixpoint iteration algorithm for parity games"
    - "exptime tableaux for the coalgebraic mu calculus"
    - "completeness of flat coalgebraic fixpoint logics"

Connected through hyperedge HE-3 (induced by source paper "a van benthem theorem for quantitative probabilistic modal logic"):
  with members:
    - "a modal characterization theorem for a probabilistic fuzzy description logic"
    - "a van benthem theorem for fuzzy modal logic"
    - "a characterization theorem for a modal description logic"
    - "metric bisimulation games and real valued modal logics for coalgebras"
    - "logical characterization of bisimulation metrics"
    - "behavioral metrics via functor lifting"
    - "neighbourhood structures bisimilarity and basic model theory"
    - "approximating a behavioural pseudometric without discount for probabilistic systems"

Connected through hyperedge HE-4 (induced by source paper "a van benthem theorem for fuzzy modal logic"):
  with members:
    - "bisimulation metrics for weighted automata"
    - "a characterization theorem for a modal description logic"
    - "a van benthem theorem for modal team semantics"
    - "behavioral metrics via functor lifting"
    - "neighbourhood structures bisimilarity and basic model theory"

Connected through hyperedge HE-5 (induced by source paper "disjunctive bases normal forms and model theory for modal logics"):
  with members:
    - "uniform interpolation for coalgebraic fixpoint logic"
    - "completeness for the coalgebraic cover modality"
    - "exptime tableaux for the coalgebraic mu calculus"
    - "pspace bounds for rank 1 modal logics"
    - "coalgebraic automata theory basic results"

Connected through hyperedge HE-6 (induced by source paper "expressiveness of the modal mu calculus on monotone neighborhood structures"):
  with members:
    - "exptime tableaux for the coalgebraic mu calculus"

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)