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 "counting triangles under updates in worst case optimal time"):
  Abstract: We consider the problem of incrementally maintaining the triangle count query under single- tuple updates to the input relations. We introduce an approach that exhibits a space-time tradeoff such that the space-time product is quadratic in the size of the input database and the update time can be as low as the square root of this size. This lowest update time is worst-case optimal conditioned on the Online Matrix-Vector Multiplication conjecture. #R##N#The classical and factorized incremental view maintenance approaches are recovered as special cases of our approach within the space-time tradeoff. In particular, they require linear- time update maintenance, which is suboptimal. Our approach also recovers the worst-case optimal time complexity for computing the triangle count in the non-incremental setting.

Includes members:
  Member "worst case optimal join algorithms techniques results and open problems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "rk means fast clustering for relational data")
  Member "incremental view maintenance with triple lock factorization benefits":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "systemds a declarative machine learning system for the end to end data science lifecycle")
  Member "answering conjunctive queries under updates":
    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 "answering ucqs under updates and in the presence of integrity constraints":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "constant delay enumeration with fpt preprocessing for conjunctive queries of bounded submodular width")
  Member "the dynamic descriptive complexity of k clique":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "dynamic complexity of parity exists queries")
  Member "unifying and strengthening hardness for dynamic problems via the online matrix vector multiplication conjecture":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "new algorithms and hardness for incremental single source shortest paths in directed graphs")
  Member "approximately counting triangles in sublinear time":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "parallel algorithms for small subgraph counting")
  Member "faq questions asked frequently":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "complexity analysis of general and fractional hypertree decompositions")

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)