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: "construction of polar codes for arbitrary discrete memoryless channels"
  Abstract: It is known that polar codes can be efficiently constructed for binary-input channels. At the same time, existing algorithms for general input alphabets are less practical because of high complexity. We address the construction problem for the general case, and analyze an algorithm that is based on successive reduction of the output alphabet size of the subchannels in each recursion step. For this procedure we estimate the approximation error as $O(\mu^{-1/(q-1)}),$ where $\mu$ is the "quantization parameter," i.e., the maximum size of the subchannel output alphabet allowed by the algorithm. The complexity of the code construction scales as $O(N\mu^4),$ where $N$ is the length of the code. #R##N#We also show that if the polarizing operation relies on modulo-$q$ addition, it is possible to merge subsets of output symbols without any loss in subchannel capacity. Performing this procedure before each approximation step results in a further speed-up of the code construction, and the resulting codes have smaller gap to capacity. We show that a similar acceleration can be attained for polar codes over finite field alphabets. #R##N#Experimentation shows that the suggested construction algorithms can be used to construct long polar codes for alphabets of size $q=16$ and more with acceptable loss of the code rate for a variety of polarizing transforms.

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 "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"
    - "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"
    - "polar codes for q ary channels q 2 r"

Connected through hyperedge HE-3 (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"
    - "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"
    - "channel upgradation for non binary input alphabets and macs"

Connected through hyperedge HE-4 (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"
    - "a comparative study of polar code constructions for the awgn channel"
    - "on metric sorting for successive cancellation list decoding of polar codes"
    - "polar codes for q ary channels q 2 r"
    - "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-5 (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"
    - "entropies of weighted sums in cyclic groups and an application to polar codes"
    - "polar codes for the two user multiple access channel"
    - "polar codes for q ary channels q 2 r"
    - "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-6 (induced by source paper "on the polarization levels of automorphic symmetric channels"):
  with members:
    - "polar codes for arbitrary dmcs and arbitrary macs"
    - "polarization for arbitrary discrete memoryless channels"

Connected through hyperedge HE-7 (induced by source paper "greedy merge degrading has optimal power law"):
  with members:
    - "information distilling quantizers"
    - "on the construction of polar codes for channels with moderate input alphabet sizes"
    - "channel upgradation for non binary input alphabets and macs"
    - "on the construction of polar codes"
    - "at low snr asymmetric quantizers are better"
    - "how to construct polar codes"
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "quantization of binary input discrete memoryless channels"

Connected through hyperedge HE-8 (induced by source paper "equidistant polarizing transforms"):
  with members:
    - "on the construction of polar codes for channels with moderate input alphabet sizes"
    - "entropies of weighted sums and applications to polar codes"
    - "polar codes for q ary channels q 2 r"
    - "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"
    - "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)