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 "single exclusion number and the stopping redundancy of mds codes"):
  Abstract: For a linear block code C, its stopping redundancy is defined as the smallest number of check nodes in a Tanner graph for C, such that there exist no stopping sets of size smaller than the minimum distance of C. Schwartz and Vardy conjectured that the stopping redundancy of a maximum-distance separable (MDS) code should only depend on its length and minimum distance. We define the (n, t)-single-exclusion number, S(n, t) as the smallest number of i-subsets of an n-set, such that for each i-subset of the n-set, i =1,... ,t + 1, there exists a i-subset that contains all but one element of the i-subset. New upper bounds on the single-exclusion number are obtained via probabilistic methods, recurrent inequalities, as well as explicit constructions. The new bounds are used to better understand the stopping redundancy of MDS codes. In particular, it is shown that for [n, k = n - d + 1, d] MDS codes, as n rarr infin , the stopping redundancy is asymptotic to S(n, d - 2), if d = o(radic(n)), or if k = o(radic(n)), k rarr infin, thus giving partial confirmation of the Schwartz-Vardy conjecture in the asymptotic sense.

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 "results on parity check matrices with optimal stopping and or dead end set enumerators":
    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")
  Member "pseudocodewords of tanner graphs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "free pseudodistance growth rates for spatially coupled ldpc codes over the bec")

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)