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: "from nondeterministic b uchi and streett automata to deterministic parity automata"
  Abstract: In this paper we revisit Safra's determinization constructions for automata on infinite words. We show how to construct deterministic automata with fewer states and, most importantly, parity acceptance conditions. Determinization is used in numerous applications, such as reasoning about tree automata, satisfiability of CTL*, and realizability and synthesis of logical specifications. The upper bounds for all these applications are reduced by using the smaller deterministic automata produced by our construction. In addition, the parity acceptance conditions allows to use more efficient algorithms (when compared to handling Rabin or Streett acceptance conditions).

Connected through hyperedge HE-1 (induced by source paper "cautious reinforcement learning with logical constraints"):
  with members:
    - "certified reinforcement learning with logic guidance"
    - "rethinking the discount factor in reinforcement learning a decision theoretic approach"
    - "reinforcement learning for temporal logic control synthesis with probabilistic satisfaction guarantees"
    - "modular deep reinforcement learning with temporal logic specifications"
    - "verifiably safe off model reinforcement learning"
    - "logically constrained reinforcement learning"
    - "logically constrained neural fitted q iteration"
    - "shielded decision making in mdps"

Connected through hyperedge HE-2 (induced by source paper "semantic labelling and learning for parity game solving in ltl synthesis"):
  with members:
    - "bosy an experimentation framework for bounded synthesis"
    - "oink an implementation and evaluation of modern parity game solvers"
    - "the 4th reactive synthesis competition syntcomp 2017 benchmarks participants results"
    - "efficient parallel strategy improvement for parity games"
    - "from ltl and limit deterministic b uchi automata to deterministic parity automata"
    - "an automaton learning approach to solving safety games over infinite graphs"
    - "from ltl to deterministic automata a safraless compositional approach"

Connected through hyperedge HE-3 (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"
    - "automata with generalized rabin pairs for probabilistic model checking and ltl synthesis"
    - "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"

Connected through hyperedge HE-4 (induced by source paper "the density of linear time properties"):
  with members:
    - "the complexity of counting models of linear time temporal logic"

Connected through hyperedge HE-5 (induced by source paper "decision problems for subclasses of rational relations over finite and infinite words"):
  with members:
    - "on equivalence and uniformisation problems for finite transducers"

Connected through hyperedge HE-6 (induced by source paper "planning and synthesis under assumptions"):
  with members:
    - "assume admissible synthesis"

Connected through hyperedge HE-7 (induced by source paper "an ordered approach to solving parity games in quasi polynomial time and quasi linear space"):
  with members:
    - "symmetric strategy improvement"
    - "improved algorithms for one pair and k pair streett objectives"
    - "an exponential lower bound for the latest deterministic strategy iteration algorithms"
    - "non oblivious strategy improvement"

Connected through hyperedge HE-8 (induced by source paper "index appearance record for transforming rabin automata into parity automata"):
  with members:
    - "from ltl to deterministic automata a safraless compositional approach"
    - "effective translation of ltl to deterministic rabin automata beyond the f g fragment"
    - "deterministic automata for the f g fragment of ltl"

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)