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: "polar coded harq scheme with chase combining"
  Abstract: A hybrid automatic repeat request scheme with Chase combing (HARQ-CC) of polar codes is proposed. The existing analysis tools of the underlying rate-compatible punctured polar (RCPP) codes for additive white Gaussian noise (AWGN) channels are extended to Rayleigh fading channels. Then, an approximation bound of the throughput efficiency for the polar coded HARQ-CC scheme is derived. Utilizing this bound, the parameter configurations of the proposed scheme can be optimized. Simulation results show that, the proposed HARQ-CC scheme under a low-complexity SC decoding is only about $1.0$dB away from the existing schemes with incremental redundancy (\mbox{HARQ-IR}). Compared with the polar coded \mbox{HARQ-IR} scheme, the proposed HARQ-CC scheme requires less retransmissions and has the advantage of good compatibility to other communication techniques.

Connected through hyperedge HE-1 (induced by source paper "throughput based design for polar coded modulation"):
  with members:
    - "flexible ir harq scheme for polar coded modulation"
    - "a comparative study of polar code constructions for the awgn channel"
    - "list decoding of polar codes"
    - "how to construct polar codes"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"

Connected through hyperedge HE-2 (induced by source paper "optimizing transmission lengths for limited feedback with non binary ldpc examples"):
  with members:
    - "isn t hybrid arq sufficient"
    - "protograph based raptor like ldpc codes"
    - "reliability output decoding of tail biting convolutional codes"
    - "a hybrid arq scheme based on polar codes"
    - "feedback communication systems with limitations on incremental redundancy"
    - "a rate compatible sphere packing analysis of feedback coding with limited retransmissions"

Connected through hyperedge HE-3 (induced by source paper "variable length convolutional coding for short blocklengths with decision feedback"):
  with members:
    - "convolutional code specific crc code design"
    - "extrinsic jensen shannon divergence applications to variable length coding"
    - "green communication via type i arq finite block length analysis"
    - "finite block length analysis of the incremental redundancy harq"
    - "reliability output decoding of tail biting convolutional codes"
    - "quasi static simo fading channels at finite blocklength"
    - "a hybrid arq scheme based on polar codes"
    - "feedback communication systems with limitations on incremental redundancy"

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)