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 "parameterized linear temporal logics meet costs still not costlier than ltl"):
  Abstract: We continue the investigation of parameterized extensions of Linear Temporal Logic (LTL) that retain the attractive algorithmic properties of LTL: a polynomial space model checking algorithm and a doubly-exponential time algorithm for solving games. Alur et al. and Kupferman et al. showed that this is the case for Parametric LTL (PLTL) and PROMPT-LTL respectively, which have temporal operators equipped with variables that bound their scope in time. Later, this was also shown to be true for Parametric LDL (PLDL), which extends PLTL to be able to express all ω-regular properties. Here, we generalize PLTL to systems with costs, i.e., we do not bound the scope of operators in time, but bound the scope in terms of the cost accumulated during time. Again, we show that model checking and solving games for specifications in PLTL with costs is not harder than the corresponding problems for LTL. Finally, we discuss PLDL with costs and extensions to multiple cost functions.

Includes members:
  Member "approximating optimal bounds in prompt ltl realizability in doubly exponential time":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "parameterized linear temporal logics meet costs still not costlier than ltl full version")
  Member "visibly linear dynamic logic":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "temporal logics with language parameters")
  Member "parametric linear dynamic logic full version":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "parameterized linear temporal logics meet costs still not costlier than ltl full version")
  Member "parameterized linear temporal logics meet costs still not costlier than ltl full version":
    also connected through other hyperedges:
      (none)
  Member "parametric linear dynamic logic":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "promptness and bounded fairness in concurrent and parameterized systems")
  Member "weak mso u with path quantifiers over infinite trees":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "recursion schemes the mso logic and the u quantifier")
  Member "efficient controller synthesis for consumption games with multiple resource types":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "energy mean payoff games")
  Member "parity and streett games with costs":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "resource aware automata and games for optimal synthesis")

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)