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: "offline timed pattern matching under uncertainty"
  Abstract: Given a log and a specification, timed pattern matching aims at exhibiting for which start and end dates a specification holds on that log. For example, "a given action is always followed by another action before a given deadline". This problem has strong connections with monitoring real-time systems. We address here timed pattern matching in presence of an uncertain specification, i.e., that may contain timing parameters (e.g., the deadline can be uncertain or unknown). That is, we want to know for which start and end dates, and for what values of the deadline, this property holds. Or what is the minimum or maximum deadline (together with the corresponding start and end dates) for which this property holds. We propose here a framework for timed pattern matching based on parametric timed model checking. In contrast to most parametric timed problems, the solution is effectively computable, and we perform experiments using IMITATOR to show the applicability of our approach.

Connected through hyperedge HE-1 (induced by source paper "online quantitative timed pattern matching with semiring valued weighted automata"):
  with members:
    - "online parametric timed pattern matching with automata based skipping"
    - "symbolic monitoring against specifications parametric in time and data"
    - "monaa a tool for timed pattern matching with automata based acceleration"
    - "an algebraic framework for runtime verification"
    - "efficient online timed pattern matching by automata based skipping"
    - "montre a tool for monitoring timed regular expressions"
    - "a boyer moore type algorithm for timed pattern matching"
    - "robust online monitoring of signal temporal logic"

Connected through hyperedge HE-2 (induced by source paper "parametric verification an introduction"):
  with members:
    - "what s decidable about parametric timed automata"
    - "minimal time synthesis for parametric timed automata"
    - "language preservation problems in parametric timed automata"
    - "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-3 (induced by source paper "online parametric timed pattern matching with automata based skipping"):
  with members:
    - "monaa a tool for timed pattern matching with automata based acceleration"
    - "efficient online timed pattern matching by automata based skipping"
    - "montre a tool for monitoring timed regular expressions"
    - "a boyer moore type algorithm for timed pattern matching"
    - "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 "symbolic monitoring against specifications parametric in time and data"):
  with members:
    - "efficient online timed pattern matching by automata based skipping"
    - "montre a tool for monitoring timed regular expressions"
    - "verification for timed automata extended with unbounded discrete data structures"
    - "the parma polyhedra library toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems"
    - "pushdown timed automata a binary reachability characterization and safety verification"

Connected through hyperedge HE-5 (induced by source paper "repairing timed automata clock guards through abstraction and testing"):
  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.SY(Systems and Control)