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 "a common information based multiple access protocol achieving full throughput and linear delay"):
  Abstract: We consider a multiple access communication system where multiple users share a common collision channel. Each user observes its local traffic and the feedback from the channel. At each time instant the feedback from the channel is one of three messages: no transmission, successful transmission, collision. The objective is to design a transmission protocol that coordinates the users' transmissions and achieves high throughput and low delay. #R##N#We present a decentralized Common Information-Based Multiple Access (CIMA) protocol that has the following features: (i) it achieves the full throughput region of the collision channel; (ii) it results in a delay that is linear in the number of users, and is significantly lower than that of CSMA protocols; (iii) it avoids collisions without channel sensing.

Includes members:
  Member "adversarial multiple access channels with individual injection rates":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "energy efficient adversarial routing in shared channels")
  Member "decentralized stochastic control with partial history sharing a common information approach":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "regret bounds for decentralized learning in cooperative multi agent dynamical systems")
  Member "approaching throughput optimality in distributed csma scheduling algorithms with collisions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "throughput optimal decentralized scheduling with single bit state feedback for a class of queueing systems")
  Member "fast mixing of parallel glauber dynamics and low delay csma scheduling":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "effective wireless scheduling via hypergraph sketches")
  Member "q csma queue length based csma ca algorithms for achieving maximum throughput and low delay in wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the power of randomization for scheduling real time traffic in wireless networks")
  Member "randomized scheduling algorithm for queueing networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on non preemptive vm scheduling in the cloud")

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.NI(Networking and Internet Architecture)