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: "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.

Connected through hyperedge HE-1 (induced by source paper "robust expressive and quantitative linear temporal logics pick any two for free"):
  with members:
    - "robust expressive and quantitative linear temporal logics pick any two for free full version"
    - "robust expressive and quantitative linear temporal logics"
    - "synthesizing optimally resilient controllers"
    - "robust linear temporal logic"
    - "parametric linear dynamic logic"
    - "optimal bounds in parametric ltl games"

Connected through hyperedge HE-2 (induced by source paper "distributed synthesis for parameterized temporal logics"):
  with members:
    - "encodings of bounded synthesis"
    - "distributed prompt ltl synthesis"
    - "detecting unrealizability of distributed fault tolerant systems"
    - "assume guarantee synthesis for concurrent reactive programs with partial information"
    - "parametric linear dynamic logic"
    - "optimal bounds in parametric ltl games"

Connected through hyperedge HE-3 (induced by source paper "limit your consumption finding bounds in average energy games"):
  with members:
    - "average energy games"
    - "parametric linear dynamic logic"
    - "automated synthesis of reliable and efficient systems through game theory a case study"
    - "efficient controller synthesis for consumption games with multiple resource types"
    - "the complexity of multi mean payoff and multi energy games"
    - "strategy synthesis for multi dimensional quantitative objectives"
    - "energy parity games"
    - "better quality in synthesis through quantitative objectives"

Connected through hyperedge HE-4 (induced by source paper "approximating optimal bounds in prompt ltl realizability in doubly exponential time"):
  with members:
    - "encodings of bounded synthesis"
    - "parametric linear dynamic logic"
    - "optimal bounds in parametric ltl games"

Connected through hyperedge HE-5 (induced by source paper "distributed prompt ltl synthesis"):
  with members:
    - "parametric linear dynamic logic"
    - "optimal bounds in parametric ltl games"

Connected through hyperedge HE-6 (induced by source paper "parameterized linear temporal logics meet costs still not costlier than ltl full version"):
  with members:
    - "approximating optimal bounds in prompt ltl realizability in doubly exponential time"
    - "visibly linear dynamic logic"
    - "parametric linear dynamic logic full version"
    - "parametric linear dynamic logic"
    - "efficient controller synthesis for consumption games with multiple resource types"
    - "parity and streett games with costs"
    - "optimal bounds in parametric ltl games"
    - "energy parity games"

Connected through hyperedge HE-7 (induced by source paper "optimal strategy synthesis for request response games"):
  with members:
    - "parametric linear dynamic logic"
    - "efficient controller synthesis for consumption games with multiple resource types"
    - "optimal bounds in parametric ltl games"
    - "energy parity games"
    - "better quality in synthesis through quantitative objectives"

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)