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 "random gossip processes in smartphone peer to peer networks"):
  Abstract: In this paper, we study random gossip processes in communication models that describe the peer-to-peer networking functionality included in standard smartphone operating systems. Random gossip processes spread information through the basic mechanism of randomly selecting neighbors for connections. These processes are well-understood in standard peer-to-peer network models, but little is known about their behavior in models that abstract the smartphone peer-to-peer setting. With this in mind, we begin by studying a simple random gossip process in the synchronous mobile telephone model (the most common abstraction used to study smartphone peer-to-peer systems). By introducing a new analysis technique, we prove that this simple process is actually more efficient than the best-known gossip algorithm in the mobile telephone model, which required complicated coordination among the nodes in the network. We then introduce a novel variation of the mobile telephone model that removes the synchronized round assumption, shrinking the gap between theory and practice. We prove that simple random gossip processes still converge in this setting and that information spreading still improves along with graph connectivity. This new model and the tools we introduce provide a solid foundation for the further theoretical analysis of algorithms meant to be deployed on real smartphone peer-to-peer networks. More generally, our results in this paper imply that simple random information spreading processes should be expected to perform well in this emerging new peer-to-peer setting.

Includes members:
  Member "gossip in a smartphone peer to peer network":
    also connected through other hyperedges:
      (none)
  Member "how to discreetly spread a rumor in a crowd":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "who started this rumor quantifying the natural differential privacy guarantees of gossip protocols")
  Member "energy efficient resource allocation for device to device underlay communication":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "distributed artificial intelligence solution for d2d communication in 5g networks")
  Member "tight bounds for rumor spreading with vertex expansion":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the capacity of smartphone peer to peer networks")

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.DC(Distributed, Parallel, and Cluster Computing)