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 and parametric synthesis"):
  Abstract: We consider the synthesis of distributed implementations for specifications in Parametric Linear Temporal Logic (PLTL). PLTL 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 systems, we show that, despite being more powerful, the distributed realizability problem for PLTL is not harder than its LTL counterpart. The case of asynchronous systems requires assumptions on the scheduler beyond fairness to ensure that bounds can be met at all, i.e., even fair schedulers can delay processes arbitrary long and thereby prevent the system from satisfying its PLTL specification. Thus, we employ the concept of bounded fair scheduling, where every process is guaranteed to be scheduled in bounded intervals and give a semi-decision procedure for the resulting distributed assume-guarantee realizability problem.

Includes members:
  Member "parametric linear dynamic logic":
    also connected through other hyperedges:
      - Hyperedge HE-1 (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-2 (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)