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: "real time model checking parameters everywhere"
  Abstract: In this paper, we study the model-checking and parameter synthesis problems#N#of the logic TCTL over discrete-timed automata where parameters are allowed#N#both in the model (timed automaton) and in the property (temporal formula). Our#N#results are as follows. On the negative side, we show that the model-checking#N#problem of TCTL extended with parameters is undecidable over discrete-timed#N#automata with only one parametric clock. The undecidability result needs#N#equality in the logic. On the positive side, we show that the model-checking#N#and the parameter synthesis problems become decidable for a fragment of the#N#logic where equality is not allowed. Our method is based on automata theoretic#N#principles and an extension of our method to express durations of runs in timed#N#automata using Presburger arithmetic.

Connected through hyperedge HE-1 (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"
    - "on the decidability and complexity of metric temporal logic over finite words"
    - "the parma polyhedra library toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems"

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)