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 "the cycle consistency matrix approach to absorbing sets in separable circulant based ldpc codes"):
  Abstract: For LDPC codes operating over additive white Gaussian noise channels and decoded using message-passing decoders with limited precision, absorbing sets have been shown to be a key factor in error floor behavior. Focusing on this scenario, this paper introduces the cycle consistency matrix (CCM) as a powerful analytical tool for characterizing and avoiding absorbing sets in separable circulant-based (SCB) LDPC codes. SCB codes include a wide variety of regular LDPC codes such as array-based LDPC codes as well as many common quasi-cyclic codes. As a consequence of its cycle structure, each potential absorbing set in an SCB LDPC code has a CCM, and an absorbing set can be present in an SCB LDPC code only if the associated CCM has a nontrivial null space. #R##N#CCM-based analysis can determine the multiplicity of an absorbing set in an SCB code and CCM-based constructions avoid certain small absorbing sets completely. While these techniques can be applied to an SCB code of any rate, lower-rate SCB codes can usually avoid small absorbing sets because of their higher variable node degree. This paper focuses attention on the high-rate scenario in which the CCM constructions provide the most benefit. Simulation results demonstrate that under limited-precision decoding the new codes have steeper error-floor slopes and can provide one order of magnitude of improvement in the low FER region.

Includes members:
  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-1 (induced by source paper "construction of qc ldpc codes with low error floor by efficient systematic search and elimination of trapping sets")
  Member "absorbing set spectrum approach for practical code design":
    also connected through other hyperedges:
      (none)
  Member "cyclic and quasi cyclic ldpc codes on row and column constrained parity check matrices and their trapping sets":
    also connected through other hyperedges:
      (none)
  Member "lowering the error floor of ldpc codes using cyclic liftings":
    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 "structured ldpc codes from permutation matrices free of small trapping sets":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "ldpc decoding with limited precision soft information in flash memories")
  Member "shortened array codes of large girth":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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)