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 "mobile conductance in sparse networks and mobility connectivity tradeoff"):
  Abstract: In this paper, our recently proposed mobile-conductance based analytical framework is extended to the sparse settings, thus offering a unified tool for analyzing information spreading in mobile networks. A penalty factor is identified for information spreading in sparse networks as compared to the connected scenario, which is then intuitively interpreted and verified by simulations. With the analytical results obtained, the mobility-connectivity tradeoff is quantitatively analyzed to determine how much mobility may be exploited to make up for network connectivity deficiency.

Includes members:
  Member "mobile conductance and gossip based information spreading in mobile networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "rateless coding assisted multi packet spreading over mobile networks")
  Member "gossip based information spreading in mobile networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "virtual mimo boosted information propagation on highways")
  Member "tight bounds on information dissemination in sparse mobile networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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-4 (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-5 (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-6 (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-7 (induced by source paper "sample greedy gossip distributed kalman filter")

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)