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 conjunctive queries under updates"):
  Abstract: We consider the task of enumerating and counting answers to $k$-ary conjunctive queries against relational databases that may be updated by inserting or deleting tuples. We exhibit a new notion of q-hierarchical conjunctive queries and show that these can be maintained efficiently in the following sense. During a linear time preprocessing phase, we can build a data structure that enables constant delay enumeration of the query results; and when the database is updated, we can update the data structure and restart the enumeration phase within constant time. For the special case of self-join free conjunctive queries we obtain a dichotomy: if a query is not q-hierarchical, then query enumeration with sublinear$^\ast$ delay and sublinear update time (and arbitrary preprocessing time) is impossible. #R##N#For answering Boolean conjunctive queries and for the more general problem of counting the number of solutions of k-ary queries we obtain complete dichotomies: if the query's homomorphic core is q-hierarchical, then size of the the query result can be computed in linear time and maintained with constant update time. Otherwise, the size of the query result cannot be maintained with sublinear update time. All our lower bounds rely on the OMv-conjecture, a conjecture on the hardness of online matrix-vector multiplication that has recently emerged in the field of fine-grained complexity to characterise the hardness of dynamic problems. The lower bound for the counting problem additionally relies on the orthogonal vectors conjecture, which in turn is implied by the strong exponential time hypothesis. #R##N#$^\ast)$ By sublinear we mean $O(n^{1-\varepsilon})$ for some $\varepsilon>0$, where $n$ is the size of the active domain of the current database.

Includes members:
  Member "answering fo mod queries under updates on bounded degree databases":
    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 "size bounds and query plans for relational joins":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "complexity analysis of general and fractional hypertree decompositions")
  Member "dynamic conjunctive queries":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "dynamic complexity of document spanners")
  Member "faster online matrix vector multiplication":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "coarse grained complexity for dynamic algorithms")
  Member "unifying and strengthening hardness for dynamic problems via the online matrix vector multiplication conjecture":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "new algorithms and hardness for incremental single source shortest paths in directed graphs")
  Member "joins via geometric resolutions worst case and beyond":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "complexity analysis of general and fractional hypertree decompositions")
  Member "a trichotomy in the complexity of counting answers to conjunctive queries":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "counting answers to existential questions")
  Member "structural tractability of counting of solutions to conjunctive queries":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "counting answers to existential questions")

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)