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 enumeration for nondeterministic document spanners"
  Abstract: We consider the information extraction approach known as document spanners, and study the problem of efficiently computing the results of the extraction from an input document, where the extraction task is described as a sequential variable-set automaton (VA). We pose this problem in the setting of enumeration algorithms, where we can first run a preprocessing phase and must then produce the results with a small delay between any two consecutive results. Our goal is to have an algorithm which is tractable in combined complexity, i.e., in the input document and in the VA; while ensuring the best possible data complexity bounds in the input document, in particular constant delay in the document. Several recent works at PODS'18 proposed such algorithms but with linear delay in the document or with an exponential dependency in the (generally nondeterministic) input VA. Florenzano et al. suggest that our desired runtime guarantees cannot be met for general sequential VAs. We refute this and show that, given a nondeterministic sequential VA and an input document, we can enumerate the mappings of the VA on the document with the following bounds: the preprocessing is linear in the document size and polynomial in the size of the VA, and the delay is independent of the document and polynomial in the size of the VA. The resulting algorithm thus achieves tractability in combined complexity and the best possible data complexity bounds. Moreover, it is rather easy to describe, in particular for the restricted case of so-called extended VAs.

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"
    - "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"
    - "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"
    - "split correctness in information extraction"
    - "constant delay algorithms for regular document spanners"
    - "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 algorithms for regular 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"
    - "split correctness in information extraction"
    - "deterministic regular expressions with back references"
    - "constant delay algorithms for regular document spanners"
    - "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 algorithms for regular 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 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"
    - "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"
    - "descriptive complexity for counting complexity classes"
    - "constant delay algorithms for regular document spanners"
    - "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 "enumeration on trees with tractable combined complexity and efficient updates"):
  with members:
    - "enumeration on trees under relabelings"
    - "constant delay algorithms for regular document spanners"
    - "answering fo mod queries under updates on bounded degree databases"
    - "a circuit based approach to efficient enumeration"
    - "answering conjunctive queries under updates"
    - "enumeration complexity of conjunctive queries with functional dependencies"
    - "answering ucqs under updates and in the presence of integrity constraints"
    - "powers of tensors and fast matrix multiplication"

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)