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: "persistent memory i o primitives"
  Abstract: I/O latency and throughput is one of the major performance bottlenecks for disk-based database systems. Upcoming persistent memory (PMem) technologies, like Intel's Optane DC Persistent Memory Modules, promise to bridge the gap between NAND-based flash (SSD) and DRAM, and thus eliminate the I/O bottleneck. In this paper, we provide one of the first performance evaluations of PMem in terms of bandwidth and latency. Based on the results, we develop guidelines for efficient PMem usage and two essential I/O primitives tuned for PMem: log writing and block flushing.

Connected through hyperedge HE-1 (induced by source paper "demystifying the performance of hpc scientific applications on nvm based memory systems"):
  with members:
    - "single machine graph analytics on massive datasets using intel optane dc persistent memory"
    - "an empirical guide to the behavior and use of scalable persistent memory"
    - "system evaluation of the intel optane byte addressable nvm"
    - "basic performance measurements of the intel optane dc persistent memory module"
    - "unimem runtime data management on non volatile memory based heterogeneous main memory"

Connected through hyperedge HE-2 (induced by source paper "dash scalable hashing on persistent memory"):
  with members:
    - "an empirical guide to the behavior and use of scalable persistent memory"
    - "splitfs reducing software overhead in file systems for persistent memory"
    - "basic performance measurements of the intel optane dc persistent memory module"

Connected through hyperedge HE-3 (induced by source paper "a prompt report on the performance of intel optane dc persistent memory module"):
  with members:
    - "the preliminary evaluation of a hypervisor based virtualization mechanism for intel optane dc persistent memory module"
    - "basic performance measurements of the intel optane dc persistent memory module"

Connected through hyperedge HE-4 (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 buffer management with optimistic consistency"
    - "basic performance measurements of the intel optane dc persistent memory module"
    - "theoretically efficient parallel graph algorithms can be fast and scalable"

Connected through hyperedge HE-5 (induced by source paper "an empirical guide to the behavior and use of scalable persistent memory"):
  with members:
    - "pangolin a fault tolerant persistent memory programming library"
    - "basic performance measurements of the intel optane dc persistent memory module"
    - "espresso brewing java for more non volatility with non volatile memory"

Connected through hyperedge HE-6 (induced by source paper "improved parallel cache oblivious algorithms for dynamic programming and linear algebra"):
  with members:
    - "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"
    - "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.DB(Databases)