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: "abssynthe abstract synthesis from succinct safety specifications"
  Abstract: In this paper, we describe a synthesis algorithm for safety specifications described as circuits. Our algorithm is based on fixpoint computations, abstraction and refinement, it uses binary decision diagrams as symbolic data structure. We evaluate our tool on the benchmarks provided by the organizers of the synthesis competition organized within the SYNT'14 workshop.

Connected through hyperedge HE-1 (induced by source paper "what s hard about boolean functional synthesis"):
  with members:
    - "symbolic ltlf synthesis"
    - "towards parallel boolean functional synthesis"
    - "the second reactive synthesis competition syntcomp 2015"
    - "skolem functions for factored formulas"

Connected through hyperedge HE-2 (induced by source paper "the 4th reactive synthesis competition syntcomp 2017 benchmarks participants results"):
  with members:
    - "bosy an experimentation framework for bounded synthesis"
    - "encodings of bounded synthesis"
    - "solving qbf by abstraction"
    - "the first reactive synthesis competition syntcomp 2014"
    - "the reactive synthesis competition syntcomp 2016 and beyond"
    - "bounded cycle synthesis"
    - "the 3rd reactive synthesis competition syntcomp 2016 benchmarks participants results"
    - "a high level ltl synthesis format tlsf v1 1"

Connected through hyperedge HE-3 (induced by source paper "the first reactive synthesis competition syntcomp 2014"):
  with members:
    - "a high level ltl synthesis format tlsf v1 0"
    - "the second reactive synthesis competition syntcomp 2015"
    - "sat based methods for circuit synthesis"
    - "extended aiger format for synthesis"
    - "experimental aspects of synthesis"

Connected through hyperedge HE-4 (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-5 (induced by source paper "the 3rd reactive synthesis competition syntcomp 2016 benchmarks participants results"):
  with members:
    - "solving qbf by abstraction"
    - "the first reactive synthesis competition syntcomp 2014"
    - "the reactive synthesis competition syntcomp 2016 and beyond"
    - "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"
    - "parameterized synthesis case study amba ahb"

Connected through hyperedge HE-6 (induced by source paper "satisfiability based methods for reactive synthesis from safety specifications"):
  with members:
    - "the second reactive synthesis competition syntcomp 2015"
    - "incremental qbf solving"
    - "synthesizing multiple boolean functions using interpolation on a single proof"
    - "alpaga a tool for solving parity games with imperfect information"
    - "algorithms for omega regular games with imperfect information"

Connected through hyperedge HE-7 (induced by source paper "the second reactive synthesis competition syntcomp 2015"):
  with members:
    - "the first reactive synthesis competition syntcomp 2014"
    - "specification format for reactive synthesis problems"
    - "compositional algorithms for succinct safety games"
    - "sat based methods for circuit synthesis"
    - "incremental qbf solving"

Connected through hyperedge HE-8 (induced by source paper "structural synthesis for gxw specifications"):
  with members:
    - "shield synthesis runtime enforcement for reactive systems"
    - "g4ltl st automatic generation of plc programs"
    - "how to handle assumptions in 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)