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: "on the hardness of approximating stopping and trapping sets in ldpc codes"
  Abstract: We prove that approximating the size of stopping and trapping sets in Tanner graphs of linear block codes, and more restrictively, the class of low-density parity-check (LDPC) codes, is NP-hard. The ramifications of our findings are that methods used for estimating the height of the error-floor of moderate- and long-length LDPC codes based on stopping and trapping set enumeration cannot provide accurate worst-case performance predictions.

Connected through hyperedge HE-1 (induced by source paper "design of finite length irregular protograph codes with low error floors over the binary input awgn channel using cyclic liftings"):
  with members:
    - "lowering the error floor of ldpc codes using cyclic liftings"
    - "code annealing and the suppressing effect of the cyclically lifted ldpc code ensemble"

Connected through hyperedge HE-2 (induced by source paper "an efficient algorithm for finding dominant trapping sets of ldpc codes"):
  with members:
    - "lowering the error floor of ldpc codes using cyclic liftings"
    - "the trapping redundancy of linear block codes"

Connected through hyperedge HE-3 (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"
    - "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"
    - "pseudocodewords of tanner graphs"
    - "iterative soft input soft output decoding of reed solomon codes by adapting the parity check matrix"

Connected through hyperedge HE-4 (induced by source paper "cyclic and quasi cyclic ldpc codes on row and column constrained parity check matrices and their trapping sets"):
  with members:
    - "on trapping sets and guaranteed error correction capability of ldpc codes and gldpc codes"
    - "structured ldpc codes from permutation matrices free of small trapping sets"
    - "instanton analysis of low density parity check codes in the error floor regime"
    - "a general method for finding low error rates of ldpc codes"

Connected through hyperedge HE-5 (induced by source paper "the trapping redundancy of linear block 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"
    - "shortened array codes of large girth"
    - "improving convergence of belief propagation decoding"
    - "a general computation rule for lossy summaries messages with examples from equalization"
    - "characterizations of pseudo codewords of ldpc codes"
    - "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-6 (induced by source paper "permutation decoding and the stopping redundancy hierarchy of cyclic and extended cyclic codes"):
  with members:
    - "on parity check collections for iterative erasure decoding that correct all correctable erasure patterns of a given size"
    - "average stopping set weight distribution of redundant random matrix 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-7 (induced by source paper "results on parity check matrices with optimal stopping and or dead end set enumerators"):
  with members:
    - "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"
    - "improved upper bounds on stopping redundancy"

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)