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 "cores and other dense structures in complex networks"):
  Abstract: Complex networks are a powerful paradigm to model complex systems. Specific network models, e.g., multilayer networks, temporal networks, and signed networks, enrich the standard network representation with additional information to better capture real-world phenomena. Despite the keen interest in a variety of problems, algorithms, and analysis methods for these types of network, the problem of extracting cores and dense structures still has unexplored facets.   In this work, we present advancements to the state of the art by the introduction of novel definitions and algorithms for the extraction of dense structures from complex networks, mainly cores. At first, we define core decomposition in multilayer networks together with a series of applications built on top of it, i.e., the extraction of maximal multilayer cores only, densest subgraph in multilayer networks, the speed-up of the extraction of frequent cross-graph quasi-cliques, and the generalization of community search to the multilayer setting. Then, we introduce the concept of core decomposition in temporal networks; also in this case, we are interested in the extraction of maximal temporal cores only. Finally, in the context of discovering polarization in large-scale online data, we study the problem of identifying polarized communities in signed networks.   The proposed methodologies are evaluated on a large variety of real-world networks against naive approaches, non-trivial baselines, and competing methods. In all cases, they show effectiveness, efficiency, and scalability. Moreover, we showcase the usefulness of our definitions in concrete applications and case studies, i.e., the temporal analysis of contact networks, and the identification of polarization in debate networks.

Includes members:
  Member "on finding dense common subgraphs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "span core decomposition for temporal networks algorithms and applications")
  Member "mining maximal span cores from temporal networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a hybrid approach to temporal pattern matching")
  Member "core decomposition in multilayer networks theory algorithms and applications":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "novel dense subgraph discovery primitives risk aversion and exclusion queries")
  Member "best friends forever bff finding lasting dense subgraphs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "novel dense subgraph discovery primitives risk aversion and exclusion queries")
  Member "when engagement meets similarity efficient k r core computation on social networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a survey of community search over big graphs")
  Member "a survey of signed network mining in social media":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "social science guided feature engineering a novel approach to signed link analysis")
  Member "computing maximal cliques in link streams":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "span core decomposition for temporal networks algorithms and applications")

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)