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: "multi kernel polar codes proof of polarization and error exponents"
  Abstract: In this paper, we investigate a novel family of polar codes based on multi-kernel constructions, proving that this construction actually polarizes. To this end, we derive a new and more general proof of polarization, which gives sufficient conditions for kernels to polarize. Finally, we derive the convergence rate of the multi-kernel construction and relate it to the convergence rate of each of the constituent kernels.

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 "polar decreasing monomial cartesian codes"):
  with members:
    - "monomial cartesian codes and their duals with applications to lcd codes quantum codes and locally recoverable codes"
    - "design of polar codes in 5g new radio"
    - "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:
    - "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 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 "on the polarizing behavior and scaling exponent of polar codes with product kernels"):
  with members:
    - "explicit polar codes with small scaling exponent"
    - "minimum distance based construction of multi kernel polar codes"
    - "binary linear codes with optimal scaling and quasi linear complexity"
    - "unified scaling of polar codes error exponent scaling exponent moderate deviations and error floors"
    - "finite length scaling for polar codes"
    - "list decoding of polar codes"
    - "polar codes characterization of exponent bounds and constructions"

Connected through hyperedge HE-5 (induced by source paper "ar i kan meets shannon polar codes with near optimal convergence to channel capacity"):
  with members:
    - "explicit polar codes with small scaling exponent"
    - "general strong polarization"
    - "binary linear codes with optimal scaling and quasi linear complexity"
    - "near optimal finite length scaling for polar codes over large alphabets"
    - "multi kernel construction of polar codes"
    - "unified scaling of polar codes error exponent scaling exponent moderate deviations and error floors"
    - "finite length scaling for polar codes"
    - "polar codes speed of polarization and polynomial gap to capacity"

Connected through hyperedge HE-6 (induced by source paper "asymmetric construction of low latency and length flexible polar codes"):
  with members:
    - "a multi kernel multi code polar decoder architecture"
    - "low complexity puncturing and shortening of polar codes"
    - "fast list decoders for polar codes"
    - "multi kernel construction of polar codes"
    - "fast polar decoders algorithm and implementation"
    - "list decoding of polar codes"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"

Connected through hyperedge HE-7 (induced by source paper "on the scaling exponent of polar codes with product kernels"):
  with members:
    - "explicit polar codes with small scaling exponent"
    - "minimum distance based construction of multi kernel polar codes"
    - "binary linear codes with optimal scaling and quasi linear complexity"
    - "finite length scaling for polar codes"
    - "list decoding of polar codes"
    - "polar codes characterization of exponent bounds and constructions"

Connected through hyperedge HE-8 (induced by source paper "fast decoding of multi kernel polar codes"):
  with members:
    - "multi kernel construction of polar codes"
    - "fast polar decoders algorithm and implementation"
    - "list decoding of polar codes"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"

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)