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 "on the enumeration of maximal delta gamma cliques of a temporal network"):
  Abstract: A temporal network is a mathematical way of precisely representing a time varying relationship among a group of agents. In this paper, we introduce the notion of $(\Delta, \gamma)$-Cliques of a temporal network, where every pair of vertices present in the clique communicates atleast $\gamma$ times in each $\Delta$ period within a given time duration. We present an algorithm for enumerating all such maximal cliques present in the network. We also implement the proposed algorithm with three human contact network data sets. Based on the obtained results, we analyze the data set on multiple values of $\Delta$ and $\gamma$, which helps in finding out contact groups with different frequencies.

Includes members:
  Member "enumerating maximal cliques in temporal graphs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "span core decomposition for temporal networks algorithms and applications")
  Member "computing maximal cliques in link streams":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "span core decomposition for temporal networks algorithms and applications")
  Member "exploring the structure and function of temporal networks with dynamic graphlets":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "item independent temporal motifs to summarize and compare temporal networks")
  Member "mining maximal cliques from an uncertain graph":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "uncertain graph sparsification")
  Member "listing all maximal cliques in large sparse real world graphs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "shared memory parallel maximal clique enumeration from static and dynamic graphs")

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)