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 "improved bounds on information dissemination by manhattan random waypoint model"):
  Abstract: With the popularity of portable wireless devices it is important to model and predict how information or contagions spread by natural human mobility - for understanding the spreading of deadly infectious diseases and for improving delay tolerant communication schemes. Formally, we model this problem by considering M moving agents, where each agent initially carries a distinct bit of information. When two agents are at the same location or in close proximity to one another, they share all their information with each other. We would like to know the time it takes until all bits of information reach all agents, called the flood time, and how it depends on the way agents move, the size and shape of the network and the number of agents moving in the network.   We provide rigorous analysis for the Manhattan Random Way-point model (which takes paths with minimum number of turns), a convenient model used previously to analyze mobile agents, and find that with high probability the flood time is bounded by O (N log M[(N/M) log(NM)]), where M agents move on an N × N grid. In addition to extensive simulations, we use a data set of taxi trajectories to show that our method can successfully predict flood times in both experimental settings and the real world.

Includes members:
  Member "information spreading in dynamic graphs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "relative hausdorff distance for network analysis")
  Member "tight bounds on information dissemination in sparse mobile networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "mobile conductance in sparse networks and mobility connectivity tradeoff")
  Member "inferring networks of diffusion and influence":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "deep collaborative embedding for information cascade prediction")
  Member "fast flooding over manhattan":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "information spreading in dynamic graphs")
  Member "modelling mobility a discrete revolution":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "information spreading in dynamic graphs")

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.MA(Multiagent Systems)