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: "efficient polar code construction for higher order modulation"
  Abstract: An efficient algorithm for the construction of polar codes for higher-order modulation is presented based on information-theoretic principles. The bit reliabilities after successive demapping are estimated using the LM-rate, an achievable rate for mismatched decoding. The successive demapper bit channels are then replaced by binary input Additive White Gaussian Noise (biAWGN) surrogate channels and polar codes are constructed using the Gaussian approximation (GA). This LM-rate Demapper GA (LM-DGA) construction is used to construct polar codes for several demapping strategies proposed in literature. For all considered demappers, the LM-DGA constructed polar codes have the same performance as polar codes constructed by Monte Carlo (MC) simulation. The proposed LM-DGA construction is much faster than the MC construction. For 64-QAM, spectral efficiency 3 bits/s/Hz, and block length 1536 bits, simulation results show that LM-DGA constructed polar codes with cyclic redundancy check and successive cancellation list decoding are 1 dB more power efficient than state-of-the-art AR4JA low-density parity-check codes.

Connected through hyperedge HE-1 (induced by source paper "finite level quantization procedures for construction and decoding of polar codes"):
  with members:
    - "quantized polar code decoders analysis and design"
    - "llr based successive cancellation list decoding of polar codes"
    - "on the construction of polar codes"
    - "polar codes robustness of the successive cancellation decoder with respect to quantization"
    - "how to construct polar codes"
    - "hardware architectures for successive cancellation decoding of polar codes"
    - "performance and construction of polar codes on symmetric binary input memoryless channels"
    - "on the rate of channel polarization"

Connected through hyperedge HE-2 (induced by source paper "sign bit shaping using polar codes"):
  with members:
    - "probabilistically shaped multi level coding with polar codes for fading channels"
    - "code constructions for physical unclonable functions and biometric secrecy systems"
    - "polar codes for broadcast channels"
    - "llr based successive cancellation list decoding of polar codes"
    - "how to achieve the capacity of asymmetric channels"
    - "achievable rates for shaped bit metric decoding"
    - "list decoding of polar codes"
    - "a pragmatic coded modulation scheme for high spectral efficiency fiber optic communications"

Connected through hyperedge HE-3 (induced by source paper "two stage polarization based nonbinary polar codes for 5g urllc"):
  with members:
    - "parity check polar coding for 5g and beyond"
    - "a new construction of nonbinary polar codes with two stage polarization"
    - "construction of polar codes for arbitrary discrete memoryless channels"
    - "a comparative study of polar code constructions for the awgn channel"
    - "on metric sorting for successive cancellation list decoding of polar codes"
    - "list decoding of polar codes"
    - "source and channel polarization over finite fields and reed solomon matrices"
    - "polar codes for q ary channels q 2 r"

Connected through hyperedge HE-4 (induced by source paper "design of polar codes for parallel channels with an average power constraint"):
  with members:
    - "compound polar codes"
    - "list decoding of polar codes"
    - "performance and construction of polar codes on symmetric binary input memoryless channels"

Connected through hyperedge HE-5 (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-6 (induced by source paper "efficient error correcting codes in the short blocklength regime"):
  with members:
    - "low complexity joint channel estimation and list decoding of short codes"
    - "low latency short packet transmissions fixed length or harq"
    - "design of polar codes in 5g new radio"
    - "joint design of convolutional code and crc under serial list viterbi decoding"
    - "on the error probability of short concatenated polar and cyclic codes with interleaving"
    - "short packets over block memoryless fading channels pilot assisted or noncoherent transmission"
    - "polar code construction for list decoding"
    - "ultra sparse non binary ldpc codes for probabilistic amplitude shaping"

Connected through hyperedge HE-7 (induced by source paper "a new construction of nonbinary polar codes with two stage polarization"):
  with members:
    - "parity check polar coding for 5g and beyond"
    - "construction of polar codes for arbitrary discrete memoryless channels"
    - "a comparative study of polar code constructions for the awgn channel"
    - "on metric sorting for successive cancellation list decoding of polar codes"
    - "polar codes for q ary channels q 2 r"
    - "non binary polar codes using reed solomon codes and algebraic geometry codes"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"
    - "polar codes characterization of exponent bounds and constructions"

Connected through hyperedge HE-8 (induced by source paper "flexible ir harq scheme for polar coded modulation"):
  with members:
    - "an incremental redundancy harq scheme for polar code"
    - "bit permuted coded modulation for 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"

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)