human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "distributed synthesis for parameterized temporal logics"):
  Abstract: We consider the synthesis of distributed implementations for specifications in parameterized temporal logics such as PROMPT-LTL, which extends LTL by temporal operators equipped with parameters that bound their scope. For single process synthesis it is well-established that such parametric extensions do not increase worst-case complexities. For synchronous distributed systems we show that, despite being more powerful, the realizability problem for PROMPT-LTL is not harder than its LTL counterpart. For asynchronous systems we have to express scheduling assumptions and therefore consider an assume-guarantee synthesis problem. As asynchronous distributed synthesis is already undecidable for LTL, we give a semi-decision procedure for the PROMPT-LTL assume-guarantee synthesis problem based on bounded synthesis. Finally, we show that our results extend to the stronger logics PLTL and PLDL.

Includes members:
  Member "encodings of bounded synthesis":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fbsat automatic inference of minimal finite state models of function blocks using sat solver")
  Member "distributed prompt ltl synthesis":
    also connected through other hyperedges:
      (none)
  Member "parameterized linear temporal logics meet costs still not costlier than ltl":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "robust expressive and quantitative linear temporal logics pick any two for free")
  Member "detecting unrealizability of distributed fault tolerant systems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the challenges in specifying and explaining synthesized implementations of reactive systems")
  Member "assume guarantee synthesis for concurrent reactive programs with partial information":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the reactive synthesis competition syntcomp 2016 and beyond")
  Member "parametric linear dynamic logic":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "promptness and bounded fairness in concurrent and parameterized systems")
  Member "optimal bounds in parametric ltl games":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "robust expressive and quantitative linear temporal logics pick any two for free")

Question: Please tell me which class the source paper 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)