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: "on the rate of channel polarization"
  Abstract: It is shown that for any binary-input discrete memoryless channel $W$ with symmetric capacity $I(W)$ and any rate $R <I(W)$, the probability of block decoding error for polar coding under successive cancellation decoding satisfies $P_e \le 2^{-N^\beta}$ for any $\beta<\frac12$ when the block-length $N$ is large enough.

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 "finite level quantization procedures for construction and decoding of polar codes"):
  with members:
    - "quantized polar code decoders analysis and design"
    - "efficient polar code construction for higher order modulation"
    - "llr based successive cancellation list decoding of polar codes"
    - "on the construction of polar codes"
    - "polar codes robustness of the successive cancellation decoder with respect to quantization"
    - "how to construct polar 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-3 (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-4 (induced by source paper "sublinear latency for simplified successive cancellation decoding of polar codes"):
  with members:
    - "log logarithmic time pruned polar coding"
    - "polar codes with exponentially small error at finite block length"
    - "polar code moderate deviation recovering the scaling exponent"
    - "partitioned list decoding of polar codes analysis and improvement of finite length performance"
    - "scaling exponent and moderate deviations asymptotics of polar codes for the awgn channel"
    - "fast and flexible successive cancellation list decoders for polar codes"
    - "binary linear codes with optimal scaling polar codes with large kernels"
    - "partitioned successive cancellation list decoding of polar codes"

Connected through hyperedge HE-5 (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-6 (induced by source paper "log logarithmic time pruned polar coding"):
  with members:
    - "polar like codes and asymptotic tradeoff among block length code rate and error probability"
    - "polar codes with exponentially small error at finite block length"
    - "general strong polarization"
    - "polar code moderate deviation recovering the scaling exponent"
    - "scaling exponent and moderate deviations asymptotics of polar codes for the awgn channel"
    - "relaxed polar codes"
    - "flexible length polar codes through graph based augmentation"
    - "a packing lemma for polar codes"

Connected through hyperedge HE-7 (induced by source paper "ar i kan meets shannon polar codes with near optimal convergence to channel capacity"):
  with members:
    - "explicit polar codes with small scaling exponent"
    - "general strong polarization"
    - "binary linear codes with optimal scaling and quasi linear complexity"
    - "multi kernel polar codes proof of polarization and error exponents"
    - "near optimal finite length scaling for polar codes over large alphabets"
    - "multi kernel construction of polar codes"
    - "unified scaling of polar codes error exponent scaling exponent moderate deviations and error floors"
    - "finite length scaling for polar codes"

Connected through hyperedge HE-8 (induced by source paper "complexity adjustable sc decoding of polar codes for energy consumption reduction"):
  with members:
    - "relaxed polar codes"
    - "a split reduced successive cancellation list decoder for polar codes"
    - "fast list decoders for polar codes"
    - "llr based successive cancellation list decoding of polar codes"
    - "reduce the complexity of list decoding of polar codes by tree pruning"
    - "fast polar decoders algorithm and implementation"
    - "increasing the speed of polar list decoders"
    - "improved successive cancellation decoding 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)