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 "efficiently testing t interval connectivity in dynamic graphs"):
  Abstract: Many types of dynamic networks are made up of durable entities whose links evolve over time. When considered from a {\em global} and {\em discrete} standpoint, these networks are often modelled as evolving graphs, i.e. a sequence of graphs ${\cal G}=(G_1,G_2,...,G_{\delta})$ such that $G_i=(V,E_i)$ represents the network topology at time step $i$. Such a sequence is said to be $T$-interval connected if for any $t\in [1, \delta-T+1]$ all graphs in $\{G_t,G_{t+1},...,G_{t+T-1}\}$ share a common connected spanning subgraph. In this paper, we consider the problem of deciding whether a given sequence ${\cal G}$ is $T$-interval connected for a given $T$. We also consider the related problem of finding the largest $T$ for which a given ${\cal G}$ is $T$-interval connected. We assume that the changes between two consecutive graphs are arbitrary, and that two operations, {\em binary intersection} and {\em connectivity testing}, are available to solve the problems. We show that $\Omega(\delta)$ such operations are required to solve both problems, and we present optimal $O(\delta)$ online algorithms for both problems. We extend our online algorithms to a dynamic setting in which connectivity is based on the recent evolution of the network.

Includes members:
  Member "self stabilizing robots in highly dynamic environments":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "want to gather no need to chatter")
  Member "the next 700 impossibility results in time varying graphs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "robustness a new form of heredity motivated by dynamic networks")
  Member "dmvp foremost waypoint coverage of time varying graphs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "how fast can we reach a target vertex in stochastic temporal graphs")
  Member "testing temporal connectivity in sparse dynamic graphs":
    also connected through other hyperedges:
      (none)
  Member "temporal reachability graphs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "degree based outlier detection within ip traffic modelled as a link stream")
  Member "shortest fastest and foremost broadcast in dynamic networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the computational complexity of finding temporal paths under waiting time constraints")
  Member "characterizing topological assumptions of distributed algorithms in dynamic networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "distributed online data aggregation in dynamic 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")

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)