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 "finite time convergent gossiping"):
  Abstract: Gossip algorithms are widely used in modern distributed systems, with applications ranging from sensor networks and peer-to-peer networks to mobile vehicle networks and social networks. A tremendous research effort has been devoted to analyzing and improving the asymptotic rate of convergence for gossip algorithms. In this work we study finite-time convergence of deterministic gossiping. We show that there exists a symmetric gossip algorithm that converges in finite time if and only if the number of network nodes is a power of two, while there always exists an asymmetric gossip algorithm with finite-time convergence, independent of the number of nodes. For    $n=2^m$   nodes, we prove that a fastest convergence can be reached in    $nm=n\log_2 n$   node updates via symmetric gossiping. On the other hand, under asymmetric gossip among   $n=2^m+r$   nodes with   $0\leq r   , it takes at least   $mn+2r$   node updates for achieving finite-time convergence. It is also shown that the existence of finite-time convergent gossiping often imposes strong structural requirements on the underlying interaction graph. Finally, we apply our results to gossip algorithms in quantum networks, where the goal is to control the state of a quantum system via pairwise interactions. We show that finite-time convergence is never possible for such systems.

Includes members:
  Member "consensus over random graph processes network borel cantelli lemmas for almost sure convergence":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "dynamics of opinions with social biases")
  Member "finite time consensus using stochastic matrices with positive diagonals":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "lyapunov criterion for stochastic systems and its applications in distributed computation")
  Member "the evolution of beliefs over signed social networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a geometric model of opinion polarization")
  Member "analysis of sum weight like algorithms for averaging in wireless sensor networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "sample greedy gossip distributed kalman filter")
  Member "opinion fluctuations and disagreement in social networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "shifting opinions in a social network through leader selection")
  Member "convergence rate analysis of distributed gossip linear parameter estimation fundamental limits and tradeoffs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "supervised learning under distributed features")
  Member "gossip algorithms for distributed signal processing":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "inverse graph learning over optimization networks")
  Member "order optimal consensus through randomized path averaging":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "multi scale spectrum sensing in dense multi cell cognitive 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)