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: "efficient relay selection scheme for delay limited non orthogonal hybrid arq relay channels"
  Abstract: We consider a half-duplex wireless relay network with hybrid-automatic retransmission request (HARQ) and Rayleigh fading channels. In this paper, we analyze the outage probability of the multi-relay delay-limited HARQ system with opportunistic relaying scheme in decode-and-forward mode, in which the \emph{best} relay is selected to transmit the source's regenerated signal. A simple and distributed relay selection strategy is proposed for multi-relay HARQ channels. Then, we utilize the non-orthogonal cooperative transmission between the source and selected relay for retransmitting of the source data toward the destination if needed, using space-time codes or beamforming techniques. We analyze the performance of the system. We first derive the cumulative density function (CDF) and probability density function (PDF) of the selected relay HARQ channels. Then, the CDF and PDF are used to determine the outage probability in the $l$-th round of HARQ. The outage probability is required to compute the throughput-delay performance of this half-duplex opportunistic relaying protocol. The packet delay constraint is represented by $L$, the maximum number of HARQ rounds. An outage is declared if the packet is unsuccessful after $L$ HARQ rounds. Furthermore, closed-form upper-bounds on outage probability are derived and subsequently are used to investigate the diversity order of the system. Based on the derived upper-bound expressions, it is shown that the proposed schemes achieve the full spatial diversity order of $N+1$, where $N$ is the number of potential relays. Our analytical results are confirmed by simulation results.

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)