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: "analysis of performance parameters in wireless networks by using game theory for the non cooperative slotted aloha enhanced by zigzag decoding mechanism"
  Abstract: In wireless communication networks, when the workload increases, sources become more aggressive at the equilibrium in the game setting in comparison with the team problem by using slotted Aloha mechanism. Consequently, more packets are in collision and are lost. To reduce these phenomena and to enhance the performance of the networks, we propose to combine ZigZag decoding approach with non cooperative slotted Aloha mechanism. This approach was introduced in our previous work based on the cooperative slotted Aloha mechanism. The obtained results showed that this approach has significantly improved the cooperative slotted Aloha mechanism and gave best results for the throughput and delay. In this paper, we analyze the impact of combining non cooperative slotted Aloha and ZigZag Decoding. We model the system by a two dimensional Markov chain that integrates the effect of ZigZag decoding. The states of the Markov chain describe the number of backlogged packets among the users. We use a stochastic game to achieve our objective; we evaluate and compare the performances parameters of the proposed approach with those of a simple slotted Aloha mechanism. All found results show that our approach improves the performance parameters of the system.

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.GT(Computer Science and Game Theory)