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: "deterministic automata for the f g fragment of ltl"
  Abstract: When dealing with linear temporal logic properties in the setting of e.g. games or probabilistic systems, one often needs to express them as deterministic omega-automata. In order to translate LTL to deterministic omega-automata, the traditional approach first translates the formula to a non-deterministic B\"uchi automaton. Then a determinization procedure such as of Safra is performed yielding a deterministic \omega-automaton. We present a direct translation of the (F,G)-fragment of LTL into deterministic \omega-automata with no determinization procedure involved. Since our approach is tailored to LTL, we often avoid the typically unnecessarily large blowup caused by general determinization algorithms. We investigate the complexity of this translation and provide experimental results and compare them to the traditional method.

Connected through hyperedge HE-1 (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"
    - "from nondeterministic b uchi and streett automata to deterministic parity automata"

Connected through hyperedge HE-2 (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"
    - "from nondeterministic b uchi and streett automata to deterministic parity automata"

Connected through hyperedge HE-3 (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"
    - "automata with generalized rabin pairs for probabilistic model checking and ltl synthesis"
    - "trading performance for stability in markov decision processes"
    - "multi weighted automata and mso logic"
    - "a probabilistic temporal logic with frequency operators and its model checking"

Connected through hyperedge HE-4 (induced by source paper "verification of markov decision processes using learning algorithms"):
  with members:
    - "automata with generalized rabin pairs for probabilistic model checking and ltl synthesis"
    - "scalable verification of markov decision processes"
    - "lightweight monte carlo algorithm for markov decision processes"
    - "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"

Connected through hyperedge HE-5 (induced by source paper "from ltl to deterministic automata a safraless compositional approach"):
  with members:
    - "automata with generalized rabin pairs for probabilistic model checking and ltl synthesis"
    - "effective translation of ltl to deterministic rabin automata beyond the f g fragment"
    - "from nondeterministic b uchi and streett automata to deterministic parity automata"

Connected through hyperedge HE-6 (induced by source paper "profile trees for buchi word automata with application to determinization"):
  with members:
    - "state of buchi complementation"
    - "unifying buchi complementation constructions"
    - "b uchi complementation made tight"
    - "from nondeterministic b uchi and streett automata to deterministic parity automata"

Connected through hyperedge HE-7 (induced by source paper "automata with generalized rabin pairs for probabilistic model checking and ltl synthesis"):
  with members:
    - "from nondeterministic b uchi and streett automata to deterministic parity automata"

Connected through hyperedge HE-8 (induced by source paper "effective translation of ltl to deterministic rabin automata beyond the f g fragment"):
  with members:
    - "automata with generalized rabin pairs for probabilistic model checking and ltl synthesis"

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)