human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "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.

Includes members:
  Member "automata with generalized rabin pairs for probabilistic model checking and ltl synthesis":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "near linear time algorithms for streett objectives in graphs and mdps")
  Member "effective translation of ltl to deterministic rabin automata beyond the f g fragment":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "ltl to smaller self loop alternating automata and back")
  Member "deterministic automata for the f g fragment of ltl":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "one theorem to rule them all a unified translation of ltl into ω automata")
  Member "from nondeterministic b uchi and streett automata to deterministic parity automata":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "cautious reinforcement learning with logical constraints")

Question: Please tell me which class the source paper 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)