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 mitl and alternating timed automata over infinite words"
  Abstract: One clock alternating timed automata (OCATA) have been introduced as natural extension of (one clock) timed automata to express the semantics of MTL. In this paper, we consider the application of OCATA to the problems of model-checking and satisfiability for MITL (a syntactic fragment of MTL), interpreted over infinite words. Our approach is based on the interval semantics (recently introduced in [BEG13] in the case of finite words) extended to infinite words. We propose region-based and zone-based algorithms, based on this semantics, for MITL model-checking and satisfiability. We report on the performance of a prototype tool implementing those algorithms.

Connected through hyperedge HE-1 (induced by source paper "revisiting mitl to fix decision procedures"):
  with members:
    - "on mitl and alternating timed automata"

Connected through hyperedge HE-2 (induced by source paper "on the expressiveness and monitoring of metric temporal logic"):
  with members:
    - "on the complexity of temporal logic path checking"
    - "expressive completeness of metric temporal logic"
    - "when is metric temporal logic expressively complete"
    - "on expressive powers of timed logics comparing boundedness non punctuality and deterministic freezing"
    - "expressiveness of metric modalities for continuous time"
    - "on timed automata with input determined guards"
    - "alternating timed automata"
    - "the complexity of temporal logic over the reals"

Connected through hyperedge HE-3 (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 the decidability and complexity of metric temporal logic over finite words"
    - "expressiveness of metric modalities for continuous time"

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)