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"
  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 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 an intuitive syntax 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. Our main technical contribution is a translation of PLDL formulas into non-deterministic B\"uchi word automata of exponential size via alternating automata. This yields a PSPACE model checking algorithm and a realizability algorithm with doubly-exponential running time. Furthermore, we give tight upper and lower bounds on optimal parameter values for both problems. These results show that PLDL model checking and realizability are not harder than LTL model checking and realizability.

Connected through hyperedge HE-1 (induced by source paper "promptness and bounded fairness in concurrent and parameterized systems"):
  with members:
    - "distributed synthesis for parameterized temporal logics"
    - "analyzing guarded protocols better cutoffs more systems more expressivity"
    - "tight cutoffs for guarded protocols with fairness"
    - "parameterized synthesis case study amba ahb"
    - "decidability problems for actor systems"
    - "parameterized model checking of timed systems with conjunctive guards"
    - "parameterized model checking of token passing systems"
    - "parameterized verification of asynchronous shared memory systems"

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

Connected through hyperedge HE-3 (induced by source paper "temporal logics with language parameters"):
  with members:
    - "visibly linear dynamic logic"
    - "extended computation tree logic"

Connected through hyperedge HE-4 (induced by source paper "propositional dynamic logic for hyperproperties"):
  with members:
    - "complete axiomatizations for reasoning about knowledge and time"

Connected through hyperedge HE-5 (induced by source paper "a survey of challenges for runtime verification from advanced application domains beyond software"):
  with members:
    - "adventures in monitorability from branching to linear time and back again"
    - "after you please browser extensions order attacks and countermeasures"
    - "selective monitoring"
    - "monitoring data minimisation"
    - "on the monitoring of decentralized specifications semantics properties analysis and simulation"
    - "an algebraic framework for runtime verification"
    - "learning to protect communications with adversarial neural cryptography"
    - "a web based tool for analysing normative documents in english"

Connected through hyperedge HE-6 (induced by source paper "quantitative reductions and vertex ranked infinite games"):
  with members:
    - "easy to win hard to master optimal strategies in parity games with costs"
    - "window parity games an alternative approach toward parity games with time bounds"
    - "average energy games"
    - "meet your expectations with guarantees beyond worst case synthesis in quantitative games"
    - "the complexity of multi mean payoff and multi energy games"
    - "measuring permissiveness in parity games mean payoff parity games revisited"
    - "generalized mean payoff and energy games"
    - "energy parity games"

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

Connected through hyperedge HE-8 (induced by source paper "quantitative reductions and vertex ranked infinite games full version"):
  with members:
    - "easy to win hard to master optimal strategies in parity games with costs"
    - "window parity games an alternative approach toward parity games with time bounds"
    - "average energy games"
    - "parity and streett games with costs"
    - "down the borel hierarchy solving muller games via safety games"
    - "playing muller games in a hurry"
    - "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)