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 "symbolic monitoring against specifications parametric in time and data"):
  Abstract: Monitoring consists in deciding whether a log meets a given specification. In this work, we propose an automata-based formalism to monitor logs in the form of actions associated with time stamps and arbitrarily data values over infinite domains. Our formalism uses both timing parameters and data parameters, and is able to output answers symbolic in these parameters and in the log segments where the property is satisfied or violated. We implemented our approach in an ad-hoc prototype SyMon, and experiments show that its high expressive power still allows for efficient online monitoring.

Includes members:
  Member "offline timed pattern matching under uncertainty":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "online quantitative timed pattern matching with semiring valued weighted automata")
  Member "efficient online timed pattern matching by automata based skipping":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "online quantitative timed pattern matching with semiring valued weighted automata")
  Member "montre a tool for monitoring timed regular expressions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "f1 10 an open source autonomous cyber physical platform")
  Member "verification for timed automata extended with unbounded discrete data structures":
    also connected through other hyperedges:
      (none)
  Member "the parma polyhedra library toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the deep learning compiler a comprehensive survey")
  Member "pushdown timed automata a binary reachability characterization and safety verification":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "effective definability of the reachability relation in timed automata")

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)