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 "practical synthesis of reactive systems from ltl specifications via parity games"):
  Abstract: The synthesis - the automatic construction - of reactive systems from linear temporal logic (LTL) specifications has recently seen a revival of the classic automata-theoretic approach based on parity-tree-automata, which outperformed other synthesis approaches in the last synthesis competition (Syntcomp2018). We describe a complete synthesis procedure that is based on the translation of LTL to deterministic parity automata and the emptiness check of the corresponding tree automata. #R##N#The described approach is (1) structured, meaning that the states used in the construction have a structure, which is also (partly) preserved in the synthesis result, performs a (2) forward exploration and thus often only constructs a small subset of the reachable states, and is (3) incremental in the sense that it reuses results from previous unsuccessful solution attempts. We further explore the impact of different guiding heuristics that determine where to expand the on-the-fly built arena and present several mechanisms for extracting an implementation (Mealy machine or circuit). Furthermore, several data structures used in the implementation can be encoded symbolically reducing time and memory consumption. We compare the proposed techniques on the Syntcomp2017 benchmark set.

Includes members:
  Member "the 5th reactive synthesis competition syntcomp 2018 benchmarks participants results":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "towards neural guided program synthesis for linear temporal logic specifications")
  Member "bosy an experimentation framework for bounded synthesis":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "fbsat automatic inference of minimal finite state models of function blocks using sat solver")
  Member "bounded synthesis of reactive programs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "ltlf synthesis with fairness and stability assumptions")
  Member "one theorem to rule them all a unified translation of ltl into ω automata":
    also connected through other hyperedges:
      (none)
  Member "the 4th reactive synthesis competition syntcomp 2017 benchmarks participants results":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the challenges in specifying and explaining synthesized implementations of reactive systems")
  Member "ltl to deterministic emerson lei automata":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "ltl to smaller self loop alternating automata and back")
  Member "from ltl and limit deterministic b uchi automata to deterministic parity automata":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "semantic labelling and learning for parity game solving in ltl synthesis")
  Member "synthesizing functional reactive programs":
    also connected through other hyperedges:
      (none)

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)