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 "skeap leap scalable distributed priority queues for constant and arbitrary priorities"):
  Abstract: We propose two protocols for distributed priority queues (denoted by 'heap' for simplicity in this paper) called SKEAP and LEAP. SKEAP realizes a distributed heap for a constant amount of priorities and LEAP one for an arbitrary amount. Both protocols build on an overlay, which induces an aggregation tree on which heap operations are aggregated in batches, ensuring that our protocols scale even for a high rate of incoming requests. As part of LEAP we provide a novel distributed protocol for the $k$-selection problem that runs in time $\mathcal O(\log n)$ w.h.p. SKEAP guarantees sequential consistency for its heap operations, while LEAP guarantees linearizability. SKEAP and LEAP provide logarithmic runtimes w.h.p. on all their operations.

Includes members:
  Member "skueue a scalable and sequentially consistent distributed queue":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a loosely self stabilizing protocol for randomized congestion control with logarithmic memory")
  Member "optimal gossip algorithms for exact and approximate quantile computations":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "distributed data summarization in well connected 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)