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: "a ltl fragment for gr 1 synthesis"
  Abstract: The idea of automatic synthesis of reactive programs starting from temporal logic (LTL) speciﬁca-tions is quite old, but was commonly thought to be infeasible due to the known double exponentialcomplexity of the problem. However, new ideas have recently renewed the interest in LTL synthesis:One major new contribution in this area is the recent work of Piterman et al. who showed how poly-nomial time synthesis can be achieved for a large class of LTL speciﬁcations that is expressive enoughto cover many practical examples. These LTL speciﬁcations are equivalent to w-automata having aso-called GR(1) acceptance condition. This approach has been used to automatically synthesize im-plementations of real-world applications. To this end, manually written deterministic w-automatahaving GR(1) conditions were used instead of the original LTL speciﬁcations. However, manuallygenerating deterministic monitors is, of course, a hard and error-prone task. In this paper, we there-fore present algorithms to automatically translate speciﬁcations of a remarkable large fragment ofLTL to deterministic monitors having a GR(1) acceptance condition so that the synthesis algorithmscan start with more readable LTL speciﬁcations.

Connected through hyperedge HE-1 (induced by source paper "the reactive synthesis competition syntcomp 2016 and beyond"):
  with members:
    - "solving qbf by abstraction"
    - "the first reactive synthesis competition syntcomp 2014"
    - "satisfiability based methods for reactive synthesis from safety specifications"
    - "the 3rd reactive synthesis competition syntcomp 2016 benchmarks participants results"
    - "a high level ltl synthesis format tlsf v1 1"
    - "specification format for reactive synthesis problems"
    - "the second reactive synthesis competition syntcomp 2015"
    - "compositional algorithms for succinct safety games"

Connected through hyperedge HE-2 (induced by source paper "a high level ltl synthesis format tlsf v1 1"):
  with members:
    - "the first reactive synthesis competition syntcomp 2014"
    - "the reactive synthesis competition syntcomp 2016 and beyond"
    - "the 3rd reactive synthesis competition syntcomp 2016 benchmarks participants results"
    - "a high level ltl synthesis format tlsf v1 0"
    - "the second reactive synthesis competition syntcomp 2015"
    - "extended aiger format for synthesis"
    - "experimental aspects of synthesis"

Connected through hyperedge HE-3 (induced by source paper "a multi paradigm language for reactive synthesis"):
  with members:
    - "parameterized synthesis case study amba ahb"
    - "experimental aspects of 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)