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 to deterministic automata a safraless compositional approach"
  Abstract: We present a new algorithm to construct a deterministic Rabin automaton for an LTL formula $\varphi$. The automaton is the product of a master automaton and an array of slave automata, one for each $G$-subformula of $\varphi$. The slave automaton for $G\psi$ is in charge of recognizing whether $FG\psi$ holds. As opposed to standard determinization procedures, the states of all our automata have a clear logical structure, which allows to apply various optimizations. Our construction subsumes former algorithms for fragments of LTL. Experimental results show improvement in the sizes of the resulting automata compared to existing methods.

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

Connected through hyperedge HE-2 (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"
    - "improved algorithms for parity and streett objectives"
    - "automata with generalized rabin pairs for probabilistic model checking and ltl synthesis"

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"
    - "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"

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

Connected through hyperedge HE-5 (induced by source paper "index appearance record for transforming rabin automata into parity automata"):
  with members:
    - "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-6 (induced by source paper "ltl semantic tableaux and alternating omega automata via linear factors"):
  with members:
    - "a new rule for ltl tableaux"
    - "partial derivative automaton for regular expressions with shuffle"

Connected through hyperedge HE-7 (induced by source paper "interpretable apprenticeship learning with temporal logic specifications"):
  with members:
    - "probably approximately correct mdp learning and control with temporal logic constraints"
    - "incremental sampling based algorithm for minimum violation motion planning"

Connected through hyperedge HE-8 (induced by source paper "markov chains and unambiguous b uchi automata"):
  with members:
    - "model checking markov chains against unambiguous buchi automata"
    - "two variable vs linear temporal logic in model checking and games"
    - "optimal bounds in parametric ltl 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)