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: "logical characterization of bisimulation metrics"
  Abstract: Bisimulation metrics provide a robust and accurate approach to study the behavior of nondeterministic probabilistic processes. In this paper, we propose a logical characterization of bisimulation metrics based on a simple probabilistic variant of the Hennessy-Milner logic. Our approach is based on the novel notions of mimicking formulae and distance between formulae. The former are a weak version of the well known characteristic formulae and allow us to characterize also (ready) probabilistic simulation and probabilistic bisimilarity. The latter is a 1-bounded pseudometric on formulae that mirrors the Hausdorff and Kantorovich lifting the defining bisimilarity pseudometric. We show that the distance between two processes equals the distance between their own mimicking formulae.

Connected through hyperedge HE-1 (induced by source paper "quantitative aspects of programming languages and systems over the past 2 4 years and beyond"):
  with members:
    - "paws a tool for the analysis of weighted systems"
    - "divide and conquer variable set separation in hybrid systems reachability analysis"
    - "logical characterization of trace metrics"
    - "design and optimisation of the flyfast front end for attribute based coordination"
    - "language based abstractions for dynamical systems"
    - "limit your consumption finding bounds in average energy games"
    - "mela modelling in ecology with location attributes"
    - "quantitative information flow for scheduler dependent systems"

Connected through hyperedge HE-2 (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"
    - "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"

Connected through hyperedge HE-3 (induced by source paper "trace and testing metrics on nondeterministic probabilistic processes"):
  with members:
    - "sos based modal decomposition on nondeterministic probabilistic processes"
    - "logical characterization of trace metrics"
    - "revisiting trace and testing equivalences for nondeterministic and probabilistic processes"
    - "the spectrum of strong behavioral equivalences for nondeterministic and probabilistic processes"
    - "characterising testing preorders for finite probabilistic processes"

Connected through hyperedge HE-4 (induced by source paper "sos based modal decomposition on nondeterministic probabilistic processes"):
  with members:
    - "divide and congruence ii from decomposition of modal formulas to preservation of delay and weak bisimilarity"
    - "logical characterization of trace metrics"
    - "revisiting trace and testing equivalences for nondeterministic and probabilistic processes"
    - "logical metric and algorithmic characterisations of probabilistic bisimulation"

Connected through hyperedge HE-5 (induced by source paper "bisimulation games on coalgebras"):
  with members:
    - "a van benthem theorem for fuzzy modal logic"
    - "behavioral metrics via functor lifting"
    - "simulations and bisimulations for coalgebraic modal logics"
    - "relating coalgebraic notions of bisimulation"

Connected through hyperedge HE-6 (induced by source paper "logical characterization of trace metrics"):
  with members:
    - "revisiting trace and testing equivalences for nondeterministic and probabilistic processes"
    - "logical metric and algorithmic characterisations of probabilistic bisimulation"
    - "game refinement relations and metrics"

Connected through hyperedge HE-7 (induced by source paper "compositional bisimulation metric reasoning with probabilistic process calculi"):
  with members:
    - "fixed point characterization of compositionality properties of probabilistic processes combinators"
    - "compositionality of approximate bisimulation for probabilistic systems"
    - "tree rules in probabilistic transition system specifications with negative and quantitative premises"

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)