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: "recursive programs for document spanners"
  Abstract: A document spanner models a program for Information Extraction (IE) as a function that takes as input a text document (string over a finite alphabet) and produces a relation of spans (intervals in the document) over a predefined schema. A well studied language for expressing spanners is that of the regular spanners: relational algebra over regex formulas, which are obtained by adding capture variables to regular expressions. Equivalently, the regular spanners are the ones expressible in non-recursive Datalog over regex formulas (extracting relations that play the role of EDBs from the input document). In this paper, we investigate the expressive power of recursive Datalog over regex formulas. Our main result is that such programs capture precisely the document spanners computable in polynomial time. Additional results compare recursive programs to known formalisms such as the language of core spanners (that extends regular spanners by allowing to test for string equality) and its closure under difference. Finally, we extend our main result to a recently proposed framework that generalizes both the relational model and document spanners.

Connected through hyperedge HE-1 (induced by source paper "grammars for document spanenrs"):
  with members:
    - "complexity bounds for relational algebra over document spanners"
    - "weight annotation in information extraction"
    - "finite models and the theory of concatenation"
    - "constant delay enumeration for nondeterministic document spanners"
    - "split correctness in information extraction"
    - "constant delay algorithms for regular document spanners"
    - "document spanners for extracting incomplete information expressiveness and complexity"
    - "joining extractions of regular expressions"

Connected through hyperedge HE-2 (induced by source paper "dynamic complexity of document spanners"):
  with members:
    - "complexity bounds for relational algebra over document spanners"
    - "constant delay enumeration for nondeterministic document spanners"
    - "split correctness in information extraction"
    - "constant delay algorithms for regular document spanners"
    - "dynamic conjunctive queries"
    - "document spanners for extracting incomplete information expressiveness and complexity"
    - "dynamic graph queries"

Connected through hyperedge HE-3 (induced by source paper "complexity bounds for relational algebra over document spanners"):
  with members:
    - "rational recurrences"
    - "constant delay enumeration for nondeterministic document spanners"
    - "constant delay algorithms for regular document spanners"
    - "document spanners for extracting incomplete information expressiveness and complexity"
    - "extracting automata from recurrent neural networks using queries and counterexamples"
    - "enumeration complexity of conjunctive queries with functional dependencies"
    - "joining extractions of regular expressions"
    - "semantics and complexity of sparql"

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