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: "on coalgebras with internal moves"
  Abstract: In the first part of the paper we recall the coalgebraic approach to handling the so-called invisible transitions that appear in different state-based systems semantics. We claim that these transitions are always part of the unit of a certain monad. Hence, coalgebras with internal moves are exactly coalgebras over a monadic type. The rest of the paper is devoted to supporting our claim by studying two important behavioural equivalences for state-based systems with internal moves, namely: weak bisimulation and trace semantics. #R##N#We continue our research on weak bisimulations for coalgebras over order enriched monads. The key notions used in this paper and proposed by us in our previous work are the notions of an order saturation monad and a saturator. A saturator operator can be intuitively understood as a reflexive, transitive closure operator. There are two approaches towards defining saturators for coalgebras with internal moves. Here, we give necessary conditions for them to yield the same notion of weak bisimulation. #R##N#Finally, we propose a definition of trace semantics for coalgebras with silent moves via a uniform fixed point operator. We compare strong and weak bisimilation together with trace semantics for coalgebras with internal steps.

Connected through hyperedge HE-1 (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"
    - "weak bisimulation for coalgebras over order enriched monads"
    - "behavioural equivalences for coalgebras with unobservable moves"
    - "corecursive algebras corecursive monads and bloom monads"
    - "generic trace semantics via coinduction"

Connected through hyperedge HE-2 (induced by source paper "behavioural equivalences for timed systems"):
  with members:
    - "weak bisimulation for coalgebras over order enriched monads"
    - "behavioural equivalences for coalgebras with unobservable 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-3 (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"
    - "weak bisimulation for coalgebras over order enriched monads"
    - "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-4 (induced by source paper "killing epsilons with a dagger a coalgebraic study of systems with algebraic label structure"):
  with members:
    - "weak bisimulation for coalgebras over order enriched monads"
    - "behavioural equivalences for coalgebras with unobservable moves"
    - "presenting distributive laws"
    - "coalgebraic weak bisimulation from recursive equations over monads"
    - "generic trace semantics via coinduction"

Connected through hyperedge HE-5 (induced by source paper "structural operational semantics for non deterministic processes with quantitative aspects"):
  with members:
    - "killing epsilons with a dagger a coalgebraic study of systems with algebraic label structure"
    - "behavioural equivalences for coalgebras with unobservable moves"
    - "a definition scheme for quantitative bisimulation"
    - "distributive laws and decidable properties of sos specifications"
    - "gsos for non deterministic processes with quantitative aspects"
    - "coalgebraic weak bisimulation from recursive equations over monads"
    - "weak bisimulations for labelled transition systems weighted over semirings"
    - "tree rules in probabilistic transition system specifications with negative and quantitative premises"

Connected through hyperedge HE-6 (induced by source paper "lax functors and coalgebraic weak bisimulation"):
  with members:
    - "weak bisimulation for coalgebras over order enriched monads"
    - "behavioural equivalences for coalgebras with unobservable 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 "gsos for non deterministic processes with quantitative aspects"):
  with members:
    - "weak bisimulations for labelled transition systems weighted over semirings"
    - "abstract gsos rules and a modular treatment of recursive definitions"
    - "tree rules in probabilistic transition system specifications with negative and quantitative premises"
    - "bisimulation of labeled state to function transition systems of stochastic process languages"
    - "uniform labeled transition systems for nondeterministic probabilistic and stochastic process calculi"
    - "approximating a behavioural pseudometric without discount for probabilistic systems"

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)