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 polar code kernels from code decompositions"
  Abstract: Code decompositions (a.k.a code nestings) are used to design good binary polar code kernels. The proposed kernels are in general non-linear and show a better rate of polarization under successive cancelation decoding, than the ones suggested by Korada et al., for the same kernel dimensions. In particular, kernels of sizes 14, 15 and 16 are constructed and shown to provide polarization rates better than any binary kernel of such sizes.

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 "binary polarization kernels from code decompositions"):
  with members:
    - "recursive descriptions of decoding algorithms and hardware architectures for polar codes"
    - "polar codes with mixed kernels"
    - "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-3 (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-4 (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"
    - "the exponent of a polarizing matrix constructed from the kronecker product"
    - "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)