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: "a van benthem theorem for fuzzy modal logic"
  Abstract: We present a fuzzy (or quantitative) version of the van Benthem theorem, which characterizes propositional modal logic as the bisimulation-invariant fragment of first-order logic. Specifically, we consider a first-order fuzzy predicate logic along with its modal fragment, and show that the fuzzy first-order formulas that are non-expansive w.r.t. the natural notion of bisimulation distance are exactly those that can be approximated by fuzzy modal formulas.

Connected through hyperedge HE-1 (induced by source paper "model comparison games for horn description logics"):
  with members:
    - "query inseparability for alc ontologies"
    - "learning first order definable concepts over structures of small degree"
    - "dichotomies in ontology mediated querying with the guarded fragment"
    - "the data complexity of description logic ontologies"
    - "the complexity of reverse engineering problems for conjunctive queries"
    - "on the expressive power of sub propositional fragments of modal logic"
    - "querying the guarded fragment"
    - "simulations and bisimulations for coalgebraic modal logics"

Connected through hyperedge HE-2 (induced by source paper "a modal characterization theorem for a probabilistic fuzzy description logic"):
  with members:
    - "probability logic"
    - "a characterization theorem for a modal description logic"
    - "behavioral metrics via functor lifting"

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 characterization theorem for a modal description logic"
    - "metric bisimulation games and real valued modal logics for coalgebras"
    - "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"

Connected through hyperedge HE-4 (induced by source paper "bisimulation games on coalgebras"):
  with members:
    - "logical characterization of bisimulation metrics"
    - "behavioral metrics via functor lifting"
    - "simulations and bisimulations for coalgebraic modal logics"
    - "relating coalgebraic notions of bisimulation"

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)