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 "promptness and bounded fairness in concurrent and parameterized systems"):
  Abstract: We investigate the satisfaction of specifications in Prompt Linear Temporal Logic (Prompt-LTL) by concurrent systems. Prompt-LTL is an extension of LTL that allows to specify parametric bounds on the satisfaction of eventualities, thereby adding a quantitative aspect to the specification language. We establish a connection between bounded fairness, bounded stutter equivalence, and the satisfaction of Prompt-LTL\X formulas. Based on this connection, we prove the first cutoff results for different classes of systems with a parametric number of components and quantitative specifications, thereby identifying previously unknown decidable fragments of the parameterized model checking problem.

Includes members:
  Member "distributed synthesis for parameterized temporal logics":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "parameterized synthesis for fragments of first order logic over data words")
  Member "analyzing guarded protocols better cutoffs more systems more expressivity":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "structural invariants for the verification of systems with parameterized architectures")
  Member "tight cutoffs for guarded protocols with fairness":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "structural invariants for the verification of systems with parameterized architectures")
  Member "parameterized synthesis case study amba ahb":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "practical synthesis of reactive systems from ltl specifications via parity games")
  Member "decidability problems for actor systems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "resource aware automata and games for optimal synthesis")
  Member "parameterized model checking of timed systems with conjunctive guards":
    also connected through other hyperedges:
      (none)
  Member "parametric linear dynamic logic":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "robust expressive and quantitative linear temporal logics pick any two for free")
  Member "parameterized model checking of token passing systems":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "analyzing guarded protocols better cutoffs more systems more expressivity")

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)