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: "capacity achieving rate compatible polar codes"
  Abstract: We present a method of constructing rate-compatible polar codes that are capacity-achieving with low-complexity sequential decoders. The proposed code construction allows for incremental retransmissions at different rates in order to adapt to channel conditions. The main idea of the construction exploits the common characteristics of polar codes optimized for a sequence of successively degraded channels. The proposed approach allows for an optimized polar code to be used at every transmission thereby achieving capacity.

Connected through hyperedge HE-1 (induced by source paper "rate matching for polar codes based on binary domination"):
  with members:
    - "circular buffer rate matched polar codes"
    - "on puncturing strategies for polar codes"
    - "low complexity puncturing and shortening of polar codes"
    - "algebraic properties of polar codes from a new polynomial formalism"
    - "flexible and low complexity encoding and decoding of systematic polar codes"
    - "polar codes with dynamic frozen symbols and their decoding by directed search"
    - "on the construction and decoding of concatenated polar codes"
    - "list decoding of polar codes"

Connected through hyperedge HE-2 (induced by source paper "a new coding paradigm for the primitive relay channel"):
  with members:
    - "asymmetric error correction and flash memory rewriting using polar codes"
    - "capacity of a class of state dependent orthogonal relay channels"
    - "polar coding for the broadcast channel with confidential messages a random binning analogy"
    - "how to achieve the capacity of asymmetric channels"
    - "soft decoding based strategies for relay and interference channels analysis and achievable rates using ldpc codes"
    - "universal polar codes"
    - "wireless network information flow a deterministic approach"
    - "nested polar codes for wiretap and relay channels"

Connected through hyperedge HE-3 (induced by source paper "flexible ir harq scheme for polar coded modulation"):
  with members:
    - "an incremental redundancy harq scheme for polar code"
    - "efficient polar code construction for higher order modulation"
    - "bit permuted coded modulation for polar codes"
    - "capacity achieving rateless polar codes"
    - "protograph based raptor like ldpc codes"
    - "list decoding of polar codes"
    - "a practical approach to polar codes"

Connected through hyperedge HE-4 (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"
    - "a hybrid arq scheme based on 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-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"
    - "protograph based raptor like ldpc codes"
    - "a hybrid arq scheme based on polar 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"
    - "a hybrid arq scheme based on 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:
    - "a hybrid arq scheme based on 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 "syndrome coupled rate compatible error correcting codes"):
  with members:
    - "capacity achieving rateless polar codes"

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)