human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "mitigating clipping effects on error floors under belief propagation decoding of polar codes"):
  Abstract: In this work, we show that polar belief propagation (BP) decoding exhibits an error floor behavior which is caused by clipping of the log-likelihood ratios (LLR). The error floor becomes more pronounced for clipping to smaller LLR-values. We introduce a single-value measure quantifying a "relative error floor", showing, by exhaustive simulations for different lengths, that the error floor is mainly caused by inadequate clipping values. We propose four modifications to the conventional BP decoding algorithm to mitigate this error floor behavior, demonstrating that the error floor is a decoder property, and not a code property. The results agree with the fact that polar codes are theoretically proven to not suffer from error floors. Finally, we show that another cause of error floors can be an improper selection of frozen bit positions.

Includes members:
  Member "comparison of polar decoders with existing low density parity check and turbo decoders":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "decoder tailored polar code design using the genetic algorithm")
  Member "on deep learning based channel decoding":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "design of capacity approaching low density parity check codes using recurrent neural networks")
  Member "improving belief propagation decoding of polar codes using scattered exit charts":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "decoder tailored polar code design using the genetic algorithm")
  Member "combining belief propagation and successive cancellation list decoding of polar codes on a gpu platform":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "crc aided belief propagation list decoding of polar codes")
  Member "flexible length polar codes through graph based augmentation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "crc aided belief propagation list decoding of polar codes")
  Member "reduced complexity belief propagation decoders for polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "comparison of polar decoders with existing low density parity check and turbo decoders")
  Member "unified scaling of polar codes error exponent scaling exponent moderate deviations and error floors":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on the polarizing behavior and scaling exponent of polar codes with product kernels")
  Member "the effect of saturation on belief propagation decoding of ldpc codes":
    also connected through other hyperedges:
      (none)

Question: Please tell me which class the source paper 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)