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: "performance analysis of a cooperative wireless network with adaptive relays a network level study"
  Abstract: In this work, we investigate the stability region, the throughput performance, and the queueing delay of an asymmetric relay-assisted cooperative random access wireless network with multipacket reception (MPR) capabilities. We consider a network of $N$ saturated source users that transmit packets to a common destination node with the cooperation of two relay nodes. The relays are equipped with infinite capacity buffers, and assist the users by forwarding the packets that failed to reach the destination. Moreover, the relays have also packets of their own to transmit to the destination. We assume random access of the medium and slotted time. With the relay-assisted cooperation, the packets originated by each user can be transmitted to the destination through multiple relaying paths formed by the relays. We assume that the relays employ an adaptive retransmission control mechanism. In particular, a relay node is aware of the status of the other relay, and accordingly adapts its transmission probability. Such a protocol is towards self-aware networks and leads to substantial performance gains in terms of delay. We investigate the stability region and the throughput performance for the full MPR model. Moreover, for the two-user, two-relay case we derive the generating function of the stationary joint queue-length distribution at the relays by solving a Riemann-Hilbert boundary value problem. Finally, for the symmetric case we obtain explicit expressions for the average queueing delay in a relay node without the need of solving a boundary value problem. Numerical examples are presented providing insights on the system performance.

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)