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 "enumerating top k quasi cliques"):
  Abstract: Quasi-cliques are dense incomplete subgraphs of a graph that generalize the notion of cliques. Enumerating quasi-cliques from a graph is a robust way to detect densely connected structures with applications to bio-informatics and social network analysis. However, enumerating quasi-cliques in a graph is a challenging problem, even harder than the problem of enumerating cliques. We consider the enumeration of top-k degree-based quasi-cliques, and make the following contributions: (1) We show that even the problem of detecting if a given quasi-clique is maximal (i.e. not contained within another quasi-clique) is NP-hard (2) We present a novel heuristic algorithm KernelQC to enumerate the k largest quasi-cliques in a graph. Our method is based on identifying kernels of extremely dense subgraphs within a graph, following by growing subgraphs around these kernels, to arrive at quasi-cliques with the required densities (3) Experimental results show that our algorithm accurately enumerates quasi-cliques from a graph, is much faster than current state-of-the-art methods for quasi-clique enumeration (often more than three orders of magnitude faster), and can scale to larger graphs than current methods.

Includes members:
  Member "change sensitive algorithms for maintaining maximal cliques in a dynamic graph":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "shared memory parallel maximal clique enumeration")
  Member "enumerating maximal bicliques from a large graph using mapreduce":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "shared memory parallel maximal clique enumeration from static and dynamic graphs")
  Member "a novel approach to finding near cliques the triangle densest subgraph problem":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "near optimal fully dynamic densest subgraph")
  Member "mining attribute structure correlated patterns in large attributed graphs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "detection of community structures in networks with nodal features based on generative probabilistic approach")
  Member "listing all maximal cliques in sparse graphs in near optimal time":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "teaser fast and certifiable point cloud registration")
  Member "an o m algorithm for cores decomposition of networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "fastgae fast scalable and effective graph autoencoders with stochastic subgraph decoding")

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.DS(Data Structures and Algorithms)