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 emptiness of continuous time parametric timed automata"
  Abstract: Parametric timed automata extend the standard timed automata with the possibility to use parameters in the clock guards. In general, if the parameters are real-valued, the problem of language emptiness of such automata is undecidable even for various restricted subclasses. We thus focus on the case where parameters are assumed to be integer-valued, while the time still remains continuous. On the one hand, we show that the problem remains undecidable for parametric timed automata with three clocks and one parameter. On the other hand, for the case with arbitrary many clocks where only one of these clocks is compared with (an arbitrary number of) parameters, we show that the parametric language emptiness is decidable. The undecidability result tightens the bounds of a previous result which assumed six parameters, while the decidability result extends the existing approaches that deal with discrete-time semantics only. To the best of our knowledge, this is the first positive result in the case of continuous-time and unbounded integer parameters, except for the rather simple case of single-clock automata.

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 preservation problems in parametric timed automata"

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"
    - "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"
    - "language preservation problems in parametric timed automata"
    - "goal driven unfolding of petri nets"
    - "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 "a hypergraph based approach for the 4 constraint satisfaction problem tractability"):
  with members:
    - "schaefer s theorem for graphs"
    - "a new numerical abstract domain based on difference bound matrices"
    - "the octagon abstract domain"
    - "a static analyzer for large safety critical software"
    - "the essence of constraint propagation"

Connected through hyperedge HE-5 (induced by source paper "parametric updates in parametric timed automata"):
  with members:
    - "what s decidable about parametric timed automata"
    - "revisiting reachability in timed automata"
    - "mtl model checking of one clock parametric timed automata is undecidable"

Connected through hyperedge HE-6 (induced by source paper "parametric timed broadcast protocols"):
  with members:
    - "what s decidable about parametric timed automata"
    - "parameterized verification of safety properties in ad hoc network protocols"

Connected through hyperedge HE-7 (induced by source paper "minimal time synthesis for parametric timed automata"):
  with members:
    - "what s decidable about parametric timed automata"
    - "language preservation problems in parametric timed automata"

Connected through hyperedge HE-8 (induced by source paper "ltl parameter synthesis of parametric timed automata"):
  with members:
    - "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.FL(Formal Languages and Automata Theory)