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: "constant delay algorithms for regular document spanners"
  Abstract: Regular expressions and automata models with capture variables are core tools in rule-based information extraction. These formalisms, also called regular document spanners, use regular languages in order to locate the data that a user wants to extract from a text document, and then store this data into variables. Since document spanners can easily generate large outputs, it is important to have good evaluation algorithms that can generate the extracted data in a quick succession, and with relatively little precomputation time. Towards this goal, we present a practical evaluation algorithm that allows constant delay enumeration of a spanner's output after a precomputation phase that is linear in the document. While the algorithm assumes that the spanner is specified in a syntactic variant of variable set automata, we also study how it can be applied when the spanner is specified by general variable set automata, regex formulas, or spanner algebras. Finally, we study the related problem of counting the number of outputs of a document spanner, providing a fine grained analysis of the classes of document spanners that support efficient enumeration of their results.

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"
    - "document spanners for extracting incomplete information expressiveness and complexity"
    - "joining extractions of regular expressions"
    - "recursive programs for document spanners"

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"
    - "dynamic conjunctive queries"
    - "document spanners for extracting incomplete information expressiveness and complexity"
    - "recursive programs for document spanners"
    - "dynamic graph queries"

Connected through hyperedge HE-3 (induced by source paper "the complexity of aggregates over extractions by regular expressions"):
  with members:
    - "complexity bounds for relational algebra over document spanners"
    - "constant delay enumeration for nondeterministic document spanners"
    - "joining extractions of regular expressions"

Connected through hyperedge HE-4 (induced by source paper "the theory of concatenation over finite models"):
  with members:
    - "dynamic complexity of document spanners"
    - "matching patterns with variables"
    - "weight annotation in information extraction"
    - "constant delay enumeration for nondeterministic document spanners"
    - "split correctness in information extraction"
    - "deterministic regular expressions with back references"
    - "the hardness of solving simple word equations"
    - "decidability complexity and expressiveness of first order logic over the subword ordering"

Connected through hyperedge HE-5 (induced by source paper "weight annotation in information extraction"):
  with members:
    - "efficient logspace classes for enumeration counting and uniform generation"
    - "complexity bounds for relational algebra over document spanners"
    - "representing formal languages a comparison between finite automata and recurrent neural networks"
    - "constant delay enumeration for nondeterministic document spanners"
    - "document spanners for extracting incomplete information expressiveness and complexity"
    - "snorkel rapid training data creation with weak supervision"
    - "extracting automata from recurrent neural networks using queries and counterexamples"
    - "joining extractions of regular expressions"

Connected through hyperedge HE-6 (induced by source paper "complexity bounds for relational algebra over document spanners"):
  with members:
    - "rational recurrences"
    - "constant delay enumeration for nondeterministic 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"
    - "recursive programs for document spanners"
    - "semantics and complexity of sparql"

Connected through hyperedge HE-7 (induced by source paper "efficient logspace classes for enumeration counting and uniform generation"):
  with members:
    - "connecting knowledge compilation classes and width parameters"
    - "constant delay enumeration for nondeterministic document spanners"
    - "descriptive complexity for counting complexity classes"
    - "a circuit based approach to efficient enumeration"
    - "document spanners for extracting incomplete information expressiveness and complexity"
    - "joining extractions of regular expressions"
    - "foundations of modern query languages for graph databases"

Connected through hyperedge HE-8 (induced by source paper "constant delay enumeration for nondeterministic document spanners"):
  with members:
    - "enumeration on trees with tractable combined complexity and efficient updates"
    - "enumeration on trees under relabelings"
    - "answering fo mod queries under updates on bounded degree databases"
    - "a circuit based approach to efficient enumeration"
    - "answering conjunctive queries under updates"
    - "document spanners for extracting incomplete information expressiveness and complexity"
    - "joining extractions of regular expressions"
    - "answering ucqs under updates and in the presence of integrity constraints"

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)