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 comparative study of polar code constructions for the awgn channel"
  Abstract: We present a comparative study of the performance of various polar code constructions in an additive white Gaussian noise (AWGN) channel. A polar code construction is any algorithm that selects $K$ best among $N$ possible polar bit-channels at the design signal-to-noise-ratio (design-SNR) in terms of bit error rate (BER). Optimal polar code construction is hard and therefore many suboptimal polar code constructions have been proposed at different computational complexities. Polar codes are also non-universal meaning the code changes significantly with the design-SNR. However, it is not known which construction algorithm at what design-SNR constructs the best polar codes. We first present a comprehensive survey of all the well-known polar code constructions along with their full implementations. We then propose a heuristic algorithm to find the best design-SNR for constructing best possible polar codes from a given construction algorithm. The proposed algorithm involves a search among several possible design-SNRs. We finally use our algorithm to perform a comparison of different construction algorithms using extensive simulations. We find that all polar code construction algorithms generate equally good polar codes in an AWGN channel, if the design-SNR is optimized.

Connected through hyperedge HE-1 (induced by source paper "polar codes and their quantum domain counterparts"):
  with members:
    - "reinforcement learning for nested polar code construction"
    - "decoder tailored polar code design using the genetic algorithm"
    - "genetic algorithm based polar code construction for the awgn channel"
    - "improved bit flipping algorithm for successive cancellation decoding of polar codes"
    - "design of polar codes in 5g new radio"
    - "belief propagation decoding of polar codes on permuted factor graphs"
    - "improved successive cancellation flip decoding of polar codes based on error distribution"
    - "belief propagation list decoding of polar codes"

Connected through hyperedge HE-2 (induced by source paper "scan list decoding of polar codes"):
  with members:
    - "construction and decoding of product codes with non systematic polar codes"
    - "permutation decoding of polar codes"
    - "on the decoding of polar codes on permuted factor graphs"
    - "belief propagation decoding of polar codes on permuted factor graphs"
    - "belief propagation list decoding of polar codes"
    - "list decoding of polar codes"

Connected through hyperedge HE-3 (induced by source paper "decoder tailored polar code design using the genetic algorithm"):
  with members:
    - "genetic algorithm based polar code construction for the awgn channel"
    - "design of polar codes in 5g new radio"
    - "belief propagation list decoding of polar codes"
    - "mitigating clipping effects on error floors under belief propagation decoding of polar codes"
    - "polar code construction for list decoding"
    - "comparison of polar decoders with existing low density parity check and turbo decoders"
    - "minimum distance based construction of multi kernel polar codes"
    - "improving belief propagation decoding of polar codes using scattered exit charts"

Connected through hyperedge HE-4 (induced by source paper "rate flexible fast polar decoders"):
  with members:
    - "efficient bit channel reliability computation for multi mode polar code encoders and decoders"
    - "llr based successive cancellation list decoder for polar codes with multibit decision"
    - "fast and flexible successive cancellation list decoders for polar codes"
    - "beta expansion a theoretical framework for fast and recursive construction of polar codes"
    - "a high throughput list decoder architecture for polar codes"
    - "algebraic properties of polar codes from a new polynomial formalism"
    - "construction of polar codes with sublinear complexity"
    - "symbol decision successive cancellation list decoder for polar codes"

Connected through hyperedge HE-5 (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"
    - "efficient polar code construction for higher order modulation"
    - "construction of polar codes for arbitrary discrete memoryless channels"
    - "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-6 (induced by source paper "genetic algorithm based polar code construction for the awgn channel"):
  with members:
    - "design of polar codes in 5g new radio"
    - "belief propagation list decoding of polar codes"
    - "mitigating clipping effects on error floors under belief propagation decoding of polar codes"
    - "polar code construction for list decoding"
    - "combining belief propagation and successive cancellation list decoding of polar codes on a gpu platform"
    - "a rm polar codes"
    - "from polar to reed muller codes a technique to improve the finite length performance"
    - "list decoding of polar codes"

Connected through hyperedge HE-7 (induced by source paper "capacity approaching polar codes with long codewords and successive cancellation decoding based on improved gaussian approximation"):
  with members:
    - "decoder tailored polar code design using the genetic algorithm"
    - "does gaussian approximation work well for the long length polar code construction"
    - "universal polar codes"
    - "list decoding of polar codes"
    - "on finite length performance of polar codes stopping sets error floor and concatenated design"
    - "how to construct polar codes"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"
    - "the compound capacity of polar codes"

Connected through hyperedge HE-8 (induced by source paper "practical product code construction of polar codes"):
  with members:
    - "construction and decoding of product codes with non systematic polar codes"
    - "generalized fast decoding of polar codes"
    - "fast and flexible successive cancellation list decoders for polar codes"
    - "fast polar decoders algorithm and implementation"
    - "irregular product codes"
    - "list decoding of 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)