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: "multi message broadcast with abstract mac layers and unreliable links"
  Abstract: We study the multi-message broadcast problem using abstract MAC layer models of wireless networks. These models capture the key guarantees of existing MAC layers while abstracting away low-level details such as signal propagation and contention. We begin by studying upper and lower bounds for this problem in a {\em standard abstract MAC layer model}---identifying an interesting dependence between the structure of unreliable links and achievable time complexity. In more detail, given a restriction that devices connected directly by an unreliable link are not too far from each other in the reliable link topology, we can (almost) match the efficiency of the reliable case. For the related restriction, however, that two devices connected by an unreliable link are not too far from each other in geographic distance, we prove a new lower bound that shows that this efficiency is impossible. We then investigate how much extra power must be added to the model to enable a new order of magnitude of efficiency. In more detail, we consider an {\em enhanced abstract MAC layer model} and present a new multi-message broadcast algorithm that (under certain natural assumptions) solves the problem in this model faster than any known solutions in an abstract MAC layer setting.

Connected through hyperedge HE-1 (induced by source paper "the capacity of smartphone peer to peer networks"):
  with members:
    - "random gossip processes in smartphone peer to peer networks"
    - "how to discreetly spread a rumor in a crowd"
    - "rumor spreading with bounded in degree"
    - "tight bounds for rumor spreading with vertex expansion"
    - "faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms"

Connected through hyperedge HE-2 (induced by source paper "erasure correction for noisy radio networks"):
  with members:
    - "broadcasting in noisy radio networks"
    - "interactive channel capacity revisited"
    - "randomized broadcast in radio networks with collision detection"
    - "bounds on contention management in radio networks"

Connected through hyperedge HE-3 (induced by source paper "on simple back off in unreliable radio networks"):
  with members:
    - "bounds on contention management in radio networks"

Connected through hyperedge HE-4 (induced by source paper "on simple back off in complicated radio networks"):
  with members:
    - "bounds on contention management in radio networks"

Connected through hyperedge HE-5 (induced by source paper "beeping a maximal independent set fast"):
  with members:
    - "ant inspired density estimation via random walks"
    - "a local broadcast layer for the sinr network model"
    - "an improved distributed algorithm for maximal independent set"
    - "consensus with an abstract mac layer"
    - "the locality of distributed symmetry breaking"
    - "beeping a maximal independent set"
    - "feedback from nature an optimal distributed algorithm for maximal independent set selection"

Connected through hyperedge HE-6 (induced by source paper "data dissemination in unified dynamic wireless networks"):
  with members:
    - "leveraging multiple channels in ad hoc networks"
    - "distributed bare bones communication in wireless networks"
    - "a local broadcast layer for the sinr network model"
    - "distributed communication in bare bones wireless networks"
    - "randomized broadcast in radio networks with collision detection"
    - "beyond geometry towards fully realistic wireless models"
    - "radio network lower bounds made easy"
    - "on the impact of geometry on ad hoc communication in wireless networks"

Connected through hyperedge HE-7 (induced by source paper "the cost of global broadcast in dynamic radio networks"):
  with members:
    - "multi message broadcast in dynamic radio networks"
    - "dynamic multiple message broadcast bounding throughput in the affectance model"
    - "radio network lower bounds made easy"
    - "on the impact of geometry on ad hoc communication in wireless networks"
    - "distributed connectivity decomposition"
    - "a new perspective on vertex connectivity"
    - "analyzing network coding gossip made easy"

Connected through hyperedge HE-8 (induced by source paper "multi message broadcast in dynamic radio networks"):
  with members:
    - "the cost of global broadcast in dynamic radio networks"
    - "dynamic multiple message broadcast bounding throughput in the affectance model"
    - "radio network lower bounds made easy"
    - "time varying graphs and dynamic networks"
    - "analyzing network coding gossip made easy"

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.DC(Distributed, Parallel, and Cluster Computing)