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: "ldpc codes which can correct three errors under iterative decoding"
  Abstract: In this paper, we provide necessary and sufficient conditions for a column-weight-three LDPC code to correct all patterns up to three errors when decoded using Gallager A algorithm. We then provide a construction technique which results in a code satisfying the above conditions. We also provide numerical assessment of code performance via simulation results.

Connected through hyperedge HE-1 (induced by source paper "finite alphabet iterative decoders part ii towards guaranteed error correction of ldpc codes via iterative decoder diversity"):
  with members:
    - "multilevel decoders surpassing belief propagation on the binary symmetric channel"
    - "pseudocodewords of tanner graphs"

Connected through hyperedge HE-2 (induced by source paper "ldpc codes from latin squares free of small trapping sets"):
  with members:
    - "on trapping sets and guaranteed error correction capability of ldpc codes and gldpc codes"
    - "a message passing algorithm for counting short cycles in a graph"
    - "instanton based techniques for analysis and reduction of error floors of ldpc codes"
    - "shortened array codes of large girth"
    - "pseudocodewords of tanner graphs"

Connected through hyperedge HE-3 (induced by source paper "multilevel decoders surpassing belief propagation on the binary symmetric channel"):
  with members:
    - "two bit message passing decoders for ldpc codes over the binary symmetric channel"
    - "error correction capability of column weight three ldpc codes"
    - "error correction capability of column weight three ldpc codes"

Connected through hyperedge HE-4 (induced by source paper "instanton based techniques for analysis and reduction of error floors of ldpc codes"):
  with members:
    - "on trapping sets and guaranteed error correction capability of ldpc codes and gldpc codes"
    - "error correction capability of column weight three ldpc codes"
    - "probabilistic analysis of linear programming decoding"
    - "error correction capability of column weight three ldpc codes"
    - "pseudo codeword analysis of tanner graphs from projective and euclidean planes"
    - "instanton analysis of low density parity check codes in the error floor regime"
    - "graph cover decoding and finite length analysis of message passing iterative decoding of ldpc codes"
    - "pseudocodewords of tanner graphs"

Connected through hyperedge HE-5 (induced by source paper "two bit message passing decoders for ldpc codes over the binary symmetric channel"):
  with members:
    - "error correction capability of column weight three ldpc codes"
    - "low density parity check codes which can correct three errors under iterative decoding"
    - "error correction capability of column weight three ldpc codes"

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)