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: "fast list decoders for polar codes"
  Abstract: Polar codes asymptotically achieve the symmetric capacity of memoryless channels, yet their error-correcting performance under successive-cancellation (SC) decoding for short and moderate length codes is worse than that of other modern codes such as low-density parity-check (LDPC) codes. Of the many methods to improve the error-correction performance of polar codes, list decoding yields the best results, especially when the polar code is concatenated with a cyclic redundancy check (CRC). List decoding involves exploring several decoding paths with SC decoding, and therefore tends to be slower than SC decoding itself, by an order of magnitude in practical implementations. In this paper, we present a new algorithm based on unrolling the decoding tree of the code that improves the speed of list decoding by an order of magnitude when implemented in software. Furthermore, we show that for software-defined radio applications, our proposed algorithm is faster than the fastest software implementations of LDPC decoders in the literature while offering comparable error-correction performance at similar or shorter code lengths.

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 "polar decreasing monomial cartesian codes"):
  with members:
    - "monomial cartesian codes and their duals with applications to lcd codes quantum codes and locally recoverable codes"
    - "design of polar codes in 5g new radio"
    - "multi kernel polar codes proof of polarization and error exponents"
    - "algebraic properties of polar codes from a new polynomial formalism"
    - "multi kernel construction of polar codes"
    - "on the second hamming weight of some reed muller type codes"
    - "list decoding of polar codes"
    - "how to construct polar codes"

Connected through hyperedge HE-3 (induced by source paper "soft maximum likelihood decoding using grand"):
  with members:
    - "capacity achieving guessing random additive noise decoding"
    - "design of polar codes in 5g new radio"
    - "llr based successive cancellation list decoding of polar codes"
    - "list decoding of polar codes"

Connected through hyperedge HE-4 (induced by source paper "decoder tailored polar code design using the genetic algorithm"):
  with members:
    - "genetic algorithm based polar code construction for the awgn channel"
    - "design of polar codes in 5g new radio"
    - "belief propagation list decoding of polar codes"
    - "mitigating clipping effects on error floors under belief propagation decoding of polar codes"
    - "polar code construction for list decoding"
    - "comparison of polar decoders with existing low density parity check and turbo decoders"
    - "minimum distance based construction of multi kernel polar codes"
    - "improving belief propagation decoding of polar codes using scattered exit charts"

Connected through hyperedge HE-5 (induced by source paper "recursive projection aggregation decoding of reed muller codes"):
  with members:
    - "reed muller codes theory and algorithms"
    - "reed muller codes polarize"
    - "on the performance of reed muller codes with respect to random errors and erasures"
    - "decoding reed muller codes using minimum weight parity checks"
    - "decoding reed muller and polar codes by successive factor graph permutations"
    - "almost optimal scaling of reed muller codes on bec and bsc channels"
    - "soft decision decoding of reed muller codes recursive lists"
    - "recursive decoding and its performance for low rate reed muller codes"

Connected through hyperedge HE-6 (induced by source paper "optimizing polar codes compatible with off the shelf ldpc decoders"):
  with members:
    - "design of polar codes in 5g new radio"
    - "belief propagation list decoding of polar codes"
    - "sparse graphs for belief propagation decoding of polar codes"
    - "code design for short blocks a survey"
    - "flexible length polar codes through graph based augmentation"
    - "a rm polar codes"
    - "from polar to reed muller codes a technique to improve the finite length performance"
    - "polar codes with dynamic frozen symbols and their decoding by directed search"

Connected through hyperedge HE-7 (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"
    - "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"
    - "list decoding of polar codes"

Connected through hyperedge HE-8 (induced by source paper "asymmetric construction of low latency and length flexible polar codes"):
  with members:
    - "a multi kernel multi code polar decoder architecture"
    - "low complexity puncturing and shortening of polar codes"
    - "multi kernel polar codes proof of polarization and error exponents"
    - "multi kernel construction of polar codes"
    - "fast polar decoders algorithm and implementation"
    - "list decoding of polar codes"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"

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)