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 "universal routing in multi hop radio networks"):
  Abstract: In this article we introduce a new model to study stability in multi-hop wireless networks in the framework of adversarial queueing. In such a model, a routing protocol consists of three components: a transmission policy, a scheduling policy to select the packet to transmit form a set of packets parked at a node, and a hearing control mechanism to coordinate transmissions with scheduling. For such a setting, we propose a definition of universal stability that takes into account not only the scheduling policies (as in the standard wireline adversarial model), but also the transmission policies. First, we show that any scheduling policy that is unstable in the classical wireline adversarial model remains unstable in the multi-hop radio network model, even in scenarios free of inter- ferences. Then, we show that both SIS and LIS (two well-known universally stable scheduling policies in the wireline adversarial model) remain stable in the multi-hop radio network model, provided a proactive hearing control is used. In contrast, such scheduling policies turn out to be unstable when using a reactive hearing control. However, the scheduling policy LIS can be enforced to be universally stable provided ties are resolved in a permanent manner. Such a situation doesn't hold in the case of SIS, which remains unstable regardless of how ties are resolved. Furthermore, for some transmission policies which we call regular, we also show that all scheduling policies that are universally stable when using proactive hearing control (which include SIS and LIS) remain universally stable when using reactive hearing control.

Includes members:
  Member "stability of the max weight protocol in adversarial wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "packet oblivious stable routing in multi hop wireless networks")
  Member "bounds on stability and latency in wireless communication":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "packet oblivious stable routing in multi hop wireless networks")
  Member "source routing and scheduling in packet networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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.NI(Networking and Internet Architecture)