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 "gossip based information spreading in mobile networks"):
  Abstract: Mobile networks receive increasing research interest recently due to their increasingly wide applications in various areas; mobile ad hoc networks (MANET) and Vehicular ad hoc networks (VANET) are two prominent examples. Mobility introduces challenges as well as opportunities: it is known to improve the network throughput as shown in [1]. In this paper, we analyze the effect of mobility on the information spreading based on gossip algorithms. Our contributions are twofold. Firstly, we propose a new performance metric, mobile conductance, which allows us to separate the details of mobility models from the study of mobile spreading time. Secondly, we explore the mobile conductances of several popular mobility models, and offer insights on the corresponding results. Large scale network simulation is conducted to verify our analysis.

Includes members:
  Member "tight bounds on information dissemination in sparse mobile networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "improved bounds on information dissemination by manhattan random waypoint model")
  Member "information spreading in stationary markovian evolving graphs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "how fast can we reach a target vertex in stochastic temporal graphs")
  Member "information propagation speed in mobile and delay tolerant networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "diffusion on dynamic contact networks with indirect transmission links")
  Member "manets high mobility can make up for low transmission power":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "percolation of lipschitz surface and tight bounds on the spread of information among mobile agents")
  Member "the impact of mobility on gossip algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "sample greedy gossip distributed kalman filter")
  Member "product multicommodity flow in wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "the balanced unicast and multicast capacity regions of large wireless networks")
  Member "throughput and delay in random wireless networks with restricted mobility":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on throughput capacity for a class of buffer limited manets")
  Member "fast distributed algorithms for computing separable functions":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "distributed voting in beep model")

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.SI(Social and Information Networks)