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: "symbolic vs bounded synthesis for petri games"
  Abstract: Petri games are a multiplayer game model for the automatic synthesis of distributed systems. We compare two fundamentally different approaches for solving Petri games. The symbolic approach decides the existence of a winning strategy via a reduction to a two-player game over a finite graph, which in turn is solved by a fixed point iteration based on binary decision diagrams (BDDs). The bounded synthesis approach encodes the existence of a winning strategy, up to a given bound on the size of the strategy, as a quantified Boolean formula (QBF). In this paper, we report on initial experience with a prototype implementation of the bounded synthesis approach. We compare bounded synthesis to the existing implementation of the symbolic approach in the synthesis tool ADAM. We present experimental results on a collection of benchmarks, including one new benchmark family, modeling manufacturing and workflow scenarios with multiple concurrent processes.

Connected through hyperedge HE-1 (induced by source paper "translating asynchronous games for distributed synthesis full version"):
  with members:
    - "high level representation of benchmark families for petri games"
    - "synthesis in distributed environments"
    - "on the control of asynchronous automata"
    - "automated synthesis of distributed controllers"
    - "distributed synthesis for acyclic architectures"
    - "petri games synthesis of distributed systems with causal memory"
    - "asynchronous games over tree architectures"

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

Connected through hyperedge HE-3 (induced by source paper "solving qbf by abstraction"):
  with members:
    - "bosy an experimentation framework for bounded synthesis"
    - "on expansion and resolution in cegar based qbf solving"
    - "encodings of bounded synthesis"
    - "the 4th reactive synthesis competition syntcomp 2017 benchmarks participants results"
    - "the first reactive synthesis competition syntcomp 2014"
    - "the 3rd reactive synthesis competition syntcomp 2016 benchmarks participants results"
    - "detecting unrealizability of distributed fault tolerant systems"
    - "petri games synthesis of distributed systems with causal memory"

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)