human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "a van benthem theorem for quantitative probabilistic modal logic"):
  Abstract: In probabilistic transition systems, behavioural metrics provide a more fine-grained and stable measure of system equivalence than crisp notions of bisimilarity. They correlate strongly to quantitative probabilistic logics, and in fact the distance induced by a probabilistic modal logic taking values in the real unit interval has been shown to coincide with behavioural distance. For probabilistic systems, probabilistic modal logic thus plays an analogous role to that of Hennessy-Milner logic on classical labelled transition systems. In the quantitative setting, invariance of modal logic under bisimilarity becomes non-expansivity of formula evaluation w.r.t. behavioural distance. In the present paper, we provide a characterization of the expressive power of probabilistic modal logic based on this observation: We prove a probabilistic analogue of the classical van Benthem theorem, which states that modal logic is precisely the bisimulation-invariant fragment of first-order logic. Specifically, we show that quantitative probabilistic modal logic lies dense in the bisimulation- invariant fragment, in the indicated sense of non-expansive formula evaluation, of quantitative probabilistic first-order logic; more precisely, bisimulation-invariant first-order formulas are approximable by modal formulas of bounded rank.

Includes members:
  Member "a modal characterization theorem for a probabilistic fuzzy description logic":
    also connected through other hyperedges:
      (none)
  Member "a van benthem theorem for fuzzy modal logic":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "model comparison games for horn description logics")
  Member "a characterization theorem for a modal description logic":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a modal characterization theorem for a probabilistic fuzzy description logic")
  Member "metric bisimulation games and real valued modal logics for coalgebras":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "explaining non bisimilarity in a coalgebraic approach games and distinguishing formulas")
  Member "logical characterization of bisimulation metrics":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "quantitative aspects of programming languages and systems over the past 2 4 years and beyond")
  Member "monadic second order logic and bisimulation invariance for coalgebras":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "np reasoning in the monotone mu calculus")
  Member "behavioral metrics via functor lifting":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a modal characterization theorem for a probabilistic fuzzy description logic")
  Member "neighbourhood structures bisimilarity and basic model theory":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a van benthem theorem for fuzzy modal logic")

Question: Please tell me which class the source paper 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)