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 "flooding time in opportunistic networks under power law and exponential inter contact times"):
  Abstract: Performance bounds for opportunistic networks have been derived in a number of recent papers for several key quantities, such as the expected delivery time of a unicast message, or the flooding time (a measure of how fast information spreads). However, to the best of our knowledge, none of the existing results is derived under a mobility model which is able to reproduce the power law+exponential tail dichotomy of the pairwise node inter-contact time distribution which has been observed in traces of several real opportunistic networks. #R##N#The contributions of this paper are two-fold: first, we present a simple pairwise contact model -- called the Home-MEG model -- for opportunistic networks based on the observation made in previous work that pairs of nodes in the network tend to meet in very few, selected locations (home locations); this contact model is shown to be able to faithfully reproduce the power law+exponential tail dichotomy of inter-contact time. Second, we use the Home-MEG model to analyze flooding time in opportunistic networks, presenting asymptotic bounds on flooding time that assume different initial conditions for the existence of opportunistic links. #R##N#Finally, our bounds provide some analytical evidences that the speed of information spreading in opportunistic networks can be much faster than that predicted by simple geometric mobility models.

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 "swim a simple model to generate small mobile worlds":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "lightweight joint simulation of vehicular mobility and communication with limosim")

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)