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: "synthesizing robust systems with ratsy"
  Abstract: Speciﬁcations for reactive systems often consist of environment assumptions and system guarantees.An implementation should not only be correct, but also robust in the sense that it behaves reasonablyeven when the assumptions are (temporarily) violated. We present an extension of the requirementsanalysis and synthesis tool RATSY that is able to synthesize robust systems from GR(1) speciﬁca-tions, i.e., system in which a ﬁnite number of safety assumption violations is guaranteed to induceonly a ﬁnite number of safety guarantee violations. We show how the speciﬁcation can be turnedinto a two-pair Streett game, and how a winning strategy corresponding to a correct and robust im-plementation can be computed. Finally, we provide some experimental results.

Connected through hyperedge HE-1 (induced by source paper "the challenges in specifying and explaining synthesized implementations of reactive systems"):
  with members:
    - "bosy an experimentation framework for bounded synthesis"
    - "synthesizing skeletons for reactive systems"
    - "strategy representation by decision trees in reactive synthesis"
    - "reactive synthesis towards output sensitive algorithms"
    - "the 4th reactive synthesis competition syntcomp 2017 benchmarks participants results"
    - "bounded cycle synthesis"
    - "structural synthesis for gxw specifications"
    - "counterexample explanation by learning small strategies in markov decision processes"

Connected through hyperedge HE-2 (induced by source paper "high level representation of benchmark families for petri games"):
  with members:
    - "symbolic vs bounded synthesis for petri games"
    - "synthesis in distributed environments"
    - "distributed synthesis for acyclic architectures"
    - "petri games synthesis of distributed systems with causal memory"
    - "asynchronous games over tree architectures"

Connected through hyperedge HE-3 (induced by source paper "reactive synthesis towards output sensitive algorithms"):
  with members:
    - "bosy an experimentation framework for bounded synthesis"
    - "encodings of bounded synthesis"
    - "bounded cycle synthesis"

Connected through hyperedge HE-4 (induced by source paper "how to handle assumptions in synthesis"):
  with members:
    - "doomsday equilibria for omega regular games"
    - "the complexity of admissibility in omega regular games"
    - "meet your expectations with guarantees beyond worst case synthesis in quantitative games"
    - "rapid recovery for systems with scarce faults"
    - "measuring and synthesizing systems in probabilistic environments"
    - "better quality in synthesis through quantitative objectives"
    - "environment assumptions for 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)