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: "outage minimization via power adaptation and allocation for truncated hybrid arq"
  Abstract: In this work, we analyze hybrid ARQ (HARQ) protocols over the independent block fading channel. We assume that the transmitter is unaware of the channel state information (CSI) but has a knowledge about the channel statistics. We consider two scenarios with respect to the feedback received by the transmitter: i) ''conventional'', one-bit feedback about the decoding success/failure (ACK/NACK), and ii) the multi-bit feedback scheme when, on top of ACK/NACK, the receiver provides additional information about the state of the decoder to the transmitter. In both cases, the feedback is used to allocate (in the case of one-bit feedback) or adapt (in the case of multi-bit feedback) the power across the HARQ transmission attempts. The objective in both cases is the minimization of the outage probability under long-term average and peak power constraints. We cast the problems into the dynamic programming (DP) framework and solve them for Nakagami-m fading channels. A simplified solution for the high signal-to-noise ratio (SNR) regime is presented using a geometric programming (GP) approach. The obtained results quantify the advantage of the multi-bit feedback over the conventional approach, and show that the power optimization can provide significant gains over conventional power-constant HARQ transmissions even in the presence of peak-power constraints.

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)