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 "construction of qc ldpc codes with low error floor by efficient systematic search and elimination of trapping sets"):
  Abstract: We propose a systematic design of protograph-based quasi-cyclic (QC) low-density parity-check (LDPC) codes with low error floor. We first characterize the trapping sets of such codes and demonstrate that the QC structure of the code eliminates some of the trapping set structures that can exist in a code with the same degree distribution and girth but lacking the QC structure. Using this characterization, our design aims at eliminating a targeted collection of trapping sets. Considering the parent/child relationship between the trapping sets in the collection, we search for and eliminate those trapping sets that are in the collection but are not a child of any other trapping set in the collection. An efficient layered algorithm is designed for the search of these targeted trapping sets. Compared to the existing codes in the literature, the designed codes are superior in the sense that they are free of the same collection of trapping sets with a smaller block length, or a larger collection of trapping sets with the same block length. In addition, the efficiency of the search algorithm makes it possible to design codes with larger degrees which are free of trapping sets within larger ranges compared to the state-of-the-art.

Includes members:
  Member "edge coloring technique to remove small elementary trapping sets from tanner graph of qc ldpc codes with column weight 4":
    also connected through other hyperedges:
      (none)
  Member "efficient search of qc ldpc codes with girths 6 and 8 and free of elementary trapping sets with small size":
    also connected through other hyperedges:
      (none)
  Member "thresholds of absorbing sets in low density parity check codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a combinatorial methodology for optimizing non binary graph based codes theoretical analysis and applications in data storage")
  Member "the cycle consistency matrix approach to absorbing sets in separable circulant based ldpc codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "integer ring sieve irs for constructing compact qc ldpc codes with large girth")
  Member "design of finite length irregular protograph codes with low error floors over the binary input awgn channel using cyclic liftings":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a new multi edge metric constrained peg algorithm for designing binary ldpc code with improved cycle structure")
  Member "lowering the error floor of ldpc codes using cyclic liftings":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "integer ring sieve irs for constructing compact qc ldpc codes with large girth")
  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 "from cages to trapping sets and codewords a technique to derive tight upper bounds on the minimum size of trapping sets and minimum distance 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)