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 "error floor approximation for ldpc codes in the awgn channel"):
  Abstract: This paper addresses the prediction of error floors of low-density parity-check (LDPC) codes with variable nodes of constant degree in the additive white Gaussian noise (AWGN) channel. Specifically, we focus on the performance of the sum-product algorithm (SPA) decoder formulated in the log-likelihood ratio (LLR) domain. We hypothesize that several published error floor levels are due to the manner in which decoder implementations handled the LLRs at high SNRs. We employ an LLR-domain SPA decoder that does not saturate near-certain messages and find the error rates of our decoder to be lower by at least several orders of magnitude. We study the behavior of trapping sets (or near-codewords) that are the dominant cause of the reported error floors. #R##N#We develop a refined linear model, based on the work of Sun and others, that accurately predicts error floors caused by elementary tapping sets for saturating decoders. Performance results of several codes at several levels of decoder saturation are presented.

Includes members:
  Member "ldpc code density evolution in the error floor region":
    also connected through other hyperedges:
      (none)
  Member "the sum product algorithm for degree 2 check nodes and trapping sets":
    also connected through other hyperedges:
      (none)
  Member "numerical issues affecting ldpc error floors":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "prototyping software transceiver for the 5g new radio physical uplink shared channel")
  Member "controlling the error floor in ldpc decoding":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "performance bounds and estimates for quantized ldpc decoders")
  Member "quantized iterative message passing decoders with low error floor for ldpc codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "deep learning based quantization of l values for gray coded modulation")
  Member "on the dynamics of the error floor behavior in regular ldpc codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "construction of qc ldpc codes with low error floor by efficient systematic search and elimination of trapping sets")
  Member "the trapping redundancy of linear block codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "performance bounds and estimates for quantized ldpc decoders")
  Member "informed dynamic scheduling for belief propagation decoding of ldpc codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "relaxed scheduling for scalable belief propagation")

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)