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: "delay free concurrency on faulty persistent memory"
  Abstract: Non-volatile memory (NVM) promises persistent main memory that remains correct despite loss of power. This has sparked a line of research into algorithms that can recover from a system crash. Since caches are expected to remain volatile, concurrent data structures and algorithms must be redesigned to guarantee that they are left in a consistent state after a system crash, and that the execution can be continued upon recovery. However, the prospect of redesigning every concurrent data structure or algorithm before it can be used in NVM architectures is daunting. #R##N#In this paper, we present a construction that takes any concurrent program with reads, writes and CASs to shared memory and makes it persistent, i.e., can be continued after one or more processes fault and have to restart. Importantly the converted algorithm has constant computational delay (preserves instruction counts on each process within a constant factor), as well as constant recovery delay (a process can recover from a fault in a constant number of instructions). We show this first for a simple transformation, and then present optimizations to make it more practical, allowing for a tradeoff for better constant factors in computational delay, for sometimes increased recovery delay. We also provide an optimized transformation that works for any normalized lock-free data structure, thus allowing more efficient constructions for a large class of concurrent algorithms. We experimentally evaluate our transformations by applying them to a queue.

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 "multiversion concurrency with bounded delay and precise garbage collection"):
  with members:
    - "pam parallel augmented maps"
    - "reclaiming memory for lock free data structures there has to be a better way"
    - "a general technique for non blocking trees"
    - "minuet a scalable distributed multiversion b tree"
    - "flat combining and the synchronization parallelism tradeoff"

Connected through hyperedge HE-3 (induced by source paper "efficient lock free durable sets"):
  with members:
    - "alpaca intermittent execution without checkpoints"
    - "fine grain checkpointing with in cache line logging"
    - "reclaiming memory for lock free data structures there has to be a better way"
    - "efficient logging in non volatile memory by exploiting coherency protocols"

Connected through hyperedge HE-4 (induced by source paper "efficient single writer concurrency"):
  with members:
    - "multiversion concurrency with bounded delay and precise garbage collection"
    - "pam parallel augmented maps"
    - "reclaiming memory for lock free data structures there has to be a better way"
    - "a general technique for non blocking trees"

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.DC(Distributed, Parallel, and Cluster Computing)