human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "online quantitative timed pattern matching with semiring valued weighted automata"):
  Abstract: Monitoring of a signal plays an essential role in the runtime verification of cyber-physical systems. Qualitative timed pattern matching is one of the mathematical formulations of monitoring, which gives a Boolean verdict for each sub-signal according to the satisfaction of the given specification. There are two orthogonal directions of extension of the qualitative timed pattern matching. One direction on the result is quantitative: what engineers want is often not a qualitative verdict but the quantitative measurement of the satisfaction of the specification. The other direction on the algorithm is online checking: the monitor returns some verdicts before obtaining the entire signal, which enables to monitor a running system. It is desired from application viewpoints. In this paper, we conduct these two extensions, taking an automata-based approach. This is the first quantitative and online timed pattern matching algorithm to the best of our knowledge. More specifically, we employ what we call timed symbolic weighted automata to specify quantitative specifications to be monitored, and we obtain an online algorithm using the shortest distance of a weighted variant of the zone graph and dynamic programming. Moreover, our problem setting is semiring-based and therefore, general. Our experimental results confirm the scalability of our algorithm for specifications with a time-bound.

Includes members:
  Member "online parametric timed pattern matching with automata based skipping":
    also connected through other hyperedges:
      (none)
  Member "symbolic monitoring against specifications parametric in time and data":
    also connected through other hyperedges:
      (none)
  Member "offline timed pattern matching under uncertainty":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "parametric verification an introduction")
  Member "monaa a tool for timed pattern matching with automata based acceleration":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "online parametric timed pattern matching with automata based skipping")
  Member "an algebraic framework for runtime verification":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a survey of challenges for runtime verification from advanced application domains beyond software")
  Member "efficient online timed pattern matching by automata based skipping":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "online parametric timed pattern matching with automata based skipping")
  Member "montre a tool for monitoring timed regular expressions":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "f1 10 an open source autonomous cyber physical platform")
  Member "a boyer moore type algorithm for timed pattern matching":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "online parametric timed pattern matching with automata based skipping")

Question: Please tell me which class the source paper 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)