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 "deleting edges to restrict the size of an epidemic in temporal networks"):
  Abstract: A variety of potentially disease-spreading contact networks can be naturally modeled with graphs whose structure is subject to discrete changes over time, i.e. with temporal graphs. In such a temporal graph, vertices represent meaningful entities (such as animals or farms) and edges represent potentially infectious contacts between those entities. Furthermore the `availability' of an edge $e$ at time $t$ means that, at time $t$, the entities at the endpoints of $e$ are in contact. In this paper, motivated by network epidemiology applications in the dynamics of disease spreading on a data-derived network, we study the problem of deleting edges and/or edge availabilities from a given temporal graph in order to reduce its (temporal) connectivity. In particular, our aim is to find a temporal subgraph, in which the potential disease of any vertex $u$ can be transferred to only a limited number of other vertices $v$ using a temporal path (i.e. a path from $u$ to $v$, along which the times of the edge availabilities increase). We introduce two natural deletion problems for temporal graphs (for deletion of edges and of edge availabilities, respectively) and we provide positive and negative results on their computational complexity, both in the traditional and the parameterized sense, subject to various natural parameters.

Includes members:
  Member "temporal graph classes a view through temporal separators":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "multistage vertex cover")
  Member "deleting edges to restrict the size of an epidemic a new application for treewidth":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "two dichotomies for model checking in multi layer structures")
  Member "computing maximal cliques in link streams":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "span core decomposition for temporal networks algorithms and applications")
  Member "temporal network optimization subject to connectivity constraints":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "distributed computation and reconfiguration in actively dynamic networks")
  Member "on temporal graph exploration":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "live exploration with mobile robots in a dynamic ring revisited")
  Member "dmvp foremost waypoint coverage of time varying graphs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "how fast can we reach a target vertex in stochastic temporal graphs")
  Member "time varying graphs and dynamic networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "edge disjoint branchings in temporal graphs")
  Member "exploration of periodically varying graphs":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "temporal vertex cover with a sliding time window")

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)