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: "improving belief propagation decoding of polar codes using scattered exit charts"
  Abstract: For finite length polar codes, channel polarization leaves a significant number of channels not fully polarized. Adding a Cyclic Redundancy Check (CRC) to better protect information on the semi-polarized channels has already been successfully applied in the literature, and is straightforward to be used in combination with Successive Cancellation List (SCL) decoding. Belief Propagation (BP) decoding, however, offers more potential for exploiting parallelism in hardware implementation, and thus, we focus our attention on improving the BP decoder. Specifically, similar to the CRC strategy in the SCL-case, we use a short-length "auxiliary" LDPC code together with the polar code to provide a significant improvement in terms of BER. We present the novel concept of "scattered" EXIT charts to design such auxiliary LDPC codes, and achieve net coding gains (Le. for the same total rate) of 0.4 dB at BER of 1E-5 compared to the conventional BP decoder.

Connected through hyperedge HE-1 (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"
    - "algebraic properties of polar codes from a new polynomial formalism"

Connected through hyperedge HE-2 (induced by source paper "belief propagation decoding of polar codes on permuted factor graphs"):
  with members:
    - "mitigating clipping effects on error floors under belief propagation decoding of polar codes"
    - "rnn decoding of linear block codes"
    - "partitioned successive cancellation list decoding of polar codes"
    - "combining belief propagation and successive cancellation list decoding of polar codes on a gpu platform"
    - "flexible length polar codes through graph based augmentation"
    - "list decoding of polar codes"
    - "how to construct polar codes"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"

Connected through hyperedge HE-3 (induced by source paper "neural belief propagation decoding of crc polar concatenated codes"):
  with members:
    - "deep learning methods for improved decoding of linear codes"
    - "belief propagation decoding of polar codes on permuted factor graphs"
    - "neural offset min sum decoding"
    - "list decoding of polar codes"

Connected through hyperedge HE-4 (induced by source paper "mitigating clipping effects on error floors under belief propagation decoding of polar codes"):
  with members:
    - "comparison of polar decoders with existing low density parity check and turbo decoders"
    - "on deep learning based channel decoding"
    - "combining belief propagation and successive cancellation list decoding of polar codes on a gpu platform"
    - "flexible length polar codes through graph based augmentation"
    - "reduced complexity belief propagation decoders for polar codes"
    - "unified scaling of polar codes error exponent scaling exponent moderate deviations and error floors"
    - "the effect of saturation on belief propagation decoding of ldpc codes"
    - "list decoding of polar codes"

Connected through hyperedge HE-5 (induced by source paper "scattered exit charts for finite length ldpc code design"):
  with members:
    - "code design for short blocks a survey"

Connected through hyperedge HE-6 (induced by source paper "flexible length polar codes through graph based augmentation"):
  with members:
    - "xj bp express journey belief propagation decoding for polar codes"
    - "list decoding of polar codes"
    - "how to construct 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)