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: "parity check polar coding for 5g and beyond"
  Abstract: In this paper, we propose a comprehensive Polar coding solution that integrates reliability calculation, rate matching and parity-check coding. Judging a channel coding design from the industry's viewpoint, there are two primary concerns: (i) low-complexity implementation in application-specific integrated circuit (ASIC), and (ii) superior \& stable performance under a wide range of code lengths and rates. The former provides cost- \& power-efficiency which are vital to any commercial system; the latter ensures flexible and robust services. Our design respects both criteria. It demonstrates better performance than existing schemes in literature, but requires only a fraction of implementation cost. With easily-reproducible code construction for arbitrary code rates and lengths, we are able to report "1-bit" fine-granularity simulation results for thousands of cases. The released results can serve as a baseline for future optimization of Polar codes.

Connected through hyperedge HE-1 (induced by source paper "polarization adjusted convolutional pac codes fano decoding vs list decoding"):
  with members:
    - "on pre transformed polar codes"
    - "from sequential decoding to channel polarization and back again"
    - "a randomized construction of polar subcodes"
    - "llr based successive cancellation list decoding of polar codes"
    - "on the origin of polar coding"
    - "a rm polar codes"
    - "a low complexity improved successive cancellation decoder for polar codes"
    - "list decoding of polar codes"

Connected through hyperedge HE-2 (induced by source paper "a soft cancellation decoder for parity check polar codes"):
  with members:
    - "on pre transformed polar codes"
    - "from sequential decoding to channel polarization and back again"
    - "list decoding of polar codes"

Connected through hyperedge HE-3 (induced by source paper "two stage polarization based nonbinary polar codes for 5g urllc"):
  with members:
    - "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"
    - "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 "ai coding learning to construct error correction codes"):
  with members:
    - "decoder tailored polar code design using the genetic algorithm"
    - "deepcode feedback codes via deep learning"
    - "an introduction to deep learning for the physical layer"
    - "beta expansion a theoretical framework for fast and recursive construction of polar codes"
    - "algebraic properties of polar codes from a new polynomial formalism"
    - "construction of polar codes with sublinear complexity"
    - "a rm polar codes"
    - "list decoding of polar codes"

Connected through hyperedge HE-5 (induced by source paper "an asymmetric adaptive scl decoder hardware for ultra low error rate polar codes"):
  with members:
    - "a 5 16gbps decoder asic for polar code in 16nm finfet"
    - "fast and flexible successive cancellation list decoders for polar codes"
    - "a high throughput list decoder architecture for polar codes"
    - "llr based successive cancellation list decoding of polar codes"
    - "a decision aided parallel sc list decoder for polar codes"
    - "an efficient list decoder architecture for polar codes"
    - "an adaptive successive cancellation list decoder for polar codes with cyclic redundancy check"

Connected through hyperedge HE-6 (induced by source paper "on pre transformed polar codes"):
  with members:
    - "from sequential decoding to channel polarization and back again"
    - "a rm polar codes"

Connected through hyperedge HE-7 (induced by source paper "design of polar codes in 5g new radio"):
  with members:
    - "on list decoding of 5g nr polar codes"
    - "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"
    - "polar code construction for list decoding"

Connected through hyperedge HE-8 (induced by source paper "a new construction of nonbinary polar codes with two stage polarization"):
  with members:
    - "efficient polar code construction for higher order modulation"
    - "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"

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)