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: "enhanced slotted aloha mechanism by introducing zigzag decoding"
  Abstract: Various random access mechanisms, such as Aloha protocol and its corresponding variants have been widely studied as efficient methods to coordinate the medium access among competing users. But when two or more wireless users transmit packets at the same time over the same channel a collisions occur. When this happens, the received packets are discarded and retransmissions are required, which is a waste of power and bandwidth. In such a situation one of the most important objectives is to find techniques to improve these protocols to reduce the number of collisions or to avoid them. Several studies have contributed to this problem. In this paper, we propose a new approach named ZigZag decoding to enhance slotted Aloha mechanism by reducing the loss rate of packets colliding. We model the system by a Markov chain witch the number of backlogged packets is taken as the system state. We use a stochastic game to achieve our objective. We evaluate and compare the performances parameters of the proposed approach with those of slotted Aloha mechanism. All found results show that our approach is more efficient than the slotted Aloha mechanism.

Connected through hyperedge HE-1 (induced by source paper "analysis of performance parameters in wireless networks by using game theory for the non cooperative slotted aloha enhanced by zigzag decoding mechanism"):
  with members:
    - "coded slotted aloha a graph based method for uncoordinated multiple access"

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.IT(Information Theory)