human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "cross layer chase combining with selective retransmission analysis and throughput optimization for ofdm systems"):
  Abstract: In this paper, we present bandwidth efficient retransmission method employong selective retransmission approach at modulation layer under orthogonal frequency division multiplexing (OFDM) signaling. Our proposed cross-layer design embeds a selective retransmission sublayer in physical layer (PHY) that targets retransmission of information symbols transmitted over poor quality OFDM sub-carriers. Most of the times, few errors in decoded bit stream result in packet failure at medium access control (MAC) layer. The unnecessary retransmission of good quality information symbols of a failed packet has detrimental effect on overall throughput of transceiver. We propose a cross-layer Chase combining with selective retransmission (CCSR) method by blending Chase combining at MAC layer and selective retransmission in PHY. The selective retransmission in PHY targets the poor quality information symbols prior to decoding, which results into lower hybrid automatic repeat reQuest (HARQ) retransmissions at MAC layer. We also present tight bit-error rate (BER) upper bound and tight throughput lower bound for CCSR method. In order to maximize throughput of the proposed method, we formulate optimization problem with respect to the amount of information to be retransmitted in selective retransmission. The simulation results demonstrate significant throughput gain of the proposed CCSR method as compared to conventional Chase combining method.

Includes members:
  Member "green communication via power optimized harq protocols":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fast harq over finite blocklength codes a technique for low latency reliable communication")
  Member "coding versus arq in fading channels how reliable should the phy be":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "short packet transmission via variable length codes in the presence of noisy stop feedback")
  Member "hybrid arq in multiple antenna slow fading channels performance limits and optimal linear dispersion code design":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the required number of antennas in a point to point large but finite mimo system outage limited scenario")
  Member "performance of hybrid arq in block fading channels a fixed outage probability analysis":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "short packet transmission via variable length codes in the presence of noisy stop feedback")

Question: Please tell me which class the source paper 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)