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: "design of polar codes in 5g new radio"
  Abstract: Polar codes have attracted the attention of academia and industry alike in the past decade, such that the 5$^\text{th}$ generation wireless systems (5G) standardization process of the 3$^\text{rd}$ generation partnership project (3GPP) chose polar codes as a channel coding scheme. In this tutorial, we provide a description of the encoding process of polar codes foreseen by the 5G standard. We illustrate the struggles of designing a family of polar codes able to satisfy the demands of 5G systems, with particular attention to rate flexibility and low decoding latency. The result of these efforts is an elaborate framework that applies novel coding techniques to provide a solid channel code for NR requirements.

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"
    - "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"
    - "dynamic scflip decoding of polar codes"

Connected through hyperedge HE-2 (induced by source paper "polar decreasing monomial cartesian codes"):
  with members:
    - "monomial cartesian codes and their duals with applications to lcd codes quantum codes and locally recoverable codes"
    - "multi kernel polar codes proof of polarization and error exponents"
    - "algebraic properties of polar codes from a new polynomial formalism"
    - "fast list decoders for polar codes"
    - "multi kernel construction of polar codes"
    - "on the second hamming weight of some reed muller type codes"
    - "list decoding of polar codes"
    - "how to construct polar codes"

Connected through hyperedge HE-3 (induced by source paper "multi kernel polar codes concept and design principles"):
  with members:
    - "low complexity puncturing and shortening of polar codes"
    - "on the successive cancellation decoding of polar codes with arbitrary linear binary kernels"
    - "minimum distance based construction of multi kernel polar codes"
    - "multi kernel polar codes proof of polarization and error exponents"
    - "multi kernel construction of polar codes"
    - "binary polarization kernels from code decompositions"
    - "from polar to reed muller codes a technique to improve the finite length performance"
    - "list decoding of polar codes"

Connected through hyperedge HE-4 (induced by source paper "soft maximum likelihood decoding using grand"):
  with members:
    - "capacity achieving guessing random additive noise decoding"
    - "fast list decoders for polar codes"
    - "llr based successive cancellation list decoding of polar codes"
    - "list decoding of polar codes"

Connected through hyperedge HE-5 (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"
    - "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"
    - "algebraic properties of polar codes from a new polynomial formalism"

Connected through hyperedge HE-6 (induced by source paper "deep learning based polar code design"):
  with members:
    - "decoder in the loop genetic optimization based ldpc code design"
    - "decoder tailored polar code design using the genetic algorithm"
    - "belief propagation decoding of polar codes on permuted factor graphs"
    - "end to end learning of communications systems without a channel model"
    - "belief propagation list decoding of polar codes"
    - "an introduction to deep learning for the physical layer"
    - "scaling deep learning based decoding of polar codes via partitioning"
    - "sparse graphs for belief propagation decoding of polar codes"

Connected through hyperedge HE-7 (induced by source paper "optimizing polar codes compatible with off the shelf ldpc decoders"):
  with members:
    - "belief propagation list decoding of polar codes"
    - "sparse graphs for belief propagation decoding of polar codes"
    - "code design for short blocks a survey"
    - "fast list decoders for polar codes"
    - "flexible length polar codes through graph based augmentation"
    - "a rm polar codes"
    - "from polar to reed muller codes a technique to improve the finite length performance"
    - "polar codes with dynamic frozen symbols and their decoding by directed search"

Connected through hyperedge HE-8 (induced by source paper "genetic algorithm based polar code construction for the awgn channel"):
  with members:
    - "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 comparative study of polar code constructions for the awgn channel"
    - "a rm polar codes"
    - "from polar to reed muller codes a technique to improve the finite length performance"
    - "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)