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: "the exponent of a polarizing matrix constructed from the kronecker product"
  Abstract: The asymptotic performance of a polar code under successive cancellation decoding is determined by the exponent of its polarizing matrix. We first prove that the partial distances of a polarizing matrix constructed from the Kronecker product are simply expressed as a product of those of its component matrices. We then show that the exponent of the polarizing matrix is shown to be a weighted sum of the exponents of its component matrices. These results may be employed in the design of a large polarizing matrix with high exponent.

Connected through hyperedge HE-1 (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"
    - "binary polarization kernels from code decompositions"
    - "from polar to reed muller codes a technique to improve the finite length performance"

Connected through hyperedge HE-2 (induced by source paper "vard o hus codes polar codes based on castle curves kernels"):
  with members:
    - "algebraic properties of polar codes from a new polynomial formalism"
    - "channel polarization on q ary discrete memoryless channels by arbitrary kernels"
    - "non binary polar codes using reed solomon codes and algebraic geometry codes"
    - "on the order bounds for one point ag codes"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"
    - "polar codes characterization of exponent bounds and constructions"
    - "polarization for arbitrary discrete memoryless channels"

Connected through hyperedge HE-3 (induced by source paper "polar codes with mixed kernels"):
  with members:
    - "list decoding of polar codes"
    - "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"
    - "refined rate of channel polarization"
    - "hardware architectures for successive cancellation decoding of polar codes"
    - "performance and construction of polar codes on 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)