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 "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).

Includes members:
  Member "answering conjunctive queries under updates":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "constant delay enumeration with fpt preprocessing for conjunctive queries of bounded submodular width")
  Member "first order logic with counting at least weak hanf normal forms always exist and can be computed":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "learning concepts definable in first order logic with counting")
  Member "answering ucqs under updates and in the presence of integrity constraints":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "constant delay enumeration with fpt preprocessing for conjunctive queries of bounded submodular width")
  Member "first order query evaluation with cardinality conditions":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "two dichotomies for model checking in multi layer structures")
  Member "deciding first order properties of nowhere dense graphs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "hitting topological minors is fpt")
  Member "first order query evaluation on structures of bounded degree":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "first order interpretations of bounded expansion classes")
  Member "first order queries on structures of bounded degree are computable with constant delay":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "constant delay enumeration with fpt preprocessing for conjunctive queries of bounded submodular width")

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)