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 and throughput optimization of selective chase combining for ofdm systems"
  Abstract: In this paper, we present throughput analysis and optimization of bandwidth efficient selective retransmission method at modulation layer for conventional Chase Combining (CC) method under orthogonal frequency division multiplexing (OFDM) signaling. Most of the times, there are fewer errors in a failed packet and receiver can recover from errors receiving partial copy of original frame. The proposed selective retransmission method at modulation layer for OFDM modulation requests retransmission of information corresponding to the poor quality subcarriers. In this work, we propose cross-layer multiple selective Chase combining (MSCC) method and Chase combining with selective retransmission (CCWS) at modulation level. We also present bit-error rate (BER) and throughput analysis of the proposed MSCC and CCWS methods. In order to maximize throughput of the proposed methods under OFDM signaling, we formulate optimization problem with respect to amount of information to be retransmitted in selective retransmission in the event of packet failure. We present tight BER upper bounds and tight throughput lower bounds for the proposed selective Chase combining methods. The simulation results demonstrate significant throughput gain of the optimized selective retransmission methods over conventional retransmission methods. The throughput gain of the proposed selective retransmission atmodulation layer are also holds for conventional for hybrid automatic repeat request (HARQ) methods.

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)