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: "linearizable implementations do not suffice for randomized distributed computation"
  Abstract: Linearizability is the gold standard among algorithm designers for deducing the correctness of a distributed algorithm using implemented shared objects from the correctness of the corresponding algorithm using atomic versions of the same objects. We show that linearizability does not suffice for this purpose when processes can exploit randomization, and we discuss the existence of alternative correctness conditions.

Connected through hyperedge HE-1 (induced by source paper "putting strong linearizability in context preserving hyperproperties in programs that use concurrent objects"):
  with members:
    - "strongly linearizable implementations of snapshots and other types"
    - "proving linearizability using forward simulations"
    - "a temporal logic for hyperproperties"
    - "randomized protocols for asynchronous consensus"

Connected through hyperedge HE-2 (induced by source paper "fast concurrent data sketches"):
  with members:
    - "distributionally linearizable data structures"
    - "sketching linear classifiers over data streams"
    - "multiqueues simpler faster and better relaxed concurrent priority queues"
    - "all distances sketches revisited hip estimators for massive graphs analysis"

Connected through hyperedge HE-3 (induced by source paper "strongly linearizable implementations of snapshots and other types"):
  with members:
    - "putting strong linearizability in context preserving hyperproperties in programs that use concurrent objects"
    - "on the time and space complexity of aba prevention and detection"

Connected through hyperedge HE-4 (induced by source paper "a separation logic for concurrent randomized programs"):
  with members:
    - "relational reasoning for markov chains in a probabilistic guarded lambda calculus"
    - "quantitative separation logic"
    - "proving uniformity and independence by self composition and coupling"
    - "coupling proofs are probabilistic product programs"
    - "a higher order logic for concurrent termination preserving refinement"
    - "a program logic for union bounds"
    - "weakest precondition reasoning for expected run times of probabilistic programs"
    - "relational reasoning via probabilistic coupling"

Connected through hyperedge HE-5 (induced by source paper "simple executions of snapshot implementations"):
  with members:
    - "linearizability is expspace complete"
    - "linearizability with ownership transfer"

Connected through hyperedge HE-6 (induced by source paper "the levelarray a fast practical long lived renaming algorithm"):
  with members:
    - "flat combining and the synchronization parallelism tradeoff"

Connected through hyperedge HE-7 (induced by source paper "rmr efficient randomized abortable mutual exclusion"):
  with members:
    - "randomized protocols for asynchronous consensus"

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)