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 "parallel wavelet tree construction"):
  Abstract: We present parallel algorithms for wavelet tree construction with polylogarithmic depth, improving upon the linear depth of the recent parallel algorithms by Fuentes-Sepulveda et al. We experimentally show that on a 40-core machine with two-way hyper-threading, we outperform the existing parallel algorithms by 1.3--5.6x and achieve up to 27x speedup over the sequential algorithm on a variety of real-world and artificial inputs. Our algorithms show good scalability with increasing thread count, input size and alphabet size. We also discuss extensions to variants of the standard wavelet tree.

Includes members:
  Member "parallelism in randomized incremental algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "relaxed scheduling for scalable belief propagation")
  Member "parallel local graph clustering":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "efficient estimation of heat kernel pagerank for local clustering")
  Member "sorting with asymmetric read and write costs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "semi asymmetric parallel graph algorithms for nvrams")
  Member "efficient algorithms with asymmetric read and write costs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "semi asymmetric parallel graph algorithms for nvrams")
  Member "wavelet trees meet suffix trees":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "translating between wavelet tree and wavelet matrix construction")
  Member "counting triangles in massive graphs with mapreduce":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "parallel algorithms for small subgraph counting")
  Member "parallel graph decompositions using random shifts":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "scattering and sparse partitions and their applications")
  Member "skew strikes back new developments in the theory of join algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "fast join project query evaluation using matrix multiplication")

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.DS(Data Structures and Algorithms)