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 maximal cliques in link streams with durations"):
  Abstract: Link streams model interactions over time, and a clique in a link stream is defined as a set of nodes and a time interval such that all pairs of nodes in this set interact permanently during this time interval. This notion was introduced recently in the case where interactions are instantaneous. We generalize it to the case of interactions with durations and show that the instantaneous case actually is a particular case of the case with durations. We propose an algorithm to detect maximal cliques that improves our previous one for instantaneous link streams, and performs better than the state of the art algorithms in several cases of interest.

Includes members:
  Member "discovering patterns of interest in ip traffic using cliques in bipartite link streams":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "degree based outlier detection within ip traffic modelled as a link stream")
  Member "adapting the bron kerbosch algorithm for enumerating maximal cliques in temporal graphs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "computing maximum matchings in temporal graphs")
  Member "enumerating maximal cliques in temporal graphs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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-4 (induced by source paper "span core decomposition for temporal networks algorithms and applications")
  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)