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 pseudocodeword redundancy of binary linear codes"
  Abstract: The AWGNC, BSC, and max-fractional pseudocodeword redundancies of a binary linear code are defined to be the smallest number of rows in a parity-check matrix such that the corresponding minimum pseudoweight is equal to the minimum Hamming distance of the code. It is shown that most codes do not have a finite pseudocodeword redundancy. Also, upper bounds on the pseudocodeword redundancy for some families of codes, including codes based on designs, are provided. The pseudocodeword redundancies for all codes of small length (at most 9) are computed. Furthermore, comprehensive results are provided on the cases of cyclic codes of length at most 250 for which the eigenvalue bound of Vontobel and Koetter is sharp.

Connected through hyperedge HE-1 (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"
    - "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"
    - "improved upper bounds on stopping redundancy"

Connected through hyperedge HE-2 (induced by source paper "distance properties of short ldpc codes and their impact on the bp ml and near ml decoding performance"):
  with members:
    - "ml and near ml decoding of ldpc codes over the bec bounds and decoding algorithms"
    - "refined upper bounds on stopping redundancy of binary linear codes"
    - "tree structure expectation propagation for decoding ldpc codes over binary erasure channels"
    - "permutation decoding and the stopping redundancy hierarchy of cyclic and extended cyclic 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-3 (induced by source paper "pseudocodeword free criterion for codes with cycle free tanner graph"):
  with members:
    - "a decomposition theory for binary linear codes"
    - "pseudo codeword analysis of tanner graphs from projective and euclidean planes"
    - "pseudocodewords of tanner graphs"

Connected through hyperedge HE-4 (induced by source paper "refined upper bounds on stopping redundancy of binary linear 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"

Connected through hyperedge HE-5 (induced by source paper "new results on the pseudoredundancy"):
  with members:
    - "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 "codes on graphs observability controllability and local reducibility"):
  with members:
    - "characteristic generators and dualization for tail biting trellises"
    - "normal factor graphs and holographic transformations"
    - "linear tail biting trellises characteristic generators and the bcjr construction"
    - "on minimal tree realizations of linear codes"
    - "constraint complexity of realizations of linear codes on arbitrary graphs"
    - "graph cover decoding and finite length analysis of message passing iterative decoding of ldpc codes"
    - "pseudocodewords of tanner graphs"
    - "the dynamics of group codes dual abelian group codes and systems"

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)