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 isolated cliques in temporal networks"):
  Abstract: Isolation has been shown to be a valuable concept in the world of clique enumeration. Motivated by recent work on enumerating cliques in temporal (or time-varying) graphs, we lift the isolation concept to this setting. We discover that the addition of the time dimension leads to six distinct natural isolation concepts. Our main contribution are algorithms for the enumeration of five of these six clique types, that are fixed-parameter-tractable with respect to the "degree of isolation". On the empirical side, we implement and test these algorithms on (temporal) social network data, obtaining encouraging preliminary results.

Includes members:
  Member "community discovery in dynamic networks a survey":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a survey of community search over big graphs")
  Member "listing all maximal k plexes in temporal graphs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "span core decomposition for temporal networks algorithms and applications")
  Member "the parameterized complexity of finding secluded solutions to some classical optimization problems on graphs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "parameterized algorithms and data reduction for the short secluded s t path problem")
  Member "enumerating maximal cliques in link streams with durations":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a sampling framework for counting temporal motifs")
  Member "stream graphs and link streams for the modeling of interactions over time":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "finding temporal patterns using algebraic fingerprints")
  Member "adapting the bron kerbosch algorithm for enumerating maximal cliques in temporal graphs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "computing maximum matchings in temporal graphs")
  Member "an introduction to temporal graphs an algorithmic perspective":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "graph generators state of the art and open challenges")
  Member "computing maximal cliques in link streams":
    also connected through other hyperedges:
      - Hyperedge HE-8 (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)