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: "algebraic properties of polar codes from a new polynomial formalism"
  Abstract: Polar codes form a very powerful family of codes with a low complexity decoding algorithm that attain many information theoretic limits in error correction and source coding. These codes are closely related to Reed-Muller codes because both can be described with the same algebraic formalism, namely they are generated by evaluations of monomials. However, finding the right set of generating monomials for a polar code which optimises the decoding performances is a hard task and channel dependent. The purpose of this paper is to reveal some universal properties of these monomials. We will namely prove that there is a way to define a nontrivial (partial) order on monomials so that the monomials generating a polar code devised fo a binary-input symmetric channel always form a decreasing set. #R##N#This property turns out to have rather deep consequences on the structure of the polar code. Indeed, the permutation group of a decreasing monomial code contains a large group called lower triangular affine group. Furthermore, the codewords of minimum weight correspond exactly to the orbits of the minimum weight codewords that are obtained from (evaluations) of monomials of the generating set. In particular, it gives an efficient way of counting the number of minimum weight codewords of a decreasing monomial code and henceforth of a polar code.

Connected through hyperedge HE-1 (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"
    - "fast list decoders for polar codes"
    - "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-2 (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"
    - "soft decision decoding of reed muller codes recursive lists"
    - "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-3 (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-4 (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"
    - "high girth matrices and polarization"
    - "reed muller codes achieve capacity on erasure channels"

Connected through hyperedge HE-5 (induced by source paper "rate flexible fast polar decoders"):
  with members:
    - "efficient bit channel reliability computation for multi mode polar code encoders and decoders"
    - "llr based successive cancellation list decoder for polar codes with multibit decision"
    - "fast and flexible successive cancellation list decoders for polar codes"
    - "beta expansion a theoretical framework for fast and recursive construction of polar codes"
    - "a high throughput list decoder architecture for polar codes"
    - "construction of polar codes with sublinear complexity"
    - "symbol decision successive cancellation list decoder for polar codes"
    - "a comparative study of polar code constructions for the awgn channel"

Connected through hyperedge HE-6 (induced by source paper "ai coding learning to construct error correction codes"):
  with members:
    - "decoder tailored polar code design using the genetic algorithm"
    - "deepcode feedback codes via deep learning"
    - "parity check polar coding for 5g and beyond"
    - "an introduction to deep learning for the physical layer"
    - "beta expansion a theoretical framework for fast and recursive construction of polar codes"
    - "construction of polar codes with sublinear complexity"
    - "a rm polar codes"
    - "list decoding of polar codes"

Connected through hyperedge HE-7 (induced by source paper "rate matching for polar codes based on binary domination"):
  with members:
    - "circular buffer rate matched polar codes"
    - "on puncturing strategies for polar codes"
    - "low complexity puncturing and shortening of polar codes"
    - "flexible and low complexity encoding and decoding of systematic polar codes"
    - "capacity achieving rate compatible polar codes"
    - "polar codes with dynamic frozen symbols and their decoding by directed search"
    - "on the construction and decoding of concatenated polar codes"
    - "list decoding of polar codes"

Connected through hyperedge HE-8 (induced by source paper "permutation decoding of polar codes"):
  with members:
    - "a new permutation decoding method for reed muller codes"
    - "on the decoding of polar codes on permuted factor graphs"
    - "decoding reed muller and polar codes by successive factor graph permutations"
    - "dynamic scflip decoding of polar codes"
    - "llr based successive cancellation list decoding of polar codes"
    - "a low complexity improved successive cancellation decoder for polar codes"
    - "list decoding of polar codes"
    - "hardware architectures for 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)