human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "semi asymmetric parallel graph algorithms for nvrams"):
  Abstract: Emerging non-volatile main memory (NVRAM) technologies provide novel features for large-scale graph analytics, combining byte-addressability, low idle power, and improved memory-density. Systems are likely to have an order of magnitude more NVRAM than traditional memory (DRAM), allowing large graph problems to be solved efficiently at a modest cost on a single machine. However, a significant challenge in achieving high performance is in accounting for the fact that NVRAM writes can be significantly more expensive than NVRAM reads. #R##N#In this paper, we propose an approach to parallel graph analytics in which the graph is stored as a read-only data structure (in NVRAM), and the amount of mutable memory is kept proportional to the number of vertices. Similar to the popular semi-external and semi-streaming models for graph analytics, the approach assumes that the vertices of the graph fit in a fast read-write memory (DRAM), but the edges do not. In NVRAM systems, our approach eliminates writes to the NVRAM, among other benefits. #R##N#We present a model, the Parallel Semi-Asymmetric Model (PSAM), to analyze algorithms in the setting, and run experiments on a 48-core NVRAM system to validate the effectiveness of these algorithms. To this end, we study over a dozen graph problems. We develop parallel algorithms for each that are efficient, often work-optimal, in the model. Experimentally, we run all of the algorithms on the largest publicly-available graph and show that our PSAM algorithms outperform the fastest prior algorithms designed for DRAM or NVRAM. We also show that our algorithms running on NVRAM nearly match the fastest prior algorithms running solely in DRAM, by effectively hiding the costs of repeatedly accessing NVRAM versus DRAM.

Includes members:
  Member "pangolin a fault tolerant persistent memory programming library":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "streamlining integrity tree updates for secure persistent non volatile memory")
  Member "tracking in order to recover recoverable lock free data structures":
    also connected through other hyperedges:
      (none)
  Member "write optimized and consistent rdma based nvm systems":
    also connected through other hyperedges:
      (none)
  Member "single machine graph analytics on massive datasets using intel optane dc persistent memory":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "demystifying the performance of hpc scientific applications on nvm based memory systems")
  Member "multiversion concurrency with bounded delay and precise garbage collection":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "concurrent reference counting and resource management in wait free constant time")
  Member "persistent memory i o primitives":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "demystifying the performance of hpc scientific applications on nvm based memory systems")
  Member "persistent buffer management with optimistic consistency":
    also connected through other hyperedges:
      (none)
  Member "basic performance measurements of the intel optane dc persistent memory module":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "demystifying the performance of hpc scientific applications on nvm based memory systems")

Question: Please tell me which class the source paper 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.DC(Distributed, Parallel, and Cluster Computing)