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: "multiversion concurrency with bounded delay and precise garbage collection"
  Abstract: In this paper we are interested in bounding the number of instructions taken to process transactions. The main result is a multiversion transactional system that supports constant delay (extra instructions beyond running in isolation) for all read-only transactions, delay equal to the number of processes for writing transactions that are not concurrent with other writers, and lock-freedom for concurrent writers. The system supports precise garbage collection in that versions are identified for collection as soon as the last transaction releases them. As far as we know these are first results that bound delays for multiple readers and even a single writer. The approach is particularly useful in situations where read-transactions dominate write transactions, or where write transactions come in as streams or batches and can be processed by a single writer (possibly in parallel).  The approach is based on using functional data structures to support multiple versions, and an efficient solution to the Version Maintenance (VM) problem for acquiring, updating and releasing versions. Our solution to the VM problem is precise, safe and wait-free (PSWF).  We experimentally validate our approach by applying it to balanced tree data structures for maintaining ordered maps. We test the transactional system using multiple algorithms for the VM problem, including our PSWF VM algorithm, and implementations with weaker guarantees based on epochs, hazard pointers, and read-copy-update. To evaluate the functional data structure for concurrency and multi-versioning, we implement batched updates for functional tree structures and compare the performance with state-of-the-art concurrent data structures for balanced trees. The experiments indicate our approach works well in practice over a broad set of criteria.

Connected through hyperedge HE-1 (induced by source paper "concurrent reference counting and resource management in wait free constant time"):
  with members:
    - "reclaiming memory for lock free data structures there has to be a better way"

Connected through hyperedge HE-2 (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"
    - "persistent memory i o primitives"
    - "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-3 (induced by source paper "low latency graph streaming using compressed purely functional trees"):
  with members:
    - "theoretically efficient parallel graph algorithms can be fast and scalable"
    - "pam parallel augmented maps"
    - "parallel local graph clustering"
    - "an introduction to temporal graphs an algorithmic perspective"
    - "storing and analyzing historical graph data at scale"
    - "the gap benchmark suite"
    - "efficient snapshot retrieval over historical graph data"

Connected through hyperedge HE-4 (induced by source paper "efficient single writer concurrency"):
  with members:
    - "delay free concurrency on faulty persistent memory"
    - "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"

Connected through hyperedge HE-5 (induced by source paper "delay free concurrency on faulty persistent memory"):
  with members:
    - "the parallel persistent memory model"
    - "efficient logging in non volatile memory by exploiting coherency protocols"
    - "flat combining and the synchronization parallelism tradeoff"

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)