human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "data dissemination in unified dynamic wireless networks"):
  Abstract: We give efficient algorithms for the fundamental problems of Broadcast and Local Broadcast in dynamic wireless networks. We propose a general model of communication which captures and includes both fading models (like SINR) and graph-based models (such as quasi unit disc graphs, bounded-independence graphs, and protocol model). The only requirement is that the nodes can be embedded in a bounded growth quasi-metric, which is the weakest condition known to ensure distributed operability. Both the nodes and the links of the network are dynamic: nodes can come and go, while the signal strength on links can go up or down. #R##N#The results improve some of the known bounds even in the static setting, including an optimal algorithm for local broadcasting in the SINR model, which is additionally uniform (independent of network size). An essential component is a procedure for balancing contention, which has potentially wide applicability. The results illustrate the importance of carrier sensing, a stock feature of wireless nodes today, which we encapsulate in primitives to better explore its uses and usefulness.

Includes members:
  Member "leveraging multiple channels in ad hoc networks":
    also connected through other hyperedges:
      (none)
  Member "distributed bare bones communication in wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "deterministic backbone creation in an sinr network without knowledge of location")
  Member "a local broadcast layer for the sinr network model":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "deterministic digital clustering of wireless ad hoc networks")
  Member "distributed communication in bare bones wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "deterministic protocols in the sinr model without knowledge of coordinates")
  Member "multi message broadcast with abstract mac layers and unreliable links":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the capacity of smartphone peer to peer networks")
  Member "randomized broadcast in radio networks with collision detection":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "competitive broadcast against adaptive adversary in multi channel radio networks")
  Member "beyond geometry towards fully realistic wireless models":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "effective wireless scheduling via hypergraph sketches")
  Member "radio network lower bounds made easy":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "the energy complexity of broadcast")

Question: Please tell me which class the source paper 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)