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 "unifying sparsest cut cluster deletion and modularity clustering objectives with correlation clustering"):
  Abstract: We present and analyze a new framework for graph clustering based on a specially weighted version of correlation clustering, that unifies several existing objectives and satisfies a number of attractive theoretical properties. Our framework, which we call LambdaCC, relies on a single resolution parameter $\lambda$, which implicitly controls both the edge density and sparsest cut of all output clusters. We prove that our new clustering objective interpolates between the cluster deletion problem and the minimum sparsest cut problem as we vary $\lambda$, and is also closely related to the well-studied maximum modularity objective. We provide several algorithms for optimizing our new objective, including a 5-approximation for the case where $\lambda \geq 1/2$, and also the first constant factor approximation algorithm for the NP-hard cluster deletion problem. We demonstrate the effectiveness of our framework and algorithms in finding communities in several real-world networks.

Includes members:
  Member "multiresolution consensus clustering in networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "learning resolution parameters for graph clustering")
  Member "large scale correlation clustering optimization":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "digital technologies in airport ground operations")

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)