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 "grammars for document spanenrs"):
  Abstract: A new grammar-based language for defining information-extractors from textual content based on the document spanners framework of Fagin et al.~is proposed. While studied languages for document spanners are mainly built upon regex formulas, which are regular expressions extended with variables, this new language is based on context-free grammars. The expressiveness of these grammars is compared with previously studied classes of spanners and the complexity of their evaluation is discussed. An enumeration algorithm that outputs the results with constant delay after cubic preprocessing in the input document is presented.

Includes members:
  Member "complexity bounds for relational algebra over document spanners":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "dynamic complexity of document spanners")
  Member "weight annotation in information extraction":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the theory of concatenation over finite models")
  Member "finite models and the theory of concatenation":
    also connected through other hyperedges:
      (none)
  Member "constant delay enumeration for nondeterministic document spanners":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "dynamic complexity of document spanners")
  Member "split correctness in information extraction":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "dynamic complexity of document spanners")
  Member "constant delay algorithms for regular document spanners":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "dynamic complexity of document spanners")
  Member "document spanners for extracting incomplete information expressiveness and complexity":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "dynamic complexity of document spanners")
  Member "joining extractions of regular expressions":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "the complexity of aggregates over extractions by regular expressions")

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.DB(Databases)