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 write efficient algorithms and data structures for computational geometry"):
  Abstract: In this paper, we design parallel write-efficient geometric algorithms that perform asymptotically fewer writes than standard algorithms for the same problem. This is motivated by emerging non-volatile memory technologies with read performance being close to that of random access memory but writes being significantly more expensive in terms of energy and latency. We design algorithms for planar Delaunay triangulation, k -d trees, and static and dynamic augmented trees. Our algorithms are designed in the recently introduced Asymmetric Nested-Parallel Model, which captures the parallel setting in which there is a small symmetric memory where reads and writes are unit cost as well as a large asymmetric memory where writes are $omega$ times more expensive than reads. In designing these algorithms, we introduce several techniques for obtaining write-efficiency, including DAG tracing, prefix doubling, and α-labeling, which we believe will be useful for designing other parallel write-efficient algorithms.

Includes members:
  Member "algorithmic building blocks for asymmetric memories":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "semi asymmetric parallel graph algorithms for nvrams")
  Member "parallelism in randomized incremental algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "relaxed scheduling for scalable belief propagation")
  Member "pam parallel augmented maps":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "optimal parallel algorithms in the binary forking model")
  Member "sorting 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 "efficient algorithms with asymmetric read and write costs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "semi asymmetric parallel graph algorithms for nvrams")
  Member "fast parallel operations on search trees":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "communication efficient weighted reservoir sampling from fully distributed data streams")
  Member "wear minimization for cuckoo hashing how not to throw a lot of eggs into one basket":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "robust set reconciliation via locality sensitive hashing")

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)