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 "single machine graph analytics on massive datasets using intel optane dc persistent memory"):
  Abstract: Intel Optane DC Persistent Memory is a new kind of byte-addressable memory with higher density and lower cost than DRAM. This enables affordable systems that support up to 6TB of memory. In this paper, we use such a system for massive graphs analytics. We discuss how such a system should be deployed for such applications, and evaluate three existing shared-memory graph frameworks, Galois, GAP, and GraphIt, on large real-world web-crawls. We recommend algorithms and runtime optimizations for getting the best performance on such systems using the results of our study. We also show that for these applications, the Galois framework on Optane DC PMM is on average 2x faster than D-Galois, the state-of-the-art distributed graph framework, on a production cluster with similar compute power. Thus, Optane DC PMM yields benefits in productivity, performance, and cost for massive graph analytics.

Includes members:
  Member "system evaluation of the intel optane byte addressable nvm":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "demystifying the performance of hpc scientific applications on nvm based memory systems")
  Member "basic performance measurements of the intel optane dc persistent memory module":
    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 "theoretically efficient parallel graph algorithms can be fast and scalable":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "relaxed scheduling for scalable belief propagation")
  Member "bigsparse high performance external graph analytics":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "theoretically efficient parallel graph algorithms can be fast and scalable")
  Member "early evaluation of intel optane non volatile memory with hpc i o workloads":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "easycrash exploring non volatility of non volatile memory for high performance computing under failures")
  Member "the gap benchmark suite":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a parallel sparse tensor benchmark suite on cpus and gpus")
  Member "layered label propagation a multiresolution coordinate free ordering for compressing social networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "2ps high quality edge partitioning with two phase streaming")

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)