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 "stopping redundancy hierarchy beyond the minimum distance"):
  Abstract: Stopping sets play a crucial role in failure events of iterative decoders over a binary erasure channel (BEC). The $l$-th stopping redundancy is the minimum number of rows in the parity-check matrix of a code, which contains no stopping sets of size up to $\ell$. In this work, a notion of coverable stopping sets is defined. In order to achieve maximum-likelihood performance under iterative decoding over BEC, the parity-check matrix should contain no coverable stopping sets of size $\ell$, for $1 \le \ell \le n-k$, where $n$ is the code length, $k$ is the code dimension. By estimating the number of coverable stopping sets, we obtain upper bounds on the $\ell$-th stopping redundancy, $1 \le \ell \le n-k$. The bounds are derived for both specific codes and codes ensembles. In the range $1 \le \ell \le d-1$, for specific codes, the new bounds improve on the results in the literature. Numerical results are also obtained.

Includes members:
  Member "distance properties of short ldpc codes and their impact on the bp ml and near ml decoding performance":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "ml and near ml decoding of ldpc codes over the bec bounds and decoding algorithms")
  Member "on the pseudocodeword redundancy of binary linear codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "distance properties of short ldpc codes and their impact on the bp ml and near ml decoding performance")
  Member "permutation decoding and the stopping redundancy hierarchy of cyclic and extended cyclic codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "new two stage automorphism group decoders for cyclic codes in the erasure channel")
  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-4 (induced by source paper "bounds on separating redundancy of linear codes and rates of x codes")
  Member "generating parity check equations for bounded distance iterative erasure decoding":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "improved upper bounds on stopping redundancy")
  Member "on the stopping distance and the stopping redundancy of codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "decoder tailored polar code design using the genetic algorithm")
  Member "improved upper bounds on stopping redundancy":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "bounds on separating redundancy of linear codes and rates of x 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)