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: "parametric linear dynamic logic full version"
  Abstract: We introduce Parametric Linear Dynamic Logic (PLDL), which extends Linear Dynamic Logic (LDL) by temporal operators equipped with parameters that bound their scope. LDL itself was proposed as an extension of Linear Temporal Logic (LTL) that is able to express all omega-regular specifications while still maintaining many of LTL's desirable properties like intuitive syntax and semantics and a translation into non-deterministic B\"uchi automata of exponential size. But LDL lacks capabilities to express timing constraints. By adding parameterized operators to LDL, we obtain a logic that is able to express all omega-regular properties and that subsumes parameterized extensions of LTL like Parametric LTL and PROMPT-LTL. #R##N#Our main technical contribution is a translation of PLDL formulas into non-deterministic B\"uchi automata of exponential size via alternating automata. This yields polynomial space algorithms for model checking and assume-guarantee model checking and a realizability algorithm with doubly-exponential running time. All three problems are also shown to be complete for these complexity classes. Moreover, we give tight upper and lower bounds on optimal parameter values for model checking and realizability. Using these bounds, we present a polynomial space procedure for model checking optimization and an algorithm with triply-exponential running time for realizability optimization. Our results show that PLDL model checking and realizability are no harder than their respective (parametric) LTL counterparts.

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

Connected through hyperedge HE-2 (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"
    - "parameterized linear temporal logics meet costs still not costlier than ltl"
    - "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"

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)