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: "results on parity check matrices with optimal stopping and or dead end set enumerators"
  Abstract: The performance of iterative decoding techniques for linear block codes correcting erasures depends very much on the sizes of the stopping sets associated with the underlying Tanner graph, or, equivalently, the parity-check matrix representing the code. In this paper, we introduce the notion of dead-end sets to explicitly demonstrate this dependency. The choice of the parity-check matrix entails a trade-off between performance and complexity. We give bounds on the complexity of iterative decoders achieving optimal performance in terms of the sizes of the underlying parity-check matrices. Further, we fully characterize codes for which the optimal stopping set enumerator equals the weight enumerator.

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"
    - "on the stopping distance and the stopping redundancy of codes"
    - "improved upper bounds on stopping redundancy"

Connected through hyperedge HE-2 (induced by source paper "stopping set distributions of some linear codes"):
  with members:
    - "single exclusion number and the stopping redundancy of mds codes"
    - "permutation decoding and the stopping redundancy hierarchy of cyclic and extended cyclic codes"
    - "on the asymptotic weight and stopping set distribution of regular ldpc ensembles"
    - "complete enumeration of stopping sets of full rank parity check matrices of hamming codes"
    - "on the stopping distance and the stopping redundancy of codes"
    - "improved upper bounds on stopping redundancy"

Connected through hyperedge HE-3 (induced by source paper "single exclusion number and the stopping redundancy of mds 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 stopping distance and the stopping redundancy of codes"
    - "improved upper bounds on stopping redundancy"
    - "pseudocodewords of tanner graphs"

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)