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: "automata with generalized rabin pairs for probabilistic model checking and ltl synthesis"
  Abstract: The model-checking problem for probabilistic systems crucially relies on the translation of LTL to deterministic Rabin automata (DRW). Our recent Safraless translation for the LTL(F,G) fragment produces smaller automata as compared to the traditional approach. In this work, instead of DRW we consider deterministic automata with acceptance condition given as disjunction of generalized Rabin pairs (DGRW). The Safraless translation of LTL(F,G) formulas to DGRW results in smaller automata as compared to DRW. We present algorithms for probabilistic model-checking as well as game solving for DGRW conditions. Our new algorithms lead to improvement both in terms of theoretical bounds as well as practical evaluation. We compare PRISM with and without our new translation, and show that the new translation leads to significant improvements.

Connected through hyperedge HE-1 (induced by source paper "near linear time algorithms for streett objectives in graphs and mdps"):
  with members:
    - "decremental strongly connected components and single source reachability in near linear time"
    - "a storm is coming a modern probabilistic model checker"
    - "improved algorithms for one pair and k pair streett objectives"
    - "from ltl to deterministic automata a safraless compositional approach"
    - "improved algorithms for parity and streett objectives"

Connected through hyperedge HE-2 (induced by source paper "ltl to smaller self loop alternating automata and back"):
  with members:
    - "ltl to deterministic emerson lei automata"
    - "effective translation of ltl to deterministic rabin automata beyond the f g fragment"
    - "truly on the fly ltl model checking"

Connected through hyperedge HE-3 (induced by source paper "omega regular objectives in model free reinforcement learning"):
  with members:
    - "certified reinforcement learning with logic guidance"
    - "an investigation of model free planning"
    - "logically correct reinforcement learning"
    - "reinforcement learning with temporal logic rewards"
    - "verification of markov decision processes using learning algorithms"
    - "a learning based approach to control synthesis of markov decision processes for linear temporal logic specifications"
    - "probably approximately correct mdp learning and control with temporal logic constraints"
    - "lazy probabilistic model checking without determinisation"

Connected through hyperedge HE-4 (induced by source paper "one theorem to rule them all a unified translation of ltl into ω automata"):
  with members:
    - "index appearance record for transforming rabin automata into parity automata"
    - "from ltl and limit deterministic b uchi automata to deterministic parity automata"
    - "from ltl to deterministic automata a safraless compositional approach"
    - "lazy probabilistic model checking without determinisation"
    - "effective translation of ltl to deterministic rabin automata beyond the f g fragment"
    - "deterministic automata for the f g fragment of ltl"
    - "from nondeterministic b uchi and streett automata to deterministic parity automata"

Connected through hyperedge HE-5 (induced by source paper "symbolic algorithms for graphs and markov decision processes with fairness objectives"):
  with members:
    - "lower bounds for symbolic computation on graphs strongly connected components liveness safety and diameter"
    - "a storm is coming a modern probabilistic model checker"
    - "improved algorithms for one pair and k pair streett objectives"
    - "from ltl to deterministic automata a safraless compositional approach"

Connected through hyperedge HE-6 (induced by source paper "an efficient synthesis algorithm for parametric markov chains against linear time properties"):
  with members:
    - "from ltl to deterministic automata a safraless compositional approach"
    - "decisive markov chains"

Connected through hyperedge HE-7 (induced by source paper "controller synthesis for mdps and frequency ltl setminus gu"):
  with members:
    - "on frequency ltl in probabilistic systems"
    - "percentile queries in multi dimensional markov decision processes"
    - "from ltl to deterministic automata a safraless compositional approach"
    - "markov decision processes with multiple long run averageobjectives"
    - "trading performance for stability in markov decision processes"
    - "multi weighted automata and mso logic"
    - "deterministic automata for the f g fragment of ltl"
    - "a probabilistic temporal logic with frequency operators and its model checking"

Connected through hyperedge HE-8 (induced by source paper "verification of markov decision processes using learning algorithms"):
  with members:
    - "scalable verification of markov decision processes"
    - "lightweight monte carlo algorithm for markov decision processes"
    - "deterministic automata for the f g fragment of ltl"
    - "uppaal smc statistical model checking for priced timed automata"
    - "cross entropy optimisation of importance sampling parameters for statistical model checking"
    - "an o n 2 time algorithm for alternating b uchi games"

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)