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: "on the decidability and complexity of metric temporal logic over finite words"
  Abstract: Metric Temporal Logic (MTL) is a prominent specification formalism for#N#real-time systems. In this paper, we show that the satisfiability problem for#N#MTL over finite timed words is decidable, with non-primitive recursive#N#complexity. We also consider the model-checking problem for MTL: whether all#N#words accepted by a given Alur-Dill timed automaton satisfy a given MTL#N#formula. We show that this problem is decidable over finite words. Over#N#infinite words, we show that model checking the safety fragment of MTL--which#N#includes invariance and time-bounded response properties--is also decidable.#N#These results are quite surprising in that they contradict various claims to#N#the contrary that have appeared in the literature.

Connected through hyperedge HE-1 (induced by source paper "model checking the interval way"):
  with members:
    - "complexity of timeline based planning over dense temporal domains exploring the middle ground"
    - "interval vs point temporal logic model checking an expressiveness comparison"
    - "model checking for fragments of halpern and shoham s interval temporal logic based on track representatives"
    - "on the complexity of model checking for syntactically maximal fragments of the interval temporal logic hs with regular expressions"
    - "checking interval properties of computations"
    - "complexity hierarchies beyond elementary"
    - "complexity of itl model checking some well behaved fragments of the interval logic hs"
    - "interval based synthesis"

Connected through hyperedge HE-2 (induced by source paper "what s decidable about parametric timed automata"):
  with members:
    - "language preservation problems in parametric timed automata"
    - "polynomial interrupt timed automata"
    - "language emptiness of continuous time parametric timed automata"
    - "interrupt timed automata with auxiliary clocks and parameters"
    - "mtl model checking of one clock parametric timed automata is undecidable"
    - "interrupt timed automata verification and expressiveness"
    - "real time model checking parameters everywhere"
    - "the parma polyhedra library toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems"

Connected through hyperedge HE-3 (induced by source paper "undecidability of future timeline based planning over dense temporal domains"):
  with members:
    - "complexity of timeline based planning over dense temporal domains exploring the middle ground"
    - "pddl2 1 an extension to pddl for expressing temporal planning domains"

Connected through hyperedge HE-4 (induced by source paper "revisiting timed logics with automata modalities"):
  with members:
    - "reachability in timed automata with diagonal constraints"
    - "buchi kamp theorems for 1 clock ata"
    - "making metric temporal logic rational"
    - "quantitative regular expressions for arrhythmia detection algorithms"
    - "metric temporal logic with counting"
    - "on mitl and alternating timed automata over infinite words"
    - "expressiveness of metric modalities for continuous time"

Connected through hyperedge HE-5 (induced by source paper "timed context free temporal logics"):
  with members:
    - "event clock nested automata"
    - "timed pushdown automata revisited"

Connected through hyperedge HE-6 (induced by source paper "complexity of timeline based planning over dense temporal domains exploring the middle ground"):
  with members:
    - "ltl with the freeze quantifier and register automata"

Connected through hyperedge HE-7 (induced by source paper "complexity hierarchies beyond elementary"):
  with members:
    - "relating timed and register automata"
    - "demystifying reachability in vector addition systems"
    - "nonelementary complexities for branching vass mell and extensions"
    - "on freeze ltl with ordered attributes"
    - "trace inclusion for one counter nets revisited"
    - "the power of priority channel systems"
    - "the parametric ordinal recursive complexity of post embedding problems"
    - "graph logics with rational relations"

Connected through hyperedge HE-8 (induced by source paper "a boyer moore type algorithm for timed pattern matching"):
  with members:
    - "robust online monitoring of signal temporal logic"
    - "on line monitoring for temporal logic robustness"

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)