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 "thresholds of absorbing sets in low density parity check codes"):
  Abstract: In this paper, we investigate absorbing sets, responsible of error floors in Low Density Parity Check codes. We look for a concise, quantitative way to rate the absorbing sets' dangerousness. Based on a simplified model for iterative decoding evolution, we show that absorbing sets exhibit a threshold behavior. An absorbing set with at least one channel log-likelihood-ratio below the threshold can stop the convergence towards the right codeword. Otherwise convergence is guaranteed. We show that absorbing sets with negative thresholds can be deactivated simply using proper saturation levels. We propose an efficient algorithm to compute thresholds.

Includes members:
  Member "the cycle consistency matrix approach to absorbing sets in separable circulant based ldpc codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "integer ring sieve irs for constructing compact qc ldpc codes with large girth")
  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 "two bit bit flipping decoding of ldpc codes":
    also connected through other hyperedges:
      (none)
  Member "on trapping sets and guaranteed error correction capability of ldpc codes and gldpc codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "check hybrid gldpc codes systematic elimination of trapping sets and guaranteed error correction capability")
  Member "instanton based techniques for analysis and reduction of error floors of ldpc codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the admm penalized decoder for ldpc codes")
  Member "on the dynamics of the error floor behavior in regular ldpc codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "construction of qc ldpc codes with low error floor by efficient systematic search and elimination of trapping sets")
  Member "error correction capability of column weight three ldpc codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "multilevel decoders surpassing belief propagation on the binary symmetric channel")
  Member "error correction capability of column weight three ldpc codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "multilevel decoders surpassing belief propagation on the binary symmetric channel")

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)