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: "polar codes with mixed kernels"
  Abstract: A generalization of the polar coding scheme called mixed-kernels is introduced. This generalization exploits several homogeneous kernels over alphabets of different sizes. An asymptotic analysis of the proposed scheme shows that its polarization properties are strongly related to the ones of the constituent kernels. Simulation of finite length instances of the scheme indicate their advantages both in error correction performance and complexity compared to the known polar coding structures.

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 like codes and asymptotic tradeoff among block length code rate and error probability"):
  with members:
    - "performance bounds of concatenated polar coding schemes"
    - "scaling exponent and moderate deviations asymptotics of polar codes for the awgn channel"
    - "relaxed polar codes"
    - "minimum distance based construction of multi kernel polar codes"
    - "multi kernel polar codes proof of polarization and error exponents"
    - "a note on some inequalities used in channel polarization and polar coding"
    - "near optimal finite length scaling for polar codes over large alphabets"
    - "multi kernel construction of polar codes"

Connected through hyperedge HE-3 (induced by source paper "dynamic scflip decoding of polar codes"):
  with members:
    - "an improved scflip decoder for polar codes"
    - "llr based successive cancellation list decoding of polar codes"
    - "low latency list decoding of polar codes with double thresholding"
    - "a low complexity improved successive cancellation decoder for polar codes"
    - "scaling exponent of list decoders with applications to polar codes"
    - "list decoding of polar codes"
    - "performance and construction of polar codes on symmetric binary input memoryless channels"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"

Connected through hyperedge HE-4 (induced by source paper "on the construction of polar codes for channels with moderate input alphabet sizes"):
  with members:
    - "construction of polar codes for arbitrary discrete memoryless channels"
    - "an entropy sumset inequality and polynomially fast convergence to shannon capacity over all alphabets"
    - "upgraded approximation of non binary alphabets for polar code construction"
    - "channel upgradation for non binary input alphabets and macs"
    - "on the construction of polar codes"
    - "source and channel polarization over finite fields and reed solomon matrices"
    - "how to construct polar codes"
    - "quantization of binary input discrete memoryless channels"

Connected through hyperedge HE-5 (induced by source paper "binary polarization kernels from code decompositions"):
  with members:
    - "recursive descriptions of decoding algorithms and hardware architectures for polar codes"
    - "binary polar code kernels from code decompositions"
    - "channel polarization on q ary discrete memoryless channels by arbitrary kernels"
    - "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"
    - "on the rate of channel polarization"

Connected through hyperedge HE-6 (induced by source paper "recursive descriptions of polar codes"):
  with members:
    - "soft decision decoding of reed muller codes recursive lists"
    - "on metric sorting for successive cancellation list decoding of polar codes"
    - "llr based successive cancellation list decoding of polar codes"
    - "fast polar decoders algorithm and implementation"
    - "increasing the speed of polar list decoders"
    - "a reduced latency list decoding algorithm for polar codes"
    - "binary polarization kernels from code decompositions"
    - "a scalable successive cancellation decoder for polar codes"

Connected through hyperedge HE-7 (induced by source paper "performance of polar codes on wireless communications channel"):
  with members:
    - "non binary polar codes using reed solomon codes and algebraic geometry codes"
    - "polar codes are optimal for lossy source coding"
    - "polar codes characterization of exponent bounds and constructions"
    - "polarization for arbitrary discrete memoryless channels"

Connected through hyperedge HE-8 (induced by source paper "binary polar code kernels from code decompositions"):
  with members:
    - "channel polarization on q ary discrete memoryless channels by arbitrary kernels"
    - "non binary polar codes using reed solomon codes and algebraic geometry codes"
    - "performance and construction of polar codes on symmetric binary input memoryless channels"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"
    - "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)