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: "resource oblivious sorting on multicores"
  Abstract: We present a deterministic sorting algorithm, Sample, Partition, and Merge Sort (SPMS), that interleaves the partitioning of a sample sort with merging. Sequentially, it sorts n elements in O(nlog n) time cache-obliviously with an optimal number of cache misses. The parallel complexity (or critical path length) of the algorithm is O(log nlog log n), which improves on previous bounds for deterministic sample sort. The algorithm also has low false sharing costs. When scheduled by a work-stealing scheduler in a multicore computing environment with a global shared memory and p cores, each having a cache of size M organized in blocks of size B, the costs of the additional cache misses and false sharing misses due to this parallel execution are bounded by the cost of O(S · M/B) and O(S · B) cache misses, respectively, where S is the number of steals performed during the execution. Finally, SPMS is resource oblivious in that the dependence on machine parameters appear only in the analysis of its performance and not within the algorithm itself.

Connected through hyperedge HE-1 (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"
    - "parallel ordered sets using join"
    - "extending the nested parallel model to the nested dataflow model with provably efficient schedulers"

Connected through hyperedge HE-2 (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"
    - "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"

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

Connected through hyperedge HE-4 (induced by source paper "a lower bound technique for communication in bsp"):
  with members:
    - "efficient algorithms with asymmetric read and write costs"
    - "communication lower bounds for distributed memory computations"
    - "network oblivious algorithms"
    - "communication lower bounds for distributed memory computations"
    - "minimizing communication in linear algebra"

Connected through hyperedge HE-5 (induced by source paper "bounding cache miss costs of multithreaded computations under general schedulers"):
  with members:
    - "network oblivious algorithms"
    - "efficient resource oblivious algorithms for multicores"

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

Connected through hyperedge HE-7 (induced by source paper "network oblivious algorithms"):
  with members:
    - "communication lower bounds for distributed memory computations"
    - "communication lower bounds for distributed memory computations"
    - "space round tradeoffs for mapreduce computations"
    - "minimizing communication in linear algebra"

Connected through hyperedge HE-8 (induced by source paper "practical massively parallel sorting"):
  with members:
    - "communication efficient algorithms for top k selection problems"
    - "engineering parallel string sorting"

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)