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 "on the connectivity and multihop delay of ad hoc cognitive radio networks"):
  Abstract: We analyze the multihop delay of ad hoc cognitive radio networks, where the transmission delay of each hop consists of the propagation delay and the waiting time for the availability of the communication channel (i.e., the occurrence of a spectrum opportunity at this hop). Using theories and techniques from continuum percolation and ergodicity, we establish the scaling law of the minimum multihop delay with respect to the source-destination distance in cognitive radio networks. When the propagation delay is negligible, we show the starkly different scaling behavior of the minimum multihop delay in instantaneously connected networks as compared to networks that are only intermittently connected due to scarcity of spectrum opportunities. Specifically, if the network is instantaneously connected, the minimum multihop delay is asymptotically independent of the distance; if the network is only intermittently connected, the minimum multihop delay scales linearly with the distance. When the propagation delay is nonnegligible but small, we show that although the scaling order is always linear, the scaling rate for an instantaneously connected network can be orders of magnitude smaller than the one for an intermittently connected network.

Includes members:
  Member "cognitive networks achieve throughput scaling of a homogeneous network":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "throughput scaling of covert communication over wireless adhoc networks")
  Member "information propagation speed in mobile and delay tolerant networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "diffusion on dynamic contact networks with indirect transmission links")
  Member "connectivity percolation and information dissemination in large scale wireless networks with dynamic links":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the performance analysis of epidemic routing in non sparse delay tolerant networks")
  Member "power control in cognitive radio networks how to cross a multi lane highway":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "spreading information in mobile wireless networks")
  Member "bandwidth partitioning in decentralized wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "reliability and local delay in wireless networks does bandwidth partitioning help")
  Member "scaling laws for overlaid wireless networks a cognitive radio network vs a primary network":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "an overview of the transmission capacity of wireless networks")
  Member "scaling laws of cognitive networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "exploiting self interference suppression for improved spectrum awareness efficiency in cognitive radio systems")

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)