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: "asymptotically optimal randomized rumor spreading"
  Abstract: We propose a new protocol solving the fundamental problem of disseminating a piece of information to all members of a group of n players. It builds upon the classical randomized rumor spreading protocol and several extensions. The main achievements are the following: #R##N#Our protocol spreads the rumor to all other nodes in the asymptotically optimal time of (1 + o(1)) \log_2 n. The whole process can be implemented in a way such that only O(n f(n)) calls are made, where f(n)= \omega(1) can be arbitrary. #R##N#In contrast to other protocols suggested in the literature, our algorithm only uses push operations, i.e., only informed nodes take active actions in the network. To the best of our knowledge, this is the first randomized push algorithm that achieves an asymptotically optimal running time.

Connected through hyperedge HE-1 (induced by source paper "randomized rumor spreading in ad hoc networks with buffers"):
  with members:
    - "global computation in a poorly connected world fast rumor spreading with no dependence on conductance"

Connected through hyperedge HE-2 (induced by source paper "evolutionary acyclic graph partitioning"):
  with members:
    - "graph partitioning with acyclicity constraints"
    - "recent advances in graph partitioning"
    - "distributed evolutionary graph partitioning"
    - "engineering multilevel graph partitioning algorithms"
    - "engineering a scalable high quality graph partitioner"

Connected through hyperedge HE-3 (induced by source paper "optimal epidemic dissemination"):
  with members:
    - "optimal gossip with direct addressing"
    - "simple and optimal randomized fault tolerant rumor spreading"
    - "gossip algorithms for distributed signal processing"

Connected through hyperedge HE-4 (induced by source paper "self stabilizing clock synchronization with 3 bit messages"):
  with members:
    - "minimizing message size in stochastic communication patterns fast self stabilizing protocols with 3 bits"
    - "noisy information spreading and plurality consensus"
    - "self stabilizing repeated balls into bins"
    - "towards optimal synchronous counting"
    - "stable leader election in population protocols requires linear time"
    - "stabilizing consensus with many opinions"
    - "plurality consensus in the gossip model"
    - "breathe before speaking efficient information dissemination despite noisy limited and anonymous communication"

Connected through hyperedge HE-5 (induced by source paper "minimizing message size in stochastic communication patterns fast self stabilizing protocols with 3 bits"):
  with members:
    - "efficient k party voting with two choices"
    - "self stabilizing repeated balls into bins"
    - "efficient counting with optimal resilience"
    - "towards optimal synchronous counting"
    - "stable leader election in population protocols requires linear time"
    - "stabilizing consensus with many opinions"
    - "plurality consensus in the gossip model"
    - "breathe before speaking efficient information dissemination despite noisy limited and anonymous communication"

Connected through hyperedge HE-6 (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-7 (induced by source paper "distributed evolutionary graph partitioning"):
  with members:
    - "n level graph partitioning"
    - "engineering multilevel graph partitioning algorithms"
    - "engineering a scalable high quality graph partitioner"

Connected through hyperedge HE-8 (induced by source paper "global computation in a poorly connected world fast rumor spreading with no dependence on conductance"):
  with members:
    - "quasirandom rumor spreading"
    - "spectral sparsification of graphs"

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.DS(Data Structures and Algorithms)