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: "metric bisimulation games and real valued modal logics for coalgebras"
  Abstract: Behavioural equivalences can be characterized via bisimulations, modal logics and spoiler-defender games. In this paper we review these three perspectives in a coalgebraic setting, which allows us to generalize from the particular branching type of a transition system. We are interested in qualitative notions (classical bisimulation) as well as quantitative notions (bisimulation metrics). #R##N#Our first contribution is to introduce a spoiler-defender bisimulation game for coalgebras in the classical case. Second, we introduce such games for the metric case and furthermore define a real-valued modal coalgebraic logic, from which we can derive the strategy of the spoiler. For this logic we show a quantitative version of the Hennessy-Milner theorem.

Connected through hyperedge HE-1 (induced by source paper "explaining non bisimilarity in a coalgebraic approach games and distinguishing formulas"):
  with members:
    - "codensity games for bisimilarity"
    - "predicate liftings and functor presentations in coalgebraic expression languages"
    - "efficient coalgebraic partition refinement"
    - "games for bisimulations and abstraction"
    - "simulations and bisimulations for coalgebraic modal logics"

Connected through hyperedge HE-2 (induced by source paper "computing probabilistic bisimilarity distances for probabilistic automata"):
  with members:
    - "on the metric based approximate minimization of markov chains"
    - "on the equivalence of game and denotational semantics for the probabilistic mu calculus"
    - "approximating a behavioural pseudometric without discount for probabilistic systems"

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"
    - "logical characterization of bisimulation metrics"
    - "monadic second order logic and bisimulation invariance for coalgebras"
    - "behavioral metrics via functor lifting"
    - "neighbourhood structures bisimilarity and basic model theory"
    - "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)