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: "maximum throughput of multiple access channels in adversarial environments"
  Abstract: We consider deterministic distributed broadcasting on multiple access channels in the framework of adversarial queuing. Packets are injected dynamically by an adversary that is constrained by the injection rate and the number of packets that may be injected simultaneously; the latter we call burstiness. A protocol is stable when the number of packets in queues at the stations stays bounded. The maximum injection rate that a protocol can handle in a stable manner is called the throughput of the protocol. We consider adversaries of injection rate 1, that is, of one packet per round, to address the question if the maximum throughput 1 can be achieved, and if so then with what quality of service. We develop a protocol that achieves throughput 1 for any number of stations against leaky-bucket adversaries. The protocol has #N#                  #N#                    #N#                  #N#                  $${\mathcal{O}(n^2+\text{burstiness})}$$#N#                 packets queued simultaneously at any time, where n is the number of stations; this upper bound is proved to be best possible. A protocol is called fair when each packet is eventually broadcast. We show that no protocol can be both stable and fair for a system of at least two stations against leaky-bucket adversaries. We study in detail small systems of exactly two and three stations against window adversaries to exhibit differences in quality of broadcast among classes of protocols. A protocol is said to have fair latency if the waiting time of packets is #N#                  #N#                    #N#                  #N#                  $${\mathcal{O}(\text{burstiness})}$$#N#                . For two stations, we show that fair latency can be achieved by a full sensing protocol, while there is no stable acknowledgment based protocol. For three stations, we show that fair latency can be achieved by a general protocol, while no full sensing protocol can be stable. Finally, we show that protocols that either are fair or do not have the queue sizes affect the order of transmissions cannot be stable in systems of at least four stations against window adversaries.

Connected through hyperedge HE-1 (induced by source paper "energy efficient adversarial routing in shared channels"):
  with members:
    - "the energy complexity of broadcast"
    - "packet latency of deterministic broadcasting in adversarial multiple access channels"
    - "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"

Connected through hyperedge HE-2 (induced by source paper "packet latency of deterministic broadcasting in adversarial multiple access channels"):
  with members:
    - "randomized communication in radio networks"
    - "scalable wake up of multi channel single hop radio networks"
    - "broadcasting in ad hoc multiple access channels"
    - "competitive mac under adversarial sinr"
    - "adversarial multiple access channels with individual injection rates"
    - "unbounded contention resolution in multiple access channels"
    - "source routing and scheduling in packet networks"

Connected through hyperedge HE-3 (induced by source paper "scalable wake up of multi channel single hop radio networks"):
  with members:
    - "packet latency of deterministic broadcasting in adversarial multiple access channels"
    - "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"

Connected through hyperedge HE-4 (induced by source paper "stability of adversarial routing with feedback"):
  with members:
    - "broadcasting in ad hoc multiple access channels"
    - "stability of the max weight protocol in adversarial wireless networks"
    - "adaptive uncertainty resolution in bayesian combinatorial optimization problems"

Connected through hyperedge HE-5 (induced by source paper "broadcasting in ad hoc multiple access channels"):
  with members:
    - "randomized communication in radio networks"
    - "adversarial multiple access channels with individual injection rates"
    - "dynamic sharing of a multiple access channel"

Connected through hyperedge HE-6 (induced by source paper "adversarial multiple access channels with individual injection rates"):
  with members:
    - "randomized communication in radio networks"
    - "broadcasting in ad hoc multiple access channels"
    - "dynamic sharing of a multiple access channel"

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