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: "complete enumeration of stopping sets of full rank parity check matrices of hamming codes"
  Abstract: Stopping sets, and in particular their numbers and sizes, play an important role in determining the performance of iterative decoders of linear codes over binary erasure channels. In the 2004 Shannon Lecture, McEliece presented an expression for the number of stopping sets of size three for a full-rank parity-check matrix of the Hamming code. In this correspondence, we derive an expression for the number of stopping sets of any given size for the same parity-check matrix.

Connected through hyperedge HE-1 (induced by source paper "fountain uncorrectable sets and finite length analysis"):
  with members:
    - "turbo decoding on the binary erasure channel finite length analysis and turbo stopping sets"

Connected through hyperedge HE-2 (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"
    - "on the stopping distance and the stopping redundancy of codes"
    - "hard problems of algebraic geometry codes"
    - "improved upper bounds on stopping redundancy"

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"
    - "on the hardness of approximating stopping and trapping sets in ldpc 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 "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"
    - "results on parity check matrices with optimal stopping and or dead end set enumerators"
    - "on the stopping distance and the stopping redundancy of codes"
    - "improved upper bounds on stopping redundancy"

Connected through hyperedge HE-5 (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"
    - "on the hardness of approximating stopping and trapping sets in ldpc codes"
    - "average stopping set weight distribution of redundant random matrix ensembles"
    - "on the stopping distance and the stopping redundancy of codes"
    - "improved upper bounds on stopping redundancy"

Connected through hyperedge HE-6 (induced by source paper "permutation decoding and the stopping redundancy hierarchy of linear block codes"):
  with members:
    - "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-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"
    - "on the hardness of approximating stopping and trapping sets in ldpc 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)