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 for q ary channels q 2 r"
  Abstract: We study polarization for nonbinary channels with input alphabet of size q=2^r,r=2,3,... Using Arikan's polarizing kernel H_2, we prove that the virtual channels that arise in the process of polarization converge to q-ary channels with capacity 1,2,...,r bits, and that the total transmission rate approaches the symmetric capacity of the channel. This leads to an explicit transmission scheme for q-ary channels. The error probability of decoding using successive cancellation behaves as exp(-N^\alpha), where N is the code length and {\alpha} is any constant less than 0.5.

Connected through hyperedge HE-1 (induced by source paper "polar codes simplicity random codes durability"):
  with members:
    - "reed muller codes polarize"
    - "ar i kan meets shannon polar codes with near optimal convergence to channel capacity"
    - "explicit polar codes with small scaling exponent"
    - "on the capacity of channels with deletions and states"
    - "polar codes for the deletion channel weak and strong polarization"
    - "polar like codes and asymptotic tradeoff among block length code rate and error probability"
    - "scaling exponent and moderate deviations asymptotics of polar codes for the awgn channel"
    - "relaxed polar codes"

Connected through hyperedge HE-2 (induced by source paper "countably infinite multilevel source polarization for non stationary erasure distributions"):
  with members:
    - "asymptotic distribution of multilevel channel polarization for a certain class of erasure channels"
    - "on the polarization levels of automorphic symmetric channels"
    - "general strong polarization"
    - "fano type inequalities based on general conditional information measures over countably infinite alphabets with list decoding"
    - "modular arithmetic erasure channels and their multilevel channel polarization"
    - "fourier analysis of mac polarization"
    - "a generalized erasure channel in the sense of polarization for binary erasure channels"
    - "polar coding for non stationary channels"

Connected through hyperedge HE-3 (induced by source paper "two stage polarization based nonbinary polar codes for 5g urllc"):
  with members:
    - "parity check polar coding for 5g and beyond"
    - "a new construction of nonbinary polar codes with two stage polarization"
    - "efficient polar code construction for higher order modulation"
    - "construction of polar codes for arbitrary discrete memoryless channels"
    - "a comparative study of polar code constructions for the awgn channel"
    - "on metric sorting for successive cancellation list decoding of polar codes"
    - "list decoding of polar codes"
    - "source and channel polarization over finite fields and reed solomon matrices"

Connected through hyperedge HE-4 (induced by source paper "channel polarization through the lens of blackwell measures"):
  with members:
    - "general strong polarization"
    - "polar codes for broadcast channels"
    - "varentropy decreases under the polar transform"
    - "finite length scaling for polar codes"
    - "re proving channel polarization theorems an extremality and robustness analysis"
    - "polar codes speed of polarization and polynomial gap to capacity"
    - "polar codes for the two user multiple access channel"
    - "on the construction of polar codes"

Connected through hyperedge HE-5 (induced by source paper "a new construction of nonbinary polar codes with two stage polarization"):
  with members:
    - "parity check polar coding for 5g and beyond"
    - "efficient polar code construction for higher order modulation"
    - "construction of polar codes for arbitrary discrete memoryless channels"
    - "a comparative study of polar code constructions for the awgn channel"
    - "on metric sorting for successive cancellation list decoding of polar codes"
    - "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"

Connected through hyperedge HE-6 (induced by source paper "modular arithmetic erasure channels and their multilevel channel polarization"):
  with members:
    - "fourier analysis of mac polarization"
    - "a generalized erasure channel in the sense of polarization for binary erasure channels"
    - "construction of polar codes for arbitrary discrete memoryless channels"
    - "entropies of weighted sums in cyclic groups and an application to polar codes"
    - "polar codes for the two user multiple access channel"
    - "how to construct polar codes"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"
    - "polarization for arbitrary discrete memoryless channels"

Connected through hyperedge HE-7 (induced by source paper "asymptotic distribution of multilevel channel polarization for a certain class of erasure channels"):
  with members:
    - "modular arithmetic erasure channels and their multilevel channel polarization"
    - "a generalized erasure channel in the sense of polarization for binary erasure channels"
    - "source and channel polarization over finite fields and reed solomon matrices"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"
    - "polarization for arbitrary discrete memoryless channels"

Connected through hyperedge HE-8 (induced by source paper "fourier analysis of mac polarization"):
  with members:
    - "ergodic theory meets polarization ii a foundation of polarization theory"
    - "polar codes for arbitrary dmcs and arbitrary macs"
    - "polar codes for the two user multiple access channel"
    - "multilevel polarization of polar codes over arbitrary discrete memoryless channels"
    - "polar codes for the m user mac"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"
    - "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)