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 "information dissemination speed in delay tolerant urban vehicular networks in a hyperfractal setting"):
  Abstract: This paper studies the fundamental communication properties of urban vehicle networks by exploiting the self-similarity and hierarchical organization of modern cities. We use an innovative model called "hyperfractal" that captures the self-similarities of both the traffic and vehicle locations but avoids the extremes of regularity and randomness. We use analytical tools to derive theoretical upper and lower bounds for the information propagation speed in an urban delay tolerant network (i.e., a network that is disconnected at all time, and thus uses a store-carry-and-forward routing model). We prove that the average broadcast time behaves as $n^{1-\delta}$ times a slowly varying function, where $\delta$ depends on the precise fractal dimension. #R##N#Furthermore, we show that the broadcast speedup is due in part to an interesting self-similar phenomenon, that we denote as {\em information teleportation}. This phenomenon arises as a consequence of the topology of the vehicle traffic, and triggers an acceleration of the broadcast time. We show that our model fits real cities where open traffic data sets are available. We present simulations confirming the validity of the bounds in multiple realistic settings, including scenarios with variable speed, using both QualNet and a discrete-event simulator in Matlab.

Includes members:
  Member "poisson cox point processes for vehicular networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "coverage and rate analysis of downlink cellular vehicle to everything c v2x communication")
  Member "cost estimation of a fixed network deployment over an urban territory":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a combined stochastic and physical framework for modeling indoor 5g millimeter wave propagation")
  Member "wireless fractal cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the capacity of fractal d2d social networks with hierarchical communications")
  Member "random linear multihop relaying in a general field of interferers using spatial aloha":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "coverage and rate analysis of downlink cellular vehicle to everything c v2x communication")
  Member "information propagation speed in mobile and delay tolerant networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "diffusion on dynamic contact networks with indirect transmission links")

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)