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: "a hybrid arq scheme based on polar codes"
  Abstract: A hybrid automatic repeat request (HARQ) scheme based on a novel class of rate-compatible polar (RCP) codes is proposed. The RCP codes are constructed by performing punctures and repetitions on the conventional polar codes. Simulation results over binary-input additive white Gaussian noise channels show that, under a low-complexity successive cancellation decoder, the proposed HARQ scheme can perform as well as the existing schemes based on turbo codes and low-density parity-check codes. The proposed transmission scheme is only about 1.0 to 1.5dB away from the channel capacity with the information block length of 1024 bits.

Connected through hyperedge HE-1 (induced by source paper "design of polar codes in 5g new radio"):
  with members:
    - "on list decoding of 5g nr polar codes"
    - "parity check polar coding for 5g and beyond"
    - "design and implementation of a polar codes blind detection scheme"
    - "circular buffer rate matched polar codes"
    - "improved successive cancellation flip decoding of polar codes based on error distribution"
    - "partitioned list decoding of polar codes analysis and improvement of finite length performance"
    - "on the error probability of short concatenated polar and cyclic codes with interleaving"
    - "on puncturing strategies for polar codes"

Connected through hyperedge HE-2 (induced by source paper "circular buffer rate matched polar codes"):
  with members:
    - "recursive constructions and their maximum likelihood decoding"
    - "relaxed polar codes"
    - "binary polar codes are optimised codes for bitwise multistage decoding"
    - "multi kernel construction of polar codes"
    - "flexible and low complexity encoding and decoding of systematic polar codes"
    - "rate compatible polar codes for wireless channels"
    - "capacity achieving rateless polar codes"
    - "performance limits and practical decoding of interleaved reed solomon polar concatenated codes"

Connected through hyperedge HE-3 (induced by source paper "study of polarization driven shortening for polar codes designed with the gaussian approximation"):
  with members:
    - "low complexity puncturing and shortening of polar codes"
    - "iterative detection and decoding algorithms for mimo systems in block fading channels using ldpc codes"
    - "rate compatible punctured polar codes optimal construction based on polar spectra"
    - "capacity achieving rate compatible polar codes"
    - "on finite length performance of polar codes stopping sets error floor and concatenated design"
    - "a practical approach to polar codes"

Connected through hyperedge HE-4 (induced by source paper "on the analysis of puncturing for finite length polar codes boolean function approach"):
  with members:
    - "list decoding of polar codes"
    - "a practical approach to polar codes"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"

Connected through hyperedge HE-5 (induced by source paper "an efficient construction of rate compatible punctured polar rcpp codes using hierarchical puncturing"):
  with members:
    - "flexible and low complexity encoding and decoding of systematic polar codes"
    - "capacity achieving rateless polar codes"
    - "capacity achieving rate compatible polar codes"
    - "protograph based raptor like ldpc codes"
    - "list decoding of polar codes"
    - "a practical approach to polar codes"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"

Connected through hyperedge HE-6 (induced by source paper "an incremental redundancy harq scheme for polar code"):
  with members:
    - "rate compatible polar codes for wireless channels"
    - "capacity achieving rateless polar codes"
    - "capacity achieving rate compatible polar codes"
    - "list decoding of polar codes"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"
    - "on the rate of channel polarization"

Connected through hyperedge HE-7 (induced by source paper "on puncturing strategies for polar codes"):
  with members:
    - "capacity achieving rate compatible polar codes"
    - "a practical approach to polar codes"
    - "performance and construction of polar codes on symmetric binary input memoryless channels"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"

Connected through hyperedge HE-8 (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"
    - "feedback communication systems with limitations on incremental redundancy"
    - "polar coded harq scheme with chase combining"
    - "a rate compatible sphere packing analysis of feedback coding with limited retransmissions"

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)