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: "refined rate of channel polarization"
  Abstract: A rate-dependent upper bound of the best achievable block error probability of polar codes with successive-cancellation decoding is derived.

Connected through hyperedge HE-1 (induced by source paper "improved bounds on the finite length scaling of polar codes"):
  with members:
    - "polar codes for broadcast channels"
    - "finite length scaling for polar codes"
    - "achieving marton s region for broadcast channels using polar codes"
    - "polar codes speed of polarization and polynomial gap to capacity"
    - "rate dependent analysis of the asymptotic behavior of channel polarization"
    - "universal bounds on the scaling behavior of polar codes"
    - "list decoding of polar codes"
    - "strong coordination with polar codes"

Connected through hyperedge HE-2 (induced by source paper "rate dependent analysis of the asymptotic behavior of channel polarization"):
  with members:
    - "finite length scaling for polar codes"
    - "on the construction of polar codes"
    - "how to construct polar codes"
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "channel polarization on q ary discrete memoryless channels by arbitrary kernels"
    - "properties and construction of polar codes"
    - "polar codes for the m user mac"
    - "capacity achieving polar codes for arbitrarily permuted parallel channels"

Connected through hyperedge HE-3 (induced by source paper "polar codes speed of polarization and polynomial gap to capacity"):
  with members:
    - "finite length scaling for polar codes"
    - "improved bounds on the finite length scaling of polar codes"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"
    - "universal bounds on the scaling behavior of polar codes"
    - "on the construction of polar codes"
    - "source and channel polarization over finite fields and reed solomon matrices"
    - "polar codes robustness of the successive cancellation decoder with respect to quantization"
    - "capacity achieving multiwrite wom codes"

Connected through hyperedge HE-4 (induced by source paper "source and channel polarization over finite fields and reed solomon matrices"):
  with members:
    - "rate dependent analysis of the asymptotic behavior of channel polarization"
    - "polar codes for the two user multiple access channel"
    - "polar codes for q ary channels q 2 r"
    - "multilevel polarization of polar codes over arbitrary discrete memoryless channels"
    - "channel polarization on q ary discrete memoryless channels by arbitrary kernels"
    - "non binary polar codes using reed solomon codes and algebraic geometry codes"
    - "properties and construction of polar codes"
    - "polar codes for the m user mac"

Connected through hyperedge HE-5 (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"
    - "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"
    - "hardware architectures for successive cancellation decoding of polar codes"
    - "performance and construction of polar codes on symmetric binary input memoryless channels"

Connected through hyperedge HE-6 (induced by source paper "properties and construction of polar codes"):
  with members:
    - "channel polarization on q ary discrete memoryless channels by arbitrary kernels"
    - "polar codes are optimal for lossy source coding"
    - "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"
    - "the compound capacity of polar codes"
    - "polar codes characterization of exponent bounds and constructions"
    - "polarization for arbitrary discrete memoryless channels"
    - "on the rate of channel polarization"

Connected through hyperedge HE-7 (induced by source paper "channel polarization on q ary discrete memoryless channels by arbitrary kernels"):
  with members:
    - "polar codes are optimal for lossy source coding"
    - "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"
    - "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)