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 "connectivity of cooperative ad hoc networks"):
  Abstract: The connectivity properties of ad hoc networks have been extensively studied over the past few years, from local observables, to global network properties. In this paper we introduce a novel layer of network dynamics which lives and evolves on top of the ad hoc network. Nodes are assumed selfish and a snow-drift type game is defined dictating the way nodes decide to allocate their cooperative resource efforts towards other nodes in the network. The dynamics are strongly coupled with the physical network causing the cooperation network topology to converge towards a stable equilibrium state, a global maximum of the total pay-off. We study this convergence from a connectivity perspective and analyse the inherent parameter dependence. Moreover, we show that direct reciprocity can be an efficient incentive to promote cooperation within the network and discuss the analogies between our simple yet tractable framework with D2D proximity based services such as LTE-Direct. We argue that cooperative network dynamics have many application in ICT, not just ad hoc networks, and similar models as the one described herein can be devised and studied in their own right.

Includes members:
  Member "multihop connectivity of ad hoc networks with randomly oriented directional antennas":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "spatial networks with wireless applications")
  Member "location location location border effects in interference limited ad hoc networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "spatial networks with wireless applications")
  Member "connectivity scaling laws in wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "spatial networks with wireless applications")
  Member "network connectivity in non convex domains with reflections":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "spatial networks with wireless applications")
  Member "more is less connectivity in fractal regions":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "spatial networks with wireless applications")
  Member "connectivity of confined 3d networks with anisotropically radiating nodes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "spatial networks with wireless applications")

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)