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: "quasirandom rumor spreading"
  Abstract: We propose and analyze a quasirandom analogue of the classical push model for disseminating information in networks ("randomized rumor spreading"). In the classical model, in each round each informed vertex chooses a neighbor at random and informs it, if it was not informed before. It is known that this simple protocol succeeds in spreading a rumor from one vertex to all others within O(log n) rounds on complete graphs, hypercubes, random regular graphs, Erdos-Renyi random graph and Ramanujan graphs with probability 1-o(1). In the quasirandom model, we assume that each vertex has a (cyclic) list of its neighbors. Once informed, it starts at a random position on the list, but from then on informs its neighbors in the order of the list. Surprisingly, irrespective of the orders of the lists, the above-mentioned bounds still hold. In some cases, even better bounds than for the classical model can be shown.

Connected through hyperedge HE-1 (induced by source paper "lower bounds for the happy coloring problems"):
  with members:
    - "the parameterized complexity of happy colorings"
    - "algorithms and hardness results for happy coloring problems"
    - "on problems as hard as cnf sat"
    - "submodular and supermodular multi labeling and vertex happiness"
    - "exponential time complexity of the permanent and the tutte polynomial"
    - "kernelization of packing problems"

Connected through hyperedge HE-2 (induced by source paper "consensus needs broadcast in noiseless models but can be exponentially easier in the presence of noise"):
  with members:
    - "ignore or comply on breaking symmetry in consensus"
    - "tight analysis for the 3 majority consensus dynamics"
    - "a tight analysis of the parallel undecided state dynamics with two colors"
    - "distributed computing with channel noise"
    - "breaking the log n barrier on rumor spreading"
    - "stabilizing consensus with many opinions"
    - "noisy rumor spreading and plurality consensus"
    - "the power of two choices in distributed voting"

Connected through hyperedge HE-3 (induced by source paper "dynamic gossip"):
  with members:
    - "discovery through gossip"
    - "simple fast and deterministic gossip and rumor spreading"

Connected through hyperedge HE-4 (induced by source paper "on distance d independent set and other problems in graphs with few minimal separators"):
  with members:
    - "large induced subgraphs via triangulations and cmso"
    - "parameterized domination in circle graphs"
    - "finding induced subgraphs via minimal triangulations"

Connected through hyperedge HE-5 (induced by source paper "breaking the log n barrier on rumor spreading"):
  with members:
    - "optimal gossip with direct addressing"
    - "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-6 (induced by source paper "on the influence of graph density on randomized gossiping"):
  with members:
    - "plurality consensus in the gossip model"
    - "tight bounds for rumor spreading with vertex expansion"
    - "tighter worst case bounds on algebraic gossip"
    - "simple fast and deterministic gossip and rumor spreading"
    - "cover time and broadcast time"

Connected through hyperedge HE-7 (induced by source paper "gossip vs markov chains and randomness efficient rumor spreading"):
  with members:
    - "rumor spreading in random evolving graphs"
    - "tight bounds for rumor spreading with vertex expansion"
    - "quasirandom load balancing"
    - "tight bounds for randomized load balancing on arbitrary network topologies"
    - "simple fast and deterministic gossip and rumor spreading"
    - "better pseudorandom generators from milder pseudorandom restrictions"
    - "global computation in a poorly connected world fast rumor spreading with no dependence on conductance"
    - "space efficient local computation algorithms"

Connected through hyperedge HE-8 (induced by source paper "randomness efficient rumor spreading"):
  with members:
    - "simple fast and deterministic gossip and rumor spreading"
    - "better pseudorandom generators from milder pseudorandom restrictions"
    - "global computation in a poorly connected world fast rumor spreading with no dependence on conductance"
    - "fast distributed algorithms for computing separable functions"

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)