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: "probabilistic modal mu calculus with independent product"
  Abstract: The probabilistic modal {\mu}-calculus is a fixed-point logic designed for expressing properties of probabilistic labeled transition systems (PLTS's). Two equivalent semantics have been studied for this logic, both assigning to each state a value in the interval [0,1] representing the probability that the property expressed by the formula holds at the state. One semantics is denotational and the other is a game semantics, specified in terms of two-player stochastic parity games. A shortcoming of the probabilistic modal {\mu}-calculus is the lack of expressiveness required to encode other important temporal logics for PLTS's such as Probabilistic Computation Tree Logic (PCTL). To address this limitation we extend the logic with a new pair of operators: independent product and coproduct. The resulting logic, called probabilistic modal {\mu}-calculus with independent product, can encode many properties of interest and subsumes the qualitative fragment of PCTL. The main contribution of this paper is the definition of an appropriate game semantics for this extended probabilistic {\mu}-calculus. This relies on the definition of a new class of games which generalize standard two-player stochastic (parity) games by allowing a play to be split into concurrent subplays, each continuing their evolution independently. Our main technical result is the equivalence of the two semantics. The proof is carried out in ZFC set theory extended with Martin's Axiom at an uncountable cardinal.

Connected through hyperedge HE-1 (induced by source paper "the uniform measure of simple regular sets of infinite trees"):
  with members:
    - "conjunctive queries on probabilistic graphs combined complexity"
    - "on the problem of computing the probability of regular sets of trees"
    - "model checking stochastic branching processes"

Connected through hyperedge HE-2 (induced by source paper "probabilistic logics based on riesz spaces"):
  with members:
    - "łukasiewicz mu calculus"

Connected through hyperedge HE-3 (induced by source paper "on computing the measures of first order definable sets of trees"):
  with members:
    - "conjunctive queries on probabilistic graphs combined complexity"
    - "on the problem of computing the probability of regular sets of trees"
    - "model checking stochastic branching processes"

Connected through hyperedge HE-4 (induced by source paper "xpl an extended probabilistic logic for probabilistic transition systems"):
  with members:
    - "greatest fixed points of probabilistic min max polynomial equations and reachability for branching markov decision processes"
    - "on the problem of computing the probability of regular sets of trees"
    - "model checking with probabilistic tabled logic programming"
    - "model checking stochastic branching processes"
    - "polynomial time algorithms for branching markov decision processes and probabilistic min max polynomial bellman equations"

Connected through hyperedge HE-5 (induced by source paper "on the problem of computing the probability of regular sets of trees"):
  with members:
    - "łukasiewicz mu calculus"
    - "model checking stochastic branching processes"

Connected through hyperedge HE-6 (induced by source paper "compositionality for quantitative specifications"):
  with members:
    - "refinement and difference for probabilistic automata"
    - "structural refinement for the modal nu calculus"
    - "hennessy milner logic with greatest fixed points as a complete behavioural specification theory"
    - "a robust specification theory for modal event clock automata"
    - "weighted modal transition systems"
    - "a parametric counterexample refinement approach for robust timed specifications"

Connected through hyperedge HE-7 (induced by source paper "probably safe or live"):
  with members:
    - "bounded satisfiability for pctl"
    - "assume guarantee abstraction refinement for probabilistic systems"
    - "measuring and synthesizing systems in probabilistic environments"

Connected through hyperedge HE-8 (induced by source paper "łukasiewicz mu calculus"):
  with members:
    - "on the equivalence of game and denotational semantics for the probabilistic mu calculus"
    - "characterising probabilistic processes logically"

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)