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: "efficient lock free binary search trees"
  Abstract: In this paper we present a novel algorithm for concurrent lock-free internal binary search trees (BST) and implement a Set abstract data type (ADT) based on that. We show that in the presented lock-free BST algorithm the amortized step complexity of each set operation - {\sc Add}, {\sc Remove} and {\sc Contains} - is $O(H(n) + c)$, where, $H(n)$ is the height of BST with $n$ number of nodes and $c$ is the contention during the execution. Our algorithm adapts to contention measures according to read-write load. If the situation is read-heavy, the operations avoid helping pending concurrent {\sc Remove} operations during traversal, and, adapt to interval contention. However, for write-heavy situations we let an operation help pending {\sc Remove}, even though it is not obstructed, and so adapt to tighter point contention. It uses single-word compare-and-swap (\texttt{CAS}) operations. We show that our algorithm has improved disjoint-access-parallelism compared to similar existing algorithms. We prove that the presented algorithm is linearizable. To the best of our knowledge this is the first algorithm for any concurrent tree data structure in which the modify operations are performed with an additive term of contention measure.

Connected through hyperedge HE-1 (induced by source paper "dynamic graph operations a consistent non blocking approach"):
  with members:
    - "an efficient framework for optimistic concurrent execution of smart contracts"
    - "a general technique for non blocking trees"
    - "crawling facebook for social network analysis purposes"

Connected through hyperedge HE-2 (induced by source paper "a concurrency optimal binary search tree"):
  with members:
    - "on the cost of concurrency in transactional memory"

Connected through hyperedge HE-3 (induced by source paper "quadboost a scalable concurrent quadtree"):
  with members:
    - "non blocking patricia tries with replace operations"

Connected through hyperedge HE-4 (induced by source paper "verifying linearizability a comparative survey"):
  with members:
    - "between linearizability and quiescent consistency quantitative quiescent consistency"
    - "simplifying proofs of linearisability using layers of abstraction"
    - "linearizability with ownership transfer"
    - "proving linearisability via coarse grained abstraction"
    - "lock free dynamic hash tables with open addressing"

Connected through hyperedge HE-5 (induced by source paper "non blocking patricia tries with replace operations"):
  with members:
    - "pragmatic primitives for non blocking data structures"
    - "a general technique for non blocking 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)