human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "information spreading in stationary markovian evolving graphs"
  Abstract: Markovian evolving graphs are dynamic-graph models where the links among a fixed set of nodes change during time according to an arbitrary Markovian rule. They are extremely general and they can well describe important dynamic-network scenarios. #R##N#We study the speed of information spreading in the "stationary phase" by analyzing the completion time of the "flooding mechanism". We prove a general theorem that establishes an upper bound on flooding time in any stationary Markovian evolving graph in terms of its node-expansion properties. #R##N#We apply our theorem in two natural and relevant cases of such dynamic graphs. "Geometric Markovian evolving graphs" where the Markovian behaviour is yielded by "n" mobile radio stations, with fixed transmission radius, that perform independent random walks over a square region of the plane. "Edge-Markovian evolving graphs" where the probability of existence of any edge at time "t" depends on the existence (or not) of the same edge at time "t-1". #R##N#In both cases, the obtained upper bounds hold "with high probability" and they are nearly tight. In fact, they turn out to be tight for a large range of the values of the input parameters. As for geometric Markovian evolving graphs, our result represents the first analytical upper bound for flooding time on a class of concrete mobile networks.

Connected through hyperedge HE-1 (induced by source paper "how fast can we reach a target vertex in stochastic temporal graphs"):
  with members:
    - "temporal vertex cover with a sliding time window"
    - "deleting edges to restrict the size of an epidemic in temporal networks"
    - "sliding window temporal graph coloring"
    - "cover time in edge uniform stochastically evolving graphs"
    - "adapting the bron kerbosch algorithm for enumerating maximal cliques in temporal graphs"
    - "computing maximal cliques in link streams"
    - "temporal network optimization subject to connectivity constraints"
    - "on temporal graph exploration"

Connected through hyperedge HE-2 (induced by source paper "patrolling on dynamic ring networks"):
  with members:
    - "gathering in dynamic rings"
    - "polynomial counting in anonymous dynamic networks with applications to anonymous dynamic algebraic computations"
    - "self stabilizing robots in highly dynamic environments"
    - "an introduction to temporal graphs an algorithmic perspective"
    - "live exploration of dynamic rings"
    - "fence patrolling by mobile agents with distinct speeds"
    - "on temporal graph exploration"
    - "dmvp foremost waypoint coverage of time varying graphs"

Connected through hyperedge HE-3 (induced by source paper "percolation of lipschitz surface and tight bounds on the spread of information among mobile agents"):
  with members:
    - "manets high mobility can make up for low transmission power"

Connected through hyperedge HE-4 (induced by source paper "influence maximization over markovian graphs a stochastic optimization approach"):
  with members:
    - "what do your friends think efficient polling methods for networks using friendship paradox"
    - "scalable methods for adaptively seeding a social network"
    - "exact recovery in the stochastic block model"
    - "interactive sensing and decision making in social networks"
    - "influence maximization in continuous time diffusion networks"
    - "uncovering the temporal dynamics of diffusion networks"

Connected through hyperedge HE-5 (induced by source paper "bounding the cover time in edge uniform stochastic graphs"):
  with members:
    - "an introduction to temporal graphs an algorithmic perspective"
    - "characterizing continuous time random walks on time varying graphs"

Connected through hyperedge HE-6 (induced by source paper "capacity and delay scaling for broadcast transmission in highly mobile wireless networks"):
  with members:
    - "survey of important issues in uav communication networks"
    - "information spreading in dynamic graphs"

Connected through hyperedge HE-7 (induced by source paper "ez ag structure free data aggregation in manets using push assisted self repelling random walks"):
  with members:
    - "on the role of mobility for multimessage gossip"

Connected through hyperedge HE-8 (induced by source paper "cover time in edge uniform stochastically evolving graphs"):
  with members:
    - "an introduction to temporal graphs an algorithmic perspective"

Question: Please tell me which class the center node 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)