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: "visibly linear dynamic logic"
  Abstract: We introduce Visibly Linear Dynamic Logic (VLDL), which extends Linear Temporal Logic (LTL) by temporal operators that are guarded by visibly pushdown languages over finite words. In VLDL one can, e.g., express that a function resets a variable to its original value after its execution, even in the presence of an unbounded number of intermediate recursive calls. We prove that VLDL describes exactly the $\omega$-visibly pushdown languages. Thus it is strictly more expressive than LTL and able to express recursive properties of programs with unbounded call stacks. #R##N#The main technical contribution of this work is a translation of VLDL into $\omega$-visibly pushdown automata of exponential size via one-way alternating jumping automata. This translation yields exponential-time algorithms for satisfiability, validity, and model checking. We also show that visibly pushdown games with VLDL winning conditions are solvable in triply-exponential time. We prove all these problems to be complete for their respective complexity classes.

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

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

Connected through hyperedge HE-3 (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"
    - "parametric linear dynamic logic full version"
    - "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-4 (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"
    - "parametric linear dynamic logic full version"
    - "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)