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: "weak bisimulation for coalgebras over order enriched monads"
  Abstract: The paper introduces the notion of a weak bisimulation for coalgebras whose#N#type is a monad satisfying some extra properties. In the first part of the#N#paper we argue that systems with silent moves should be modelled#N#coalgebraically as coalgebras whose type is a monad. We show that the visible#N#and invisible part of the functor can be handled internally inside a monadic#N#structure. In the second part we introduce the notion of an ordered saturation#N#monad, study its properties, and show that it allows us to present two#N#approaches towards defining weak bisimulation for coalgebras and compare them.#N#We support the framework presented in this paper by two main examples of#N#models: labelled transition systems and simple Segala systems.

Connected through hyperedge HE-1 (induced by source paper "up to techniques for branching bisimilarity"):
  with members:
    - "divide and congruence iii from decomposition of modal formulas to preservation of stability and divergence"
    - "distributive laws for monotone specifications"
    - "divide and congruence ii from decomposition of modal formulas to preservation of delay and weak bisimilarity"
    - "extracting verified decision procedures dpll and resolution"

Connected through hyperedge HE-2 (induced by source paper "a coalgebraic take on regular and omega regular behaviours"):
  with members:
    - "coalgebraic trace semantics for buechi and parity automata"
    - "killing epsilons with a dagger a coalgebraic study of systems with algebraic label structure"
    - "behavioural equivalences for coalgebras with unobservable moves"
    - "on coalgebras with internal moves"
    - "corecursive algebras corecursive monads and bloom monads"
    - "generic trace semantics via coinduction"

Connected through hyperedge HE-3 (induced by source paper "behavioural equivalences for timed systems"):
  with members:
    - "behavioural equivalences for coalgebras with unobservable moves"
    - "on coalgebras with internal moves"
    - "lax functors and coalgebraic weak bisimulation"
    - "gsos for non deterministic processes with quantitative aspects"
    - "structural operational semantics for non deterministic processes with quantitative aspects"
    - "coalgebraic weak bisimulation from recursive equations over monads"
    - "coinduction up to in a fibrational setting"
    - "coalgebraic trace semantics for continuous probabilistic transition systems"

Connected through hyperedge HE-4 (induced by source paper "behavioural equivalences for coalgebras with unobservable moves"):
  with members:
    - "killing epsilons with a dagger a coalgebraic study of systems with algebraic label structure"
    - "on coalgebras with internal moves"
    - "gsos for non deterministic processes with quantitative aspects"
    - "structural operational semantics for non deterministic processes with quantitative aspects"
    - "coalgebraic weak bisimulation from recursive equations over monads"
    - "coalgebraic trace semantics for continuous probabilistic transition systems"
    - "weak bisimulations for labelled transition systems weighted over semirings"
    - "generalizing determinization from automata to coalgebras"

Connected through hyperedge HE-5 (induced by source paper "killing epsilons with a dagger a coalgebraic study of systems with algebraic label structure"):
  with members:
    - "behavioural equivalences for coalgebras with unobservable moves"
    - "presenting distributive laws"
    - "on coalgebras with internal moves"
    - "coalgebraic weak bisimulation from recursive equations over monads"
    - "generic trace semantics via coinduction"

Connected through hyperedge HE-6 (induced by source paper "lax functors and coalgebraic weak bisimulation"):
  with members:
    - "behavioural equivalences for coalgebras with unobservable moves"
    - "on coalgebras with internal moves"
    - "coalgebraic weak bisimulation from recursive equations over monads"
    - "stochastic timed automata"
    - "relating coalgebraic notions of bisimulation"
    - "generic trace semantics via coinduction"

Connected through hyperedge HE-7 (induced by source paper "coalgebraic weak bisimulation from recursive equations over monads"):
  with members:
    - "weak bisimulations for labelled transition systems weighted over semirings"
    - "bisimulation of labeled state to function transition systems of stochastic process languages"
    - "relating coalgebraic notions of bisimulation"
    - "generic trace semantics via coinduction"

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)