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: "specification and implementation of replicated list the jupiter protocol revisited"
  Abstract: The replicated list object has been frequently used to model the core functionality (e.g., insertion, deletion, and read) of replicated collaborative text editing systems. In this paper we revisit the specification and implementation of a replicated list object, specifically the weak list specification proposed recently by Attiya et al. and the Jupiter protocol designed in the 1990s. We prove that Jupiter indeed satisfies the weak list specification, solving the conjecture of Attiya et al. To address the mismatch between the global property of weak list specification and the local views each replica maintains in the Jupiter protocol, we propose the CSS (Compact State-space) Jupiter protocol, which at a high level, maintains only a single novel $n$-ary ordered state-space for a client/server system with $n$ clients. By contrast, the original Jupiter protocol, we call the CSCW protocol, needs to maintain $2n$ 2D state-spaces where replica states are dispersed. We first show that the CSS protocol and the CSCW protocol are equivalent in the sense that their behaviors are the same under the same schedule of operations/messages. Then, we prove that the CSS protocol satisfies the weak list specification. We further extend the CSS protocol to a distributed setting, by orthogonally integrating the compact $n$-ary ordered state-space with a distributed scheme to totally order operations.

Connected through hyperedge HE-1 (induced by source paper "remove win a design framework for conflict free replicated data collections"):
  with members:
    - "conflict free replicated data types an overview"

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)