human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "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.

Connected through hyperedge HE-1 (induced by source paper "semi asymmetric parallel graph algorithms for nvrams"):
  with members:
    - "pangolin a fault tolerant persistent memory programming library"
    - "tracking in order to recover recoverable lock free data structures"
    - "write optimized and consistent rdma based nvm systems"
    - "single machine graph analytics on massive datasets using intel optane dc persistent memory"
    - "multiversion concurrency with bounded delay and precise garbage collection"
    - "persistent memory i o primitives"
    - "persistent buffer management with optimistic consistency"
    - "basic performance measurements of the intel optane dc persistent memory module"

Connected through hyperedge HE-2 (induced by source paper "optimal parallel algorithms in the binary forking model"):
  with members:
    - "parallel finger search structures"
    - "theoretically efficient parallel graph algorithms can be fast and scalable"
    - "parallel working set search structures"
    - "parallelism in randomized incremental algorithms"
    - "pam parallel augmented maps"
    - "resource oblivious sorting on multicores"
    - "parallel ordered sets using join"
    - "extending the nested parallel model to the nested dataflow model with provably efficient schedulers"

Connected through hyperedge HE-3 (induced by source paper "theoretically efficient and practical parallel dbscan"):
  with members:
    - "parallelism in randomized incremental algorithms"
    - "dbscan towards fast and scalable density clustering"
    - "scalable density based distributed clustering"

Connected through hyperedge HE-4 (induced by source paper "improved parallel cache oblivious algorithms for dynamic programming and linear algebra"):
  with members:
    - "persistent memory i o primitives"
    - "algorithmic building blocks for asymmetric memories"
    - "the parallel persistent memory model"
    - "resource oblivious sorting on multicores"
    - "implicit decomposition for write efficient connectivity algorithms"
    - "on the fine grained complexity of one dimensional dynamic programming"
    - "extending the nested parallel model to the nested dataflow model with provably efficient schedulers"
    - "parallel shortest paths using radius stepping"

Question: Please tell me which class the center node 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)