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: "bit permuted coded modulation for polar codes"
  Abstract: We consider the problem of using polar codes with higher order modulation over AWGN channels. Unlike prior work, we focus on using modulation independent polar codes. That is, the polar codes are not re-designed based on the modulation used. Instead, we propose bit-permuted coded modulation (BPCM): a technique for using the multilevel coding (MLC) approach for an arbitrary polar code. The BPCM technique exploits a natural connection between MLC and polar codes. It involves applying bit permutations prior to mapping the polar code to a higher order modulation. The bit permutations are designed, via density evolution, to match the rates provided by various bit levels of the higher order modulation to that of the polar code. #R##N#We demonstrate performance of the BPCM technique using link simulations and density evolution for the AWGN channel. We compare the BPCM technique with the bit-interleaved coded modulation (BICM) technique. When using polar codes designed for BPSK modulation, we show gains for BPCM over BICM with random interleaver of up to 0.2 dB, 0.7 dB and 1.4 dB for 4-ASK, 8-ASK, and 16-ASK respectively.

Connected through hyperedge HE-1 (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"
    - "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"

Connected through hyperedge HE-2 (induced by source paper "efficient polar code construction for higher order modulation"):
  with members:
    - "a comparative study of polar code constructions for the awgn channel"
    - "protograph based ldpc code design for shaped bit metric decoding"
    - "list decoding of polar codes"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"

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)