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: "efficient online timed pattern matching by automata based skipping"
  Abstract: The timed pattern matching problem is an actively studied topic because of its relevance in monitoring of real-time systems. There one is given a log $w$ and a specification $\mathcal{A}$ (given by a timed word and a timed automaton in this paper), and one wishes to return the set of intervals for which the log $w$, when restricted to the interval, satisfies the specification $\mathcal{A}$. In our previous work we presented an efficient timed pattern matching algorithm: it adopts a skipping mechanism inspired by the classic Boyer--Moore (BM) string matching algorithm. In this work we tackle the problem of online timed pattern matching, towards embedded applications where it is vital to process a vast amount of incoming data in a timely manner. Specifically, we start with the Franek-Jennings-Smyth (FJS) string matching algorithm---a recent variant of the BM algorithm---and extend it to timed pattern matching. Our experiments indicate the efficiency of our FJS-type algorithm in online and offline timed pattern matching.

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"
    - "offline timed pattern matching under uncertainty"
    - "monaa a tool for timed pattern matching with automata based acceleration"
    - "an algebraic framework for runtime verification"
    - "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 "online parametric timed pattern matching with automata based skipping"):
  with members:
    - "offline timed pattern matching under uncertainty"
    - "monaa a tool for timed pattern matching with automata based acceleration"
    - "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-3 (induced by source paper "symbolic monitoring against specifications parametric in time and data"):
  with members:
    - "offline timed pattern matching under uncertainty"
    - "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-4 (induced by source paper "offline timed pattern matching under uncertainty"):
  with members:
    - "what s decidable about parametric timed automata"
    - "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-5 (induced by source paper "moore machine filtering for timed and untimed pattern matching"):
  with members:
    - "montre a tool for monitoring timed regular expressions"
    - "a boyer moore type algorithm for timed pattern matching"

Connected through hyperedge HE-6 (induced by source paper "monaa a tool for timed pattern matching with automata based acceleration"):
  with members:
    - "montre a tool for monitoring timed regular expressions"
    - "a boyer moore type algorithm for timed pattern matching"

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)