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: "information propagation speed in mobile and delay tolerant networks"
  Abstract: The goal of this paper is to increase our understanding of the fundamental performance limits of mobile and Delay Tolerant Networks (DTNs), where end-to-end multi-hop paths may not exist and communication routes may only be available through time and mobility. We use analytical tools to derive generic theoretical upper bounds for the information propagation speed in large scale mobile and intermittently connected networks. In other words, we upper-bound the optimal performance, in terms of delay, that can be achieved using any routing algorithm. We then show how our analysis can be applied to specific mobility and graph models to obtain specific analytical estimates. In particular, in two-dimensional networks, when nodes move at a maximum speed $v$ and their density $\nu$ is small (the network is sparse and surely disconnected), we prove that the information propagation speed is upper bounded by ($1+O(\nu^2))v$ in the random way-point model, while it is upper bounded by $O(\sqrt{\nu v} v)$ for other mobility models (random walk, Brownian motion). We also present simulations that confirm the validity of the bounds in these scenarios. Finally, we generalize our results to one-dimensional and three-dimensional networks.

Connected through hyperedge HE-1 (induced by source paper "diffusion on dynamic contact networks with indirect transmission links"):
  with members:
    - "lightweight mobile ad hoc network routing protocols for smartphones"
    - "impact of indirect contacts in emerging infectious disease on social networks"
    - "least cost influence maximization across multiple social networks"
    - "diffusion in colocation contact networks the impact of nodal spatiotemporal dynamics"
    - "an introduction to temporal graphs an algorithmic perspective"
    - "common neighbours and the local community paradigm for topological link prediction in bipartite networks"
    - "latent self exciting point process model for spatial temporal networks"
    - "time varying graphs and dynamic networks"

Connected through hyperedge HE-2 (induced by source paper "secure communication in dynamic wireless ad hoc networks"):
  with members:
    - "k connectivity in random key graphs with unreliable links"
    - "tradeoff between delay and physical layer security in wireless networks"
    - "directional cell search delay analysis for cellular networks with static users"
    - "toward a tractable delay analysis in ultra dense networks"
    - "connectivity in secure wireless sensor networks under transmission constraints"
    - "on topological properties of wireless sensor networks under the q composite key predistribution scheme with on off channels"
    - "physical layer security in cellular networks a stochastic geometry approach"
    - "on the throughput cost of physical layer security in decentralized wireless networks"

Connected through hyperedge HE-3 (induced by source paper "generating dynamic contact graphs with indirect links"):
  with members:
    - "indirect interactions influence contact network structure and diffusion dynamics"
    - "impact of indirect contacts in emerging infectious disease on social networks"
    - "exploiting temporal complex network metrics in mobile malware containment"

Connected through hyperedge HE-4 (induced by source paper "indirect interactions influence contact network structure and diffusion dynamics"):
  with members:
    - "a graph model with indirect co location links"
    - "the role of social networks in information diffusion"

Connected through hyperedge HE-5 (induced by source paper "information dissemination speed in delay tolerant urban vehicular networks in a hyperfractal setting"):
  with members:
    - "poisson cox point processes for vehicular networks"
    - "cost estimation of a fixed network deployment over an urban territory"
    - "wireless fractal cellular networks"
    - "random linear multihop relaying in a general field of interferers using spatial aloha"

Connected through hyperedge HE-6 (induced by source paper "improved bounds on the epidemic threshold of exact sis models on complex networks"):
  with members:
    - "analysis of exact and approximated epidemic models over complex networks"
    - "sirs epidemics on complex networks concurrence of exact markov chain and approximated models"

Connected through hyperedge HE-7 (induced by source paper "sirs epidemics on complex networks concurrence of exact markov chain and approximated models"):
  with members:
    - "stability of epidemic models over directed graphs a positive systems approach"

Connected through hyperedge HE-8 (induced by source paper "energy efficient broadcast in mobile networks subject to channel randomness"):
  with members:
    - "energy efficiency evaluation of cellular networks based on spatial distributions of traffic load and power consumption"

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.IT(Information Theory)