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: "implicit decomposition for write efficient connectivity algorithms"
  Abstract: The future of main memory appears to lie in the direction of new technologies that provide strong capacity-to-performance ratios, but have write operations that are much more expensive than reads in terms of latency, bandwidth, and energy. Motivated by this trend, we propose sequential and parallel algorithms to solve graph connectivity problems using significantly fewer writes than conventional algorithms. Our primary algorithmic tool is the construction of an $o(n)$-sized "implicit decomposition" of a bounded-degree graph $G$ on $n$ nodes, which combined with read-only access to $G$ enables fast answers to connectivity and biconnectivity queries on $G$. The construction breaks the linear-write "barrier", resulting in costs that are asymptotically lower than conventional algorithms while adding only a modest cost to querying time. For general non-sparse graphs on $m$ edges, we also provide the first $o(m)$ writes and $O(m)$ operations parallel algorithms for connectivity and biconnectivity. These algorithms provide insight into how applications can efficiently process computations on large graphs in systems with read-write asymmetry.

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 "massively parallel computation via remote memory access"):
  with members:
    - "massively parallel algorithms for finding well connected components in sparse graphs"
    - "sparsifying distributed algorithms with ramifications in massively parallel computation and centralized local computation"
    - "connected components at scale via local contractions"
    - "massively parallel algorithms and hardness for single linkage clustering under ell_p distances"
    - "communication steps for parallel query processing"
    - "greedy sequential maximal independent set and matching are parallel on average"
    - "sorting searching and simulation in the mapreduce framework"

Connected through hyperedge HE-3 (induced by source paper "theoretically efficient parallel graph algorithms can be fast and scalable"):
  with members:
    - "single source bottleneck path algorithm faster than sorting for sparse graphs"
    - "local algorithms for hierarchical dense subgraph discovery"
    - "parallelism in randomized incremental algorithms"
    - "bigsparse high performance external graph analytics"
    - "nearly work efficient parallel algorithm for digraph reachability"
    - "a new efficient construction on probabilistic tree embeddings"
    - "compressing graphs and indexes with recursive graph bisection"
    - "the gap benchmark suite"

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"
    - "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"
    - "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-5 (induced by source paper "the parallel persistent memory model"):
  with members:
    - "alpaca intermittent execution without checkpoints"
    - "resource oblivious sorting on multicores"
    - "sorting with asymmetric read and write costs"
    - "efficient algorithms with asymmetric read and write costs"
    - "lock free concurrent data structures"

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)