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 "refined upper bounds on stopping redundancy of binary linear codes"):
  Abstract: The l-th stopping redundancy ρ ι (C) of the binary [n, k, d] code C, 1 ≤ l ≤ d, is defined as the minimum number of rows in the parity-check matrix of C, such that the smallest stopping set is of size at least l. The stopping redundancy ρ(C) is defined as ρ d (C). In this work, we improve on the probabilistic analysis of stopping redundancy, proposed by Han, Siegel and Vardy, which yields the best bounds known today. In our approach, we judiciously select the first few rows in the parity-check matrix, and then continue with the probabilistic method. By using similar techniques, we improve also on the best known bounds on ρ ι (C), for 1 ≤ l ≤ d. Our approach is compared to the existing methods by numerical computations.

Includes members:
  Member "on the pseudocodeword redundancy of binary linear codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "stopping redundancy hierarchy beyond the minimum distance")
  Member "permutation decoding and the stopping redundancy hierarchy of cyclic and extended cyclic codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (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-3 (induced by source paper "bounds on separating redundancy of linear codes and rates of x codes")
  Member "on the stopping distance and the stopping redundancy of codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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-5 (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)