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: "strong robustness of randomized rumor spreading protocols"
  Abstract: Randomized rumor spreading is a classical protocol to disseminate information across a network. At SODA 2008, a quasirandom version of this protocol was proposed and competitive bounds for its run-time were proven. This prompts the question: to what extent does the quasirandom protocol inherit the second principal advantage of randomized rumor spreading, namely robustness against transmission failures? #R##N#In this paper, we present a result precise up to $(1 \pm o(1))$ factors. We limit ourselves to the network in which every two vertices are connected by a direct link. Run-times accurate to their leading constants are unknown for all other non-trivial networks. #R##N#We show that if each transmission reaches its destination with a probability of $p \in (0,1]$, after $(1+\e)(\frac{1}{\log_2(1+p)}\log_2n+\frac{1}{p}\ln n)$ rounds the quasirandom protocol has informed all $n$ nodes in the network with probability at least $1-n^{-p\e/40}$. Note that this is faster than the intuitively natural $1/p$ factor increase over the run-time of approximately $\log_2 n + \ln n $ for the non-corrupted case. #R##N#We also provide a corresponding lower bound for the classical model. This demonstrates that the quasirandom model is at least as robust as the fully random model despite the greatly reduced degree of independent randomness.

Connected through hyperedge HE-1 (induced by source paper "optimal broadcasting in networks with faulty nodes"):
  with members:
    - "simple and optimal randomized fault tolerant rumor spreading"

Connected through hyperedge HE-2 (induced by source paper "breathe before speaking efficient information dissemination despite noisy limited and anonymous communication"):
  with members:
    - "the power of two choices in distributed voting"
    - "optimal gossip with direct addressing"
    - "simple dynamics for plurality consensus"
    - "memory lower bounds for randomized collaborative search and applications to biology"
    - "collaborative search on the plane without communication"
    - "beeping a maximal independent set"
    - "simple fast and deterministic gossip and rumor spreading"
    - "global computation in a poorly connected world fast rumor spreading with no dependence on conductance"

Connected through hyperedge HE-3 (induced by source paper "rumor spreading in random evolving graphs"):
  with members:
    - "information spreading in stationary markovian evolving graphs"
    - "performance of opportunistic epidemic routing on edge markovian dynamic graphs"
    - "information propagation speed in mobile and delay tolerant networks"

Connected through hyperedge HE-4 (induced by source paper "simple and optimal randomized fault tolerant rumor spreading"):
  with members:
    - "global computation in a poorly connected world fast rumor spreading with no dependence on conductance"
    - "quasi random rumor spreading reducing randomness can be costly"
    - "fast distributed algorithms for computing separable functions"

Connected through hyperedge HE-5 (induced by source paper "quasirandom rumor spreading"):
  with members:
    - "quasirandom load balancing"
    - "quasirandom rumor spreading an experimental analysis"
    - "quasi random rumor spreading reducing randomness can be costly"
    - "the cover time of deterministic random walks"

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)