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: "pragmatic primitives for non blocking data structures"
  Abstract: We define a new set of primitive operations that greatly simplify the implementation of non-blocking data structures in asynchronous shared-memory systems. The new operations operate on a set of Data-records, each of which contains multiple fields. The operations are generalizations of the well-known load-link (LL) and store-conditional (SC) operations called LLX and SCX. The LLX operation takes a snapshot of one Data-record. An SCX operation by a process $p$ succeeds only if no Data-record in a specified set has been changed since $p$ last performed an LLX on it. If successful, the SCX atomically updates one specific field of a Data-record in the set and prevents any future changes to some specified subset of those Data-records. We provide a provably correct implementation of these new primitives from single-word compare-and-swap. As a simple example, we show how to implement a non-blocking multiset data structure in a straightforward way using LLX and SCX.

Connected through hyperedge HE-1 (induced by source paper "adapting persistent data structures for concurrency and speculation"):
  with members:
    - "distributionally linearizable data structures"
    - "pam parallel augmented maps"
    - "techniques for constructing efficient lock free data structures"
    - "a general technique for non blocking trees"
    - "non determinism in byzantine fault tolerant replication"
    - "well structured futures and cache locality"
    - "flat combining and the synchronization parallelism tradeoff"
    - "a critique of ansi sql isolation levels"

Connected through hyperedge HE-2 (induced by source paper "a template for implementing fast lock free trees using htm"):
  with members:
    - "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-3 (induced by source paper "a general technique for non blocking trees"):
  with members:
    - "non blocking patricia tries with replace operations"

Connected through hyperedge HE-4 (induced by source paper "pi a parallel in memory skip list based index"):
  with members:
    - "massively parallel sort merge joins in main memory multi core database systems"

Connected through hyperedge HE-5 (induced by source paper "non blocking patricia tries with replace operations"):
  with members:
    - "a general technique for non blocking trees"
    - "efficient lock free binary search trees"
    - "supporting lock free composition of concurrent data objects"

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)