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: "stability of the max weight protocol in adversarial wireless networks"
  Abstract: In this paper we consider the Max-Weight protocol for routing and scheduling in wireless networks under an adversarial model. This protocol has received a significant amount of attention dating back to the papers of Tassiulas and Ephremides. In particular, this protocol is known to be throughput-optimal whenever the traffic patterns and propagation conditions are governed by a stationary stochastic process. #R##N#However, the standard proof of throughput optimality (which is based on the negative drift of a quadratic potential function) does not hold when the traffic patterns and the edge capacity changes over time are governed by an arbitrary adversarial process. Such an environment appears frequently in many practical wireless scenarios when the assumption that channel conditions are governed by a stationary stochastic process does not readily apply. #R##N#In this paper we prove that even in the above adversarial setting, the Max-Weight protocol keeps the queues in the network stable (i.e. keeps the queue sizes bounded) whenever this is feasible by some routing and scheduling algorithm. However, the proof is somewhat more complex than the negative potential drift argument that applied in the stationary case. Our proof holds for any arbitrary interference relationships among edges. We also prove the stability of $\ep$-approximate Max-Weight under the adversarial model. We conclude the paper with a discussion of queue sizes in the adversarial model as well as a set of simulation results.

Connected through hyperedge HE-1 (induced by source paper "packet oblivious stable routing in multi hop wireless networks"):
  with members:
    - "randomized communication in radio networks"
    - "packet latency of deterministic broadcasting in adversarial multiple access channels"
    - "routing in wireless networks with interferences"
    - "universal routing in multi hop radio networks"
    - "bounds on stability and latency in wireless communication"

Connected through hyperedge HE-2 (induced by source paper "routing in wireless networks with interferences"):
  with members:
    - "dynamic packet scheduling in wireless networks"
    - "bounds on stability and latency in wireless communication"

Connected through hyperedge HE-3 (induced by source paper "network utility maximization in adversarial environments"):
  with members:
    - "a survey on wireless security technical challenges recent advances and future trends"

Connected through hyperedge HE-4 (induced by source paper "universal routing in multi hop radio networks"):
  with members:
    - "bounds on stability and latency in wireless communication"
    - "source routing and scheduling in packet networks"

Connected through hyperedge HE-5 (induced by source paper "stability of adversarial routing with feedback"):
  with members:
    - "broadcasting in ad hoc multiple access channels"
    - "maximum throughput of multiple access channels in adversarial environments"
    - "adaptive uncertainty resolution in bayesian combinatorial optimization problems"

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)