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 trapping redundancy of linear block codes"):
  Abstract: We generalize the notion of the stopping redundancy in order to study the smallest size of a trapping set in Tanner graphs of linear block codes. In this context, we introduce the notion of the trapping redundancy of a code, which quantifies the relationship between the number of redundant rows in any parity-check matrix of a given code and the size of its smallest trapping set. Trapping sets with certain parameter sizes are known to cause error-floors in the performance curves of iterative belief propagation (BP) decoders, and it is therefore important to identify decoding matrices that avoid such sets. Bounds on the trapping redundancy are obtained using probabilistic and constructive methods, and the analysis covers both general and elementary trapping sets. Numerical values for these bounds are computed for the [2640, 1320] Margulis code and the class of projective geometry codes, and compared with some new code-specific trapping set size estimates.

Includes members:
  Member "permutation decoding and the stopping redundancy hierarchy of cyclic and extended cyclic codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "stopping redundancy hierarchy beyond the minimum distance")
  Member "on parity check collections for iterative erasure decoding that correct all correctable erasure patterns of a given size":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "bounds on separating redundancy of linear codes and rates of x codes")
  Member "on the hardness of approximating stopping and trapping sets in ldpc codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "design of finite length irregular protograph codes with low error floors over the binary input awgn channel using cyclic liftings")
  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")
  Member "improving convergence of belief propagation decoding":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a two stage selective averaging ldpc decoding")
  Member "a general computation rule for lossy summaries messages with examples from equalization":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "unifying message passing algorithms under the framework of constrained bethe free energy minimization")
  Member "characterizations of pseudo codewords of ldpc codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a unified framework for linear programming based communication receivers")
  Member "on the stopping distance and the stopping redundancy of codes":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "decoder tailored polar code design using the genetic algorithm")

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)