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 "information spreading in dynamic graphs"):
  Abstract: We present a general approach to study the flooding time (a measure of how fast information spreads) in dynamic graphs (graphs whose topology changes with time according to a random process). #R##N#We consider arbitrary converging Markovian dynamic graph process, that is, processes in which the topology of the graph at time $t$ depends only on its topology at time $t-1$ and which have a unique stationary distribution. The most well studied models of dynamic graphs are all Markovian and converging. #R##N#Under general conditions, we bound the flooding time in terms of the mixing time of the dynamic graph process. We recover, as special cases of our result, bounds on the flooding time for the \emph{random trip} model and the \emph{random path} models; previous analysis techniques provided bounds only in restricted settings for such models. Our result also provides the first bound for the \emph{random waypoint} model (which is tight for certain ranges of parameters) whose analysis had been an important open question.

Includes members:
  Member "tight bounds on information dissemination in sparse mobile networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "improved bounds on information dissemination by manhattan random waypoint model")
  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 "flooding time in opportunistic networks under power law and exponential inter contact times":
    also connected through other hyperedges:
      (none)
  Member "performance of opportunistic epidemic routing on edge markovian dynamic graphs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the performance analysis of epidemic routing in non sparse delay tolerant networks")
  Member "fast flooding over manhattan":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "improved bounds on information dissemination by manhattan random waypoint model")
  Member "modelling mobility a discrete revolution":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "improved bounds on information dissemination by manhattan random waypoint model")
  Member "information propagation speed in mobile and delay tolerant networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "diffusion on dynamic contact networks with indirect transmission links")
  Member "manets high mobility can make up for low transmission power":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "percolation of lipschitz surface and tight bounds on the spread of information among mobile agents")

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.DM(Discrete Mathematics)