human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "improved upper bounds on stopping redundancy"
  Abstract: Let C be a linear code with length n and minimum distance d. The stopping redundancy of C is defined as the minimum number of rows in a parity-check matrix for C such that the smallest stopping sets in the corresponding Tanner graph have size d. We derive new upper bounds on the stopping redundancy of linear codes in general, and of maximum distance separable (MDS) codes specifically, and show how they improve upon previously known results. For MDS codes, the new bounds are found by upper bounding the stopping redundancy by a combinatorial quantity closely related to Turan numbers. (The Turan number, T(v,k,t), is the smallest number of t-subsets of a v-set, such that every k-subset of the v-set contains at least one of the t-subsets.) We further show that the stopping redundancy of MDS codes is T(n,d-1,d-2)(1+O(n^{-1})) for fixed d, and is at most T(n,d-1,d-2)(3+O(n^{-1})) for fixed code dimension k=n-d+1. For d=3,4, we prove that the stopping redundancy of MDS codes is equal to T(n,d-1,d-2), for which exact formulas are known. For d=5, we show that the stopping redundancy of MDS codes is either T(n,4,3) or T(n,4,3)+1.

Connected through hyperedge HE-1 (induced by source paper "bounds on separating redundancy of linear codes and rates of x codes"):
  with members:
    - "probabilistic bounds on the trapping redundancy of linear codes"
    - "on generic erasure correcting sets and related problems"
    - "a combinatorial approach to x tolerant compaction circuits"
    - "the trapping redundancy of linear block codes"
    - "on parity check collections for iterative erasure decoding that correct all correctable erasure patterns of a given size"
    - "results on parity check matrices with optimal stopping and or dead end set enumerators"
    - "on the stopping distance and the stopping redundancy of codes"

Connected through hyperedge HE-2 (induced by source paper "stopping redundancy hierarchy beyond the minimum distance"):
  with members:
    - "distance properties of short ldpc codes and their impact on the bp ml and near ml decoding performance"
    - "on the pseudocodeword redundancy of binary linear codes"
    - "permutation decoding and the stopping redundancy hierarchy of cyclic and extended cyclic codes"
    - "on parity check collections for iterative erasure decoding that correct all correctable erasure patterns of a given size"
    - "generating parity check equations for bounded distance iterative erasure decoding"
    - "on the stopping distance and the stopping redundancy of codes"

Connected through hyperedge HE-3 (induced by source paper "refined upper bounds on stopping redundancy of binary linear codes"):
  with members:
    - "on the pseudocodeword redundancy of binary linear codes"
    - "permutation decoding and the stopping redundancy hierarchy of cyclic and extended cyclic codes"
    - "on parity check collections for iterative erasure decoding that correct all correctable erasure patterns of a given size"
    - "on the stopping distance and the stopping redundancy of codes"

Connected through hyperedge HE-4 (induced by source paper "stopping sets of algebraic geometry codes"):
  with members:
    - "on generic erasure correcting sets and related problems"
    - "stopping set distributions of some linear codes"
    - "single exclusion number and the stopping redundancy of mds codes"
    - "permutation decoding and the stopping redundancy hierarchy of cyclic and extended cyclic codes"
    - "on parity check collections for iterative erasure decoding that correct all correctable erasure patterns of a given size"
    - "complete enumeration of stopping sets of full rank parity check matrices of hamming codes"
    - "on the stopping distance and the stopping redundancy of codes"
    - "hard problems of algebraic geometry codes"

Connected through hyperedge HE-5 (induced by source paper "windowed decoding of protograph based ldpc convolutional codes over erasure channels"):
  with members:
    - "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec"
    - "asymptotically regular ldpc codes with linear distance growth and thresholds close to capacity"
    - "on distance properties of quasi cyclic protograph based ldpc codes"
    - "construction of near optimum burst erasure correcting low density parity check codes"

Connected through hyperedge HE-6 (induced by source paper "on the pseudocodeword redundancy of binary linear codes"):
  with members:
    - "the trapping redundancy of linear block codes"
    - "a decomposition theory for binary linear codes"
    - "pseudo codeword analysis of tanner graphs from projective and euclidean planes"
    - "bounds on the threshold of linear programming decoding"
    - "on the stopping distance and the stopping redundancy of codes"
    - "graph cover decoding and finite length analysis of message passing iterative decoding of ldpc codes"

Connected through hyperedge HE-7 (induced by source paper "on generic erasure correcting sets and related problems"):
  with members:
    - "permutation decoding and the stopping redundancy hierarchy of cyclic and extended cyclic codes"
    - "on parity check collections for iterative erasure decoding that correct all correctable erasure patterns of a given size"
    - "on the stopping distance and the stopping redundancy of codes"

Connected through hyperedge HE-8 (induced by source paper "multiple bases belief propagation decoding of high density cyclic codes"):
  with members:
    - "permutation decoding and the stopping redundancy hierarchy of cyclic and extended cyclic codes"
    - "on parity check collections for iterative erasure decoding that correct all correctable erasure patterns of a given size"
    - "on the hardness of approximating stopping and trapping sets in ldpc codes"
    - "complete enumeration of stopping sets of full rank parity check matrices of hamming codes"
    - "on the stopping distance and the stopping redundancy of codes"
    - "pseudocodewords of tanner graphs"
    - "iterative soft input soft output decoding of reed solomon codes by adapting the parity check matrix"

Question: Please tell me which class the center node 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)