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 compound capacity of polar codes"
  Abstract: We consider the compound capacity of polar codes under successive cancellation decoding for a collection of binary-input memoryless output-symmetric channels. By deriving a sequence of upper and lower bounds, we show that in general the compound capacity under successive decoding is strictly smaller than the unrestricted compound capacity.

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 "reed muller codes polarize"):
  with members:
    - "recursive projection aggregation decoding of reed muller codes"
    - "general strong polarization"
    - "on the performance of reed muller codes with respect to random errors and erasures"
    - "decoding reed muller codes using minimum weight parity checks"
    - "almost optimal scaling of reed muller codes on bec and bsc channels"
    - "recursive decoding and its performance for low rate reed muller codes"
    - "algebraic properties of polar codes from a new polynomial formalism"
    - "high girth matrices and polarization"

Connected through hyperedge HE-3 (induced by source paper "capacity approaching polar codes with long codewords and successive cancellation decoding based on improved gaussian approximation"):
  with members:
    - "decoder tailored polar code design using the genetic algorithm"
    - "a comparative study of polar code constructions for the awgn channel"
    - "does gaussian approximation work well for the long length polar code construction"
    - "universal polar codes"
    - "list decoding of polar codes"
    - "on finite length performance of polar codes stopping sets error floor and concatenated design"
    - "how to construct polar codes"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"

Connected through hyperedge HE-4 (induced by source paper "channel coding at low capacity"):
  with members:
    - "polar codes with a stepped boundary"
    - "recursive list decoding for reed muller codes"
    - "beta beta bounds finite blocklength analog of the golden formula"
    - "relaxed polar codes"
    - "achieving the uniform rate region of general multiple access channels by polar coding"
    - "coding in the finite blocklength regime bounds based on laplace integrals and their asymptotic approximations"
    - "polar codes for broadcast channels"
    - "asymptotic estimates in information theory with non vanishing error probabilities"

Connected through hyperedge HE-5 (induced by source paper "universal polarization for processes with memory"):
  with members:
    - "a simple proof of fast polarization"
    - "fast polarization for processes with memory"
    - "polar coding for processes with memory"
    - "construction of polar codes for arbitrary discrete memoryless channels"
    - "on the construction of polar codes for channels with moderate input alphabet sizes"
    - "universal polar codes for more capable and less noisy channels and sources"
    - "joint successive cancellation decoding of polar codes over intersymbol interference channels"
    - "universal source polarization and an application to a multi user problem"

Connected through hyperedge HE-6 (induced by source paper "the fractality of polar and reed muller codes"):
  with members:
    - "relaxed polar codes"
    - "algebraic properties of polar codes from a new polynomial formalism"
    - "alignment of polarized sets"
    - "high girth matrices and polarization"
    - "ergodic theory meets polarization ii a foundation of polarization theory"
    - "finite length scaling for polar codes"
    - "a novel partial order for the information sets of polar codes over b dmcs"
    - "polarization of the r enyi information dimension for single and multi terminal analog compression"

Connected through hyperedge HE-7 (induced by source paper "binary linear codes with optimal scaling polar codes with large kernels"):
  with members:
    - "achieving the uniform rate region of general multiple access channels by polar coding"
    - "near optimal finite length scaling for polar codes over large alphabets"
    - "construction of polar codes with sublinear complexity"
    - "finite length scaling for polar codes"
    - "performance limits and practical decoding of interleaved reed solomon polar concatenated codes"
    - "polar codes speed of polarization and polynomial gap to capacity"
    - "scaling exponent of list decoders with applications to polar codes"
    - "rate dependent analysis of the asymptotic behavior of channel polarization"

Connected through hyperedge HE-8 (induced by source paper "alignment of polarized sets"):
  with members:
    - "polar codes for broadcast channels"
    - "universal polar codes for more capable and less noisy channels and sources"
    - "achieving secrecy capacity of the wiretap channel and broadcast channel with a confidential component"
    - "polar coding for the general wiretap channel"
    - "polar codes speed of polarization and polynomial gap to capacity"
    - "efficient one way secret key agreement and private channel coding via polarization"
    - "universal polar codes"
    - "on the construction of polar codes"

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)