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 "energy efficient adversarial routing in shared channels"):
  Abstract: We investigate routing on multiple access channels when packets are injected continually and the system is subject to an energy cap understood as a bound on the number of stations that can be switched on in a round. Performance of algorithms is assessed in adversarial models of packet injection that determine upper bounds on injection rates and burstiness. The algorithms we develop are distributed and deterministic, and their performance bounds are in the worst-case sense. We consider the impact of using control bits in messages, along with routed packets, on the performance of routing. We show that it is possible to obtain packet latency as low as $O(n)$ when a constant fraction of the stations has to be switched off in each round, and also that it is possible to have polynomial packet latency for energy caps of only $2$, without using control bits in messages. We give an algorithm that maintains bounded queues for injection rate $1$ and which requires the energy cap of only $3$, and show that obtaining the same quality of routing with the energy cap of $2$ is impossible.

Includes members:
  Member "the energy complexity of broadcast":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "competitive broadcast against adaptive adversary in multi channel radio networks")
  Member "packet latency of deterministic broadcasting in adversarial multiple access channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "packet oblivious stable routing in multi hop wireless networks")
  Member "exponential separations in the energy complexity of leader election":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "competitive broadcast against adaptive adversary in multi channel radio networks")
  Member "broadcasting in ad hoc multiple access channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "packet latency of deterministic broadcasting in adversarial multiple access channels")
  Member "adversarial multiple access channels with individual injection rates":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "packet latency of deterministic broadcasting in adversarial multiple access channels")
  Member "a survey of green networking research":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "energy efficient mechanism for smart communication in cellular networks")
  Member "maximum throughput of multiple access channels in adversarial environments":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "packet latency of deterministic broadcasting in adversarial multiple access channels")

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)