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: "soft decision decoding of reed muller codes recursive lists"
  Abstract: Recursive list decoding is considered for Reed-Muller (RM) codes. The algorithm repeatedly relegates itself to the shorter RM codes by recalculating the posterior probabilities of their symbols. Intermediate decodings are only performed when these recalculations reach the trivial RM codes. In turn, the updated lists of most plausible codewords are used in subsequent decodings. The algorithm is further improved by using permutation techniques on code positions and by eliminating the most error-prone information bits. Simulation results show that for all RM codes of length 256 and many subcodes of length 512, these algorithms approach maximum-likelihood (ML) performance within a margin of 0.1 dB. As a result, we present tight experimental bounds on ML performance for these codes.

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 theory and algorithms"):
  with members:
    - "reed muller codes polarize"
    - "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"
    - "on the bias of reed muller codes over odd prime fields"
    - "almost optimal scaling of reed muller codes on bec and bsc channels"
    - "syndrome decoding of reed muller codes and tensor decomposition over finite fields"

Connected through hyperedge HE-3 (induced by source paper "list decoding of universal polar codes"):
  with members:
    - "polar codes for the deletion channel weak and strong polarization"
    - "universal polarization for processes with memory"
    - "performance bounds of concatenated polar coding schemes"
    - "fast polarization for processes with memory"
    - "polar coding for processes with memory"
    - "joint successive cancellation decoding of polar codes over intersymbol interference channels"
    - "polar codes with dynamic frozen symbols and their decoding by directed search"
    - "universal polar codes"

Connected through hyperedge HE-4 (induced by source paper "partially symmetric monomial codes"):
  with members:
    - "permutation decoding of polar codes"
    - "recursive projection aggregation decoding of reed muller codes"
    - "a new permutation decoding method for reed muller codes"
    - "algebraic properties of polar codes from a new polynomial formalism"
    - "reed muller codes achieve capacity on erasure channels"
    - "list decoding of polar codes"
    - "performance of polar codes for channel and source coding"

Connected through hyperedge HE-5 (induced by source paper "on the decoding of barnes wall lattices"):
  with members:
    - "multilevel constructions coding packing and geometric uniformity"
    - "finite dimensional infinite constellations"
    - "turbo lattices construction and error decoding performance"
    - "practical encoders and decoders for euclidean codes from barnes wall lattices"
    - "list decoding barnes wall lattices"
    - "low density lattice codes"

Connected through hyperedge HE-6 (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"
    - "recursive decoding and its performance for low rate reed muller codes"
    - "fast list decoders for polar codes"

Connected through hyperedge HE-7 (induced by source paper "reinforcement learning for channel coding learned bit flipping decoding"):
  with members:
    - "learning to flip successive cancellation decoding of polar codes with lstm networks"
    - "applications of deep reinforcement learning in communications and networking a survey"
    - "decoding reed muller codes using minimum weight parity checks"
    - "deep learning for decoding of linear codes a syndrome based approach"
    - "an introduction to deep learning for the physical layer"
    - "on deep learning based channel decoding"
    - "learning to decode linear codes using deep learning"
    - "residual belief propagation informed scheduling for asynchronous message passing"

Connected through hyperedge HE-8 (induced by source paper "successive cancellation list decoding of product codes with reed muller component codes"):
  with members:
    - "construction and decoding of product codes with non systematic polar codes"
    - "low complexity joint channel estimation and list decoding of short codes"
    - "efficient error correcting codes in the short blocklength regime"
    - "recursive decoding and its performance for low rate reed muller codes"
    - "successive cancellation decoding of single parity check product codes"
    - "list 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)