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 ltl and limit deterministic b uchi automata to deterministic parity automata"
  Abstract: Controller synthesis for general linear temporal logic (LTL) objectives is a challenging task. The standard approach involves translating the LTL objective into a deterministic parity automaton (DPA) by means of the Safra-Piterman construction. One of the challenges is the size of the DPA, which often grows very fast in practice, and can reach double exponential size in the length of the LTL formula. In this paper we describe a single exponential translation from limit-deterministic B\"uchi automata (LDBA) to DPA, and show that it can be concatenated with a recent efficient translation from LTL to LDBA to yield a double exponential, \enquote{Safraless} LTL-to-DPA construction. We also report on an implementation, a comparison with the SPOT library, and performance on several sets of formulas, including instances from the 2016 SyntComp competition.

Connected through hyperedge HE-1 (induced by source paper "practical synthesis of reactive systems from ltl specifications via parity games"):
  with members:
    - "the 5th reactive synthesis competition syntcomp 2018 benchmarks participants results"
    - "bosy an experimentation framework for bounded synthesis"
    - "bounded synthesis of reactive programs"
    - "one theorem to rule them all a unified translation of ltl into ω automata"
    - "the 4th reactive synthesis competition syntcomp 2017 benchmarks participants results"
    - "ltl to deterministic emerson lei automata"
    - "synthesizing functional reactive programs"
    - "the 3rd reactive synthesis competition syntcomp 2016 benchmarks participants results"

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"
    - "an automaton learning approach to solving safety games over infinite graphs"
    - "from ltl to deterministic automata a safraless compositional approach"
    - "from nondeterministic b uchi and streett automata to deterministic parity automata"

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 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"
    - "from nondeterministic b uchi and streett automata to deterministic parity automata"

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)