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: "binary polarization kernels from code decompositions"
  Abstract: In this paper, code decompositions (a.k.a. code nestings) are used to design binary polarization kernels. The proposed kernels are in general non-linear. They provide a better polarization exponent than the previously known kernels of the same dimensions. In particular, non-linear kernels of dimensions 14, 15, and 16 are constructed and are shown to have optimal asymptotic error-correction performance. The optimality is proved by showing that the exponents of these kernels achieve a new upper bound that is developed in this paper.

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 "multi kernel polar codes concept and design principles"):
  with members:
    - "design of polar codes in 5g new radio"
    - "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"
    - "from polar to reed muller codes a technique to improve the finite length performance"
    - "list decoding of polar codes"

Connected through hyperedge HE-3 (induced by source paper "a multi kernel multi code polar decoder architecture"):
  with members:
    - "on puncturing strategies for polar codes"
    - "fast and flexible successive cancellation list decoders for polar codes"
    - "low complexity puncturing and shortening of polar codes"
    - "minimum distance based construction of multi kernel polar codes"
    - "multi mode unrolled architectures for polar decoders"
    - "multi kernel construction of polar codes"
    - "tc throughput centric successive cancellation decoder hardware implementation for polar codes"
    - "fast polar decoders algorithm and implementation"

Connected through hyperedge HE-4 (induced by source paper "memory management in successive cancellation based decoders for multi kernel polar codes"):
  with members:
    - "a multi kernel multi code polar decoder architecture"
    - "low complexity puncturing and shortening of polar codes"
    - "minimum distance based construction of multi kernel polar codes"
    - "code design for short blocks a survey"
    - "multi kernel construction of polar codes"
    - "hardware architectures for successive cancellation decoding of polar codes"

Connected through hyperedge HE-5 (induced by source paper "efficient decoding of polar codes with some 16 16 kernels"):
  with members:
    - "a randomized construction of polar subcodes"
    - "binary linear codes with optimal scaling polar codes with large kernels"
    - "binary linear codes with optimal scaling and quasi linear complexity"
    - "scaling exponent of list decoders with applications to polar codes"
    - "list decoding of polar codes"
    - "polar codes characterization of exponent bounds and constructions"

Connected through hyperedge HE-6 (induced by source paper "minimum distance based construction of multi kernel polar codes"):
  with members:
    - "on the successive cancellation decoding of polar codes with arbitrary linear binary kernels"
    - "multi kernel polar codes proof of polarization and error exponents"
    - "multi kernel construction of polar codes"
    - "from polar to reed muller codes a technique to improve the finite length performance"
    - "list decoding of polar codes"
    - "polar codes characterization of exponent bounds and constructions"

Connected through hyperedge HE-7 (induced by source paper "on the successive cancellation decoding of polar codes with arbitrary linear binary kernels"):
  with members:
    - "list decoding of polar codes"
    - "how to construct polar codes"
    - "performance and construction of polar codes on symmetric binary input memoryless channels"
    - "polar codes characterization of exponent bounds and constructions"

Connected through hyperedge HE-8 (induced by source paper "multi kernel polar codes proof of polarization and error exponents"):
  with members:
    - "minimum distance based construction of multi kernel polar codes"
    - "multi kernel construction of polar codes"
    - "polar codes characterization of exponent bounds and constructions"
    - "on the rate of channel polarization"

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)