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 "packet oblivious stable routing in multi hop wireless networks"):
  Abstract: In this work, we study the fundamental problem of scheduling communication in multi-hop wireless networks. #R##N#We focus on packet-oblivious routing protocols; that is, algorithms that do not take into account any historical information about packets or carried out by packets. Such protocols are well motivated in practice, as real forwarding protocols and corresponding data-link layer architectures are typically packet-oblivious. We provide a local-knowledge protocol, i.e., which is working without using any topological information, except for some upper bounds on the number of links and the network's degree, that is stable for a wide spectrum of packet injection rates. It is based on novel transmission schedules, called universally strong selectors, which, combined with some known queuing policies (LIS, SIS, NFS, FTG), makes it the best known local-knowledge packet-oblivious routing protocol regarding the injection rate for which stability is guaranteed. We also propose a global-knowledge protocol, which is stable if the packet injection rate per link is smaller than the inverse of the chromatic number of the collision graph associated with the network. Although the protocol does not take into account any historical information, it has to be seeded by some information about the network topology.

Includes members:
  Member "randomized communication in radio networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "packet latency of deterministic broadcasting in adversarial multiple access channels")
  Member "packet latency of deterministic broadcasting in adversarial multiple access channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "energy efficient adversarial routing in shared channels")
  Member "routing in wireless networks with interferences":
    also connected through other hyperedges:
      (none)
  Member "universal routing in multi hop radio networks":
    also connected through other hyperedges:
      (none)
  Member "stability of the max weight protocol in adversarial wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "routing in wireless networks with interferences")
  Member "bounds on stability and latency in wireless communication":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "probabilistic stability of traffic load balancing on wireless complex networks")

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)