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 "ldpc code density evolution in the error floor region"):
  Abstract: Abstract—This short paper explores density evolution (DE) forlow-density parity-check (LDPC) codes at signal-to-noise-ratios(SNRs) that are signiﬁcantly above the decoding threshold. Thefocus is on the additive white Gaussian noise channel and LDPCcodes in which the variable nodes have regular degree.Prior work, using DE, produced results in the error ﬂoorregion which were asymptotic in the belief-propagation decoder’slog-likelihood ratio (LLR) values. We develop expressions whichclosely approximate the LLR growth behavior at moderate LLRmagnitudes. We then produce bounds on the mean extrinsiccheck-node LLR values required, as a function of SNR, such thatthe growth rate of the LLRs exceeds that of a particular trappingset’s internal LLRs such that its error ﬂoor contribution may beeliminated. We ﬁnd that our predictions for the mean LLRs tobe accurate in the error ﬂoor region, but the predictions for theLLR variance to be lacking beyond several initial iterations.Index Terms—Low-density parity-check (LDPC) code, beliefpropagation (BP), sum-product algorithm (SPA) decoding, den-sity evolution, error ﬂoor, Margulis code, trapping set.

Includes members:
  Member "controlling the error floor in ldpc decoding":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "performance bounds and estimates for quantized ldpc decoders")
  Member "error floor approximation for ldpc codes in the awgn channel":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a combinatorial methodology for optimizing non binary graph based codes theoretical analysis and applications in data storage")
  Member "on the dynamics of the error floor behavior in regular ldpc codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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-4 (induced by source paper "performance bounds and estimates for quantized ldpc decoders")
  Member "on the block error probability of lp decoding of ldpc codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "impact of redundant checks on the lp decoding thresholds of ldpc codes")
  Member "a general method for finding low error rates of ldpc codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "hardness results on finding leafless elementary trapping sets and elementary absorbing sets of ldpc codes")

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)