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: "dynamic packet scheduling in wireless networks"
  Abstract: We consider protocols that serve communication requests arising over time in a wireless network that is subject to interference. Unlike previous approaches, we take the geometry of the network and power control into account, both allowing to increase the network's performance significantly. We introduce a stochastic and an adversarial model to bound the packet injection. Although taken as the primary motivation, this approach is not only suitable for models based on the signal-to-interference-plus-noise ratio (SINR). It also covers virtually all other common interference models, for example the multiple-access channel, the radio-network model, the protocol model, and distance-2 matching. Packet-routing networks allowing each edge or each node to transmit or receive one packet at a time can be modeled as well. #R##N#Starting from algorithms for the respective scheduling problem with static transmission requests, we build distributed stable protocols. This is more involved than in previous, similar approaches because the algorithms we consider do not necessarily scale linearly when scaling the input instance. We can guarantee a throughput that is as large as the one of the original static algorithm. In particular, for SINR models the competitive ratios of the protocol in comparison to optimal ones in the respective model are between constant and O(log^2 m) for a network of size m.

Connected through hyperedge HE-1 (induced by source paper "effective wireless scheduling via hypergraph sketches"):
  with members:
    - "wireless link capacity under shadowing and fading"
    - "the price of local power control in wireless scheduling"
    - "how well can graphs represent wireless interference"
    - "beyond geometry towards fully realistic wireless models"
    - "jamming resistant learning in wireless networks"
    - "online independent set beyond the worst case secretaries prophets and periods"
    - "on the complexity of the minimum latency scheduling problem on the euclidean plane"
    - "algorithms for wireless capacity"

Connected through hyperedge HE-2 (induced by source paper "spanning trees with edge conflicts and wireless connectivity"):
  with members:
    - "wireless link capacity under shadowing and fading"
    - "the price of local power control in wireless scheduling"
    - "how well can graphs represent wireless interference"
    - "beyond geometry towards fully realistic wireless models"
    - "online independent set beyond the worst case secretaries prophets and periods"
    - "algorithms for wireless capacity"
    - "graph products revisited tight approximation hardness of induced matching poset dimension and more"
    - "nearly optimal bounds for distributed wireless scheduling in the sinr model"

Connected through hyperedge HE-3 (induced by source paper "wireless link capacity under shadowing and fading"):
  with members:
    - "3d channel model in 3gpp"
    - "beyond geometry towards fully realistic wireless models"
    - "approximation algorithms for wireless link scheduling with flexible data rates"
    - "a fully distributed algorithm for throughput performance in wireless networks"
    - "algorithms for wireless capacity"
    - "secondary spectrum auctions for symmetric and submodular bidders"
    - "wireless connectivity and capacity"
    - "wireless capacity with oblivious power in general metrics"

Connected through hyperedge HE-4 (induced by source paper "routing in wireless networks with interferences"):
  with members:
    - "stability of the max weight protocol in adversarial wireless networks"
    - "bounds on stability and latency in wireless communication"

Connected through hyperedge HE-5 (induced by source paper "beyond geometry towards fully realistic wireless models"):
  with members:
    - "wireless scheduling algorithms in complex environments"
    - "jamming resistant learning in wireless networks"
    - "distributed deterministic broadcasting in uniform power ad hoc wireless networks"
    - "online independent set beyond the worst case secretaries prophets and periods"
    - "approximation algorithms for wireless link scheduling with flexible data rates"
    - "distributed connectivity of wireless networks"
    - "mlls minimum length link scheduling under physical interference model"
    - "the power of non uniform wireless power"

Connected through hyperedge HE-6 (induced by source paper "how well can graphs represent wireless interference"):
  with members:
    - "beyond geometry towards fully realistic wireless models"
    - "wireless scheduling algorithms in complex environments"
    - "approximation algorithms for wireless link scheduling with flexible data rates"
    - "on the complexity of the minimum latency scheduling problem on the euclidean plane"
    - "algorithms for wireless capacity"
    - "secondary spectrum auctions for symmetric and submodular bidders"
    - "wireless capacity and admission control in cognitive radio"
    - "wireless connectivity and capacity"

Connected through hyperedge HE-7 (induced by source paper "on the impact of geometry on ad hoc communication in wireless networks"):
  with members:
    - "randomized broadcast in radio networks with collision detection"
    - "distributed deterministic broadcasting in uniform power ad hoc wireless networks"
    - "towards tight bounds for local broadcasting"
    - "nearly optimal bounds for distributed wireless scheduling in the sinr model"
    - "wireless connectivity and capacity"
    - "a note on uniform power connectivity in the sinr model"

Connected through hyperedge HE-8 (induced by source paper "jamming resistant learning in wireless networks"):
  with members:
    - "competitive mac under adversarial sinr"
    - "algorithms for wireless capacity"
    - "wireless capacity and admission control in cognitive radio"
    - "wireless connectivity and capacity"
    - "a jamming resistant mac protocol for multi hop wireless networks"
    - "on a game theoretic approach to capacity maximization in wireless networks"
    - "approximation algorithms for secondary spectrum auctions"

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)