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: "recursive decoding and its performance for low rate reed muller codes"
  Abstract: Recursive decoding techniques are considered for Reed-Muller (RM) codes of growing length $n$ and fixed order $r.$ An algorithm is designed that has complexity of order $n\log n$ and corrects most error patterns of weight up to $n(1/2-\varepsilon)$ given that $\varepsilon$ exceeds $n^{-1/2^{r}}.$ This improves the asymptotic bounds known for decoding RM codes with nonexponential complexity.

Connected through hyperedge HE-1 (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"
    - "soft decision decoding of reed muller codes recursive lists"

Connected through hyperedge HE-2 (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"
    - "algebraic properties of polar codes from a new polynomial formalism"
    - "high girth matrices and polarization"
    - "reed muller codes achieve capacity on erasure channels"

Connected through hyperedge HE-3 (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"
    - "fast list decoders for polar codes"

Connected through hyperedge HE-4 (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"
    - "soft decision decoding of reed muller codes recursive lists"
    - "successive cancellation decoding of single parity check product codes"
    - "list decoding of polar codes"

Connected through hyperedge HE-5 (induced by source paper "decoding reed muller and polar codes by successive factor graph permutations"):
  with members:
    - "on the decoding of polar codes on permuted factor graphs"
    - "belief propagation decoding of polar codes on permuted factor graphs"
    - "soft decision decoding of reed muller codes recursive lists"
    - "llr based successive cancellation list decoding of polar codes"
    - "list decoding of polar codes"

Connected through hyperedge HE-6 (induced by source paper "a new signature scheme based on punctured reed muller code with random insertion"):
  with members:
    - "using ldgm codes and sparse syndromes to achieve digital signatures"

Connected through hyperedge HE-7 (induced by source paper "decoding high rate reed muller codes from random errors in near linear time"):
  with members:
    - "reed muller codes achieve capacity on erasure channels"
    - "reed muller codes achieve capacity on the binary erasure channel under map decoding"
    - "reed muller codes for random erasures and errors"
    - "list decoding reed muller codes over small fields"
    - "from polar to reed muller codes a technique to improve the finite length performance"
    - "channel coding the road to channel capacity"

Connected through hyperedge HE-8 (induced by source paper "efficiently decoding reed muller codes from random errors"):
  with members:
    - "reed muller codes achieve capacity on erasure channels"
    - "reed muller codes achieve capacity on the binary erasure channel under map decoding"
    - "reed muller codes for random erasures and errors"
    - "from polar to reed muller codes a technique to improve the finite length performance"
    - "channel coding the road to channel capacity"

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)