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 "packet latency of deterministic broadcasting in adversarial multiple access channels"):
  Abstract: We study broadcasting in multiple access channels with dynamic packet arrivals and jamming. Communication environments are represented by adversarial models that specify constraints on packet arrivals and jamming. We consider deterministic distributed broadcast algorithms and give upper bounds on the worst-case packet latency and the number of queued packets in relation to the parameters defining adversaries. Packet arrivals are determined by a rate of injections and a number of packets that can be generated in one round. Jamming is constrained by a rate with which an adversary can jam rounds and by a number of consecutive rounds that can be jammed.

Includes members:
  Member "randomized communication in radio networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "packet oblivious stable routing in multi hop wireless networks")
  Member "scalable wake up of multi channel single hop radio networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "singletons for simpletons revisiting windowed backoff using chernoff bounds")
  Member "broadcasting in ad hoc multiple access channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "energy efficient adversarial routing in shared channels")
  Member "competitive mac under adversarial sinr":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "deterministic digital clustering of wireless ad hoc networks")
  Member "adversarial multiple access channels with individual injection rates":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "energy efficient adversarial routing in shared channels")
  Member "unbounded contention resolution in multiple access channels":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "singletons for simpletons revisiting windowed backoff using chernoff bounds")
  Member "maximum throughput of multiple access channels in adversarial environments":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "energy efficient adversarial routing in shared channels")
  Member "source routing and scheduling in packet networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "universal routing in multi hop radio networks")

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)