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: "language preservation problems in parametric timed automata"
  Abstract: Parametric timed automata (PTA) are a powerful formalism to model and reason about concurrent systems with some unknown timing delays. In this paper, we address the (untimed) language- and trace-preservation problems: given a reference parameter valuation, does there exist another parameter valuation with the same untimed language, or with the same set of traces? We show that these problems are undecidable both for general PTA and for the restricted class of L/U-PTA, even for integer-valued parameters, or over bounded time. On the other hand, we exhibit decidable subclasses: 1-clock PTA, and 1-parameter deterministic L-PTA and U-PTA. We also consider robust versions of these problems, where we additionally require that the language be preserved for all valuations between the reference valuation and the new valuation.

Connected through hyperedge HE-1 (induced by source paper "consistency in parametric interval probabilistic timed automata"):
  with members:
    - "what s decidable about parametric timed automata"
    - "language emptiness of continuous time parametric timed automata"

Connected through hyperedge HE-2 (induced by source paper "what s decidable about parametric timed automata"):
  with members:
    - "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"
    - "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 "parametric verification an introduction"):
  with members:
    - "what s decidable about parametric timed automata"
    - "minimal time synthesis for parametric timed automata"
    - "offline timed pattern matching under uncertainty"
    - "goal driven unfolding of petri nets"
    - "language emptiness of continuous time parametric timed automata"
    - "on selective unboundedness of vass"
    - "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-4 (induced by source paper "minimal time synthesis for parametric timed automata"):
  with members:
    - "what s decidable about parametric timed automata"
    - "language emptiness of continuous time parametric timed automata"

Connected through hyperedge HE-5 (induced by source paper "the language preservation problem is undecidable for parametric event recording automata"):
  with members:
    - "what s decidable about parametric timed automata"

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)