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: "global stabilization for causally consistent partial replication"
  Abstract: Causally consistent distributed storage systems have received significant attention recently due to the potential for providing high throughput and causality guarantees. {\em Global stabilization} is a technique established for ensuring causal consistency in distributed storage systems, adopted by the previous work such as GentleRain \cite{Du2014GentleRainCA} and Cure \cite{akkoorath2016cure}. It allows the client to read consistently without explicit dependency checking, thus enables low latency and high throughput. However, most of the previous designs assume {\em full replication}, where each data center stores a full copy of data. In this paper, we extend global stabilization to general {\em partial replication}, where each server can store an arbitrary subset of the data, and the clients are allowed to communicate with any subset of the servers. We propose an algorithm that implements causally consistency partially replicated distributed storage using global stabilization. We prove the correctness of our algorithm and provide an efficient implementation. We also discuss several optimizations that can improve the performance of our algorithm.

Connected through hyperedge HE-1 (induced by source paper "paris causally consistent transactions with non blocking reads and partial replication"):
  with members:
    - "distributed transactional reads the strong the quick the fresh the impossible"
    - "causal consistency and latency optimality friend or foe"
    - "unobtrusive deferred update stabilization for efficient geo replication"

Connected through hyperedge HE-2 (induced by source paper "session guarantees with raft and hybrid logical clocks"):
  with members:
    - "toward adaptive causal consistency for replicated data stores"
    - "okapi causally consistent geo replication made faster cheaper and more available"
    - "gentlerain making gentlerain robust on clock anomalies"

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)