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 "bounding the cover time in edge uniform stochastic graphs"):
  Abstract: We define a new model of stochastically evolving graphs, namely the \emph{Edge-Uniform Stochastic Graphs}. In this model, each possible edge of an underlying general static graph evolves independently being either alive or dead at each discrete time step of evolution following a (Markovian) stochastic rule. The stochastic rule is identical for each possible edge and may depend on the previous $k \ge 0$ observations of the edge's state. #R##N#We study the behavior of a simple random walk taking place in such a dynamic graph. At each round of evolution, after the current graph instance is fixed, a single mobile agent moves uniformly at random to a neighboring node of its current placement. We explicitly derive the first upper bounds for the walk's cover time, i.e.\ the expected time until each node is visited at least once, and focus on the cases $k = 0$ and $k = 1$. For $k = 0$, our technique includes the use of a modified electrical network theory framework. On the other hand, for $k = 1$, we employ a mixing time argument and then reduce this case to the framework for the case $k = 0$. Finally, we discuss how this approach can be extended for any $k > 1$.

Includes members:
  Member "an introduction to temporal graphs an algorithmic perspective":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "graph generators state of the art and open challenges")
  Member "information spreading in stationary markovian evolving graphs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "how fast can we reach a target vertex in stochastic temporal graphs")
  Member "characterizing continuous time random walks on time varying graphs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "spectral algorithms for temporal graph cuts")

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.DC(Distributed, Parallel, and Cluster Computing)