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: "sorting with asymmetric read and write costs"
  Abstract: Emerging memory technologies have a significant gap between the cost, both in time and in energy, of writing to memory versus reading from memory. In this paper we present models and algorithms that account for this difference, with a focus on write-efficient sorting algorithms. First, we consider the PRAM model with asymmetric write cost, and show that sorting can be performed in O(n) writes, O(n log n) reads, and logarithmic depth (parallel time). Next, we consider a variant of the External Memory (EM) model that charges k > 1 for writing a block of size B to the secondary memory, and present variants of three EM sorting algorithms (multi-way merge sort, sample sort, and heap sort using buffer trees) that asymptotically reduce the number of writes over the original algorithms, and perform roughly k block reads for every block write. Finally, we define a variant of the Ideal-Cache model with asymmetric write costs, and present write-efficient,cache-oblivious parallel algorithms for sorting, FFTs, and matrix multiplication. Adapting prior bounds for work-stealing and parallel-depth-first schedulers to the asymmetric setting, these yield provably good bounds for parallel machines with private caches or with a shared cache, respectively.

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 write efficient algorithms and data structures for computational geometry"
    - "parallel working set search structures"
    - "parallelism in randomized incremental algorithms"
    - "pam parallel augmented maps"
    - "resource oblivious sorting on multicores"
    - "parallel ordered sets using join"

Connected through hyperedge HE-3 (induced by source paper "improved parallel cache oblivious algorithms for dynamic programming and linear algebra"):
  with members:
    - "persistent memory i o primitives"
    - "parallel write efficient algorithms and data structures for computational geometry"
    - "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"

Connected through hyperedge HE-4 (induced by source paper "parallel write efficient algorithms and data structures for computational geometry"):
  with members:
    - "algorithmic building blocks for asymmetric memories"
    - "parallelism in randomized incremental algorithms"
    - "pam parallel augmented maps"
    - "efficient algorithms with asymmetric read and write costs"
    - "fast parallel operations on search trees"
    - "wear minimization for cuckoo hashing how not to throw a lot of eggs into one basket"

Connected through hyperedge HE-5 (induced by source paper "the parallel persistent memory model"):
  with members:
    - "alpaca intermittent execution without checkpoints"
    - "resource oblivious sorting on multicores"
    - "implicit decomposition for write efficient connectivity algorithms"
    - "efficient algorithms with asymmetric read and write costs"
    - "lock free concurrent data structures"

Connected through hyperedge HE-6 (induced by source paper "histogram sort with sampling"):
  with members:
    - "practical massively parallel sorting"

Connected through hyperedge HE-7 (induced by source paper "implicit decomposition for write efficient connectivity algorithms"):
  with members:
    - "efficient algorithms with asymmetric read and write costs"
    - "wear minimization for cuckoo hashing how not to throw a lot of eggs into one basket"
    - "parallel graph decompositions using random shifts"

Connected through hyperedge HE-8 (induced by source paper "parallel wavelet tree construction"):
  with members:
    - "parallelism in randomized incremental algorithms"
    - "parallel local graph clustering"
    - "efficient algorithms with asymmetric read and write costs"
    - "wavelet trees meet suffix trees"
    - "counting triangles in massive graphs with mapreduce"
    - "parallel graph decompositions using random shifts"
    - "skew strikes back new developments in the theory of join algorithms"
    - "parallel triangle counting in massive streaming graphs"

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)