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: "failure resilient distributed commit for web services atomic transactions"
  Abstract: Existing Byzantine fault tolerant distributed commit algorithms are resilient to failures up to the threshold imposed by the Byzantine agreement. A distributed transaction might not commit atomically at correct participants if there are more faults. In this paper, we report mechanisms and their implementations in the context of a Web services atomic transaction framework that significantly increase the probability of atomic commitment of distributed transactions even when the majority of coordinator replicas become faulty. The core mechanisms include a piggybacking mechanism, which limits the way a faulty coordinator replica can do to cause confusion among correct participants, and a voting mechanism, which enables fast agreement on the transaction outcome under fault-free situation, and ensures that the agreement is based on the messages from correct replicas with high probability even if all but one coordinator replica becomes faulty. Our performance study on an implemented prototype system shows only 10% end-to-end runtime overhead under both fault-free and faulty scenarios. This proves the practicality of our mechanisms for use in real-world Web-based transactional systems.

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)