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: "answering fo mod queries under updates on bounded degree databases"
  Abstract: We investigate the query evaluation problem for fixed queries over fully dynamic databases, where tuples can be inserted or deleted. The task is to design a dynamic algorithm that immediately reports the new result of a fixed query after every database update. We consider queries in first-order logic (FO) and its extension with modulo-counting quantifiers (FO+MOD), and show that they can be efficiently evaluated under updates, provided that the dynamic database does not exceed a certain degree bound. #R##N#In particular, we construct a data structure that allows to answer a Boolean FO+MOD query and to compute the size of the result of a non-Boolean query within constant time after every database update. Furthermore, after every update we are able to immediately enumerate the new query result with constant delay between the output tuples. The time needed to build the data structure is linear in the size of the database. Our results extend earlier work on the evaluation of first-order queries on static databases of bounded degree and rely on an effective Hanf normal form for FO+MOD recently obtained by Heimberg, Kuske, and Schweikardt (LICS 2016).

Connected through hyperedge HE-1 (induced by source paper "constant delay enumeration with fpt preprocessing for conjunctive queries of bounded submodular width"):
  with members:
    - "enumeration on trees under relabelings"
    - "covers of query results"
    - "constraint solving via fractional edge covers"
    - "answering conjunctive queries under updates"
    - "compressed representations of conjunctive query results"
    - "answering ucqs under updates and in the presence of integrity constraints"
    - "what do shannon type inequalities submodular width and disjunctive datalog have to do with one another"
    - "tractable hypergraph properties for constraint satisfaction and conjunctive queries"

Connected through hyperedge HE-2 (induced by source paper "ranked enumeration of conjunctive query results"):
  with members:
    - "any k anytime top k tree pattern retrieval in labeled graphs"
    - "size bounds and query plans for relational joins"
    - "answering conjunctive queries under updates"
    - "compressed representations of conjunctive query results"
    - "skew strikes back new developments in the theory of join algorithms"
    - "fdb a query engine for factorised relational databases"
    - "optimal aggregation algorithms for middleware"

Connected through hyperedge HE-3 (induced by source paper "incremental techniques for large scale dynamic query processing"):
  with members:
    - "counting triangles under updates in worst case optimal time"
    - "incremental view maintenance with triple lock factorization benefits"
    - "answering conjunctive queries under updates"
    - "answering ucqs under updates and in the presence of integrity constraints"
    - "linview incremental view maintenance for complex analytical queries"
    - "dbtoaster higher order delta processing for dynamic frequently fresh views"

Connected through hyperedge HE-4 (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"
    - "constant delay algorithms for regular document spanners"
    - "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"

Connected through hyperedge HE-5 (induced by source paper "enumeration on trees with tractable combined complexity and efficient updates"):
  with members:
    - "constant delay enumeration for nondeterministic document spanners"
    - "enumeration on trees under relabelings"
    - "constant delay algorithms for regular document spanners"
    - "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"

Connected through hyperedge HE-6 (induced by source paper "answering conjunctive queries under updates"):
  with members:
    - "size bounds and query plans for relational joins"
    - "dynamic conjunctive queries"
    - "faster online matrix vector multiplication"
    - "unifying and strengthening hardness for dynamic problems via the online matrix vector multiplication conjecture"
    - "joins via geometric resolutions worst case and beyond"
    - "a trichotomy in the complexity of counting answers to conjunctive queries"
    - "structural tractability of counting of solutions to conjunctive queries"
    - "beyond worst case analysis for joins with minesweeper"

Connected through hyperedge HE-7 (induced by source paper "first order logic with counting at least weak hanf normal forms always exist and can be computed"):
  with members:
    - "answering conjunctive queries under updates"
    - "an optimal construction of hanf sentences"
    - "automatic structures of bounded degree revisited"
    - "first order queries on structures of bounded degree are computable with constant delay"

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)