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: "tighter worst case bounds on algebraic gossip"
  Abstract: Gossip and in particular network coded algebraic gossip have recently attracted attention as a fast, bandwidth-efficient, reliable and distributed way to broadcast or multicast multiple messages. While the algorithms are simple, involved queuing approaches are used to study their performance. The most recent result in this direction shows that uniform algebraic gossip disseminates k messages in O({\Delta}(D + k + log n)) rounds where D is the diameter, n the size of the network and {\Delta} the maximum degree. #R##N#In this paper we give a simpler, short and self-contained proof for this worst-case guarantee. Our approach also allows to reduce the quadratic {\Delta}D term to min{3n, {\Delta}D}. We furthermore show that a simple round robin routing scheme also achieves min{3n, {\Delta}D} + {\Delta}k rounds, eliminating both randomization and coding. Lastly, we combine a recent non-uniform gossip algorithm with a simple routing scheme to get a O(D + k + log^{O(1)}) gossip information dissemination algorithm. This is order optimal as long as D and k are not both polylogarithmically small.

Connected through hyperedge HE-1 (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"
    - "simple fast and deterministic gossip and rumor spreading"
    - "quasirandom rumor spreading"
    - "cover time and broadcast time"

Connected through hyperedge HE-2 (induced by source paper "order optimal information spreading using algebraic gossip"):
  with members:
    - "global computation in a poorly connected world fast rumor spreading with no dependence on conductance"
    - "bounds for algebraic gossip on graphs"
    - "analyzing network coding gossip made easy"
    - "quasirandom rumor spreading"

Connected through hyperedge HE-3 (induced by source paper "analyzing network coding gossip made easy"):
  with members:
    - "optimal gossip with direct addressing"
    - "broadcast throughput in radio networks routing vs network coding"
    - "tight bounds for rumor spreading with vertex expansion"
    - "fast structuring of radio networks large for multi message communications"
    - "lower bounds on information dissemination in dynamic networks"
    - "bounded contention coding for wireless networks in the high snr regime"
    - "simple fast and deterministic gossip and rumor spreading"
    - "network coded gossip with correlated data"

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)