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: "synthesis from probabilistic components"
  Abstract: Synthesis is the automatic construction of a system from its specification.#N#In classical synthesis algorithms, it is always assumed that the system is#N#"constructed from scratch" rather than composed from reusable components. This,#N#of course, rarely happens in real life, where almost every non-trivial#N#commercial software system relies heavily on using libraries of reusable#N#components. Furthermore, other contexts, such as web-service orchestration, can#N#be modeled as synthesis of a system from a library of components. Recently,#N#Lustig and Vardi introduced dataflow and control-flow synthesis from libraries#N#of reusable components. They proved that dataflow synthesis is undecidable,#N#while control-flow synthesis is decidable. In this work, we consider the#N#problem of control-flow synthesis from libraries of probabilistic components .#N#We show that this more general problem is also decidable.

Connected through hyperedge HE-1 (induced by source paper "the complexity of synthesis from probabilistic components"):
  with members:
    - "the complexity of partial observation stochastic parity games with finite memory strategies"
    - "a reduction from parity games to simple stochastic games"
    - "randomness for free"

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)