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: "live equals fast in iterated models"
  Abstract: The Iterated Immediate Snapshot model (IIS), due to its elegant topological representation, has become standard for applying topological reasoning to distributed computing. In this paper, we focus on relations between IIS and the more realistic (non-iterated) read-write Atomic- Snapshot memory model (AS). We grasp equivalences between subsets of runs of AS and IIS (we call them sub-IIS and sub-AS models). To establish an equivalence between a sub-AS model M and a sub-IIS model M', we need two algorithms, a forward simulation F : AS -> IIS and a backward simulation B: IIS -> AS, such that B(F(M)) is a subset of M and F(B(M')) is a subset of M'. AS and IIS are provided with such simulations and, thus, they have the same task computability power. However, the relations between proper sub-AS and sub-IIS models remained unclear until now. #R##N#In this paper, we present a two-way simulation protocol that provides an equivalent sub-IIS model for any adversarial sub-AS model, i.e., for any sub-AS model specified by the sets of live processes. We achieve the result by ensuring that, under the two-way simulation, the set of live processes in an AS run coincides with the set of fast processes in the simulated IIS run, and vice versa.

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)