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: "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.

Connected through hyperedge HE-1 (induced by source paper "packet oblivious stable routing in multi hop wireless networks"):
  with members:
    - "randomized communication in radio networks"
    - "routing in wireless networks with interferences"
    - "universal routing in multi hop radio networks"
    - "stability of the max weight protocol in adversarial wireless networks"
    - "bounds on stability and latency in wireless communication"

Connected through hyperedge HE-2 (induced by source paper "energy efficient adversarial routing in shared channels"):
  with members:
    - "the energy complexity of broadcast"
    - "exponential separations in the energy complexity of leader election"
    - "broadcasting in ad hoc multiple access channels"
    - "adversarial multiple access channels with individual injection rates"
    - "a survey of green networking research"
    - "maximum throughput of multiple access channels in adversarial environments"

Connected through hyperedge HE-3 (induced by source paper "scalable wake up of multi channel single hop radio networks"):
  with members:
    - "uniform information exchange in multi channel wireless ad hoc networks"
    - "broadcasting in ad hoc multiple access channels"
    - "adversarial multiple access channels with individual injection rates"
    - "unbounded contention resolution in multiple access channels"
    - "dynamic sharing of a multiple access channel"
    - "maximum throughput of multiple access channels in adversarial environments"

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)