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: "two bit message passing decoders for ldpc codes over the binary symmetric channel"
  Abstract: A class of two-bit message passing decoders for decoding column-weight-four LDPC codes over the binary symmetric channel is proposed. The thresholds for various decoders in this class are derived using density evolution. For a specific decoder, the sufficient conditions for correcting all error patterns with up to three errors are derived.

Connected through hyperedge HE-1 (induced by source paper "coding for optical communications can we approach the shannon limit with low complexity"):
  with members:
    - "one and two bit message passing for sc ldpc codes with higher order modulation"
    - "binary message passing decoding of product codes based on generalized minimum distance decoding"
    - "binary message passing decoding of product like codes"
    - "low complexity concatenated ldpc staircase codes"
    - "iterative bounded distance decoding of product codes with scaled reliability"
    - "optimization of bit mapping and quantized decoding for off the shelf protograph ldpc codes with application to ieee 802 3ca"
    - "energy efficient soft assisted product decoders"
    - "staircase codes fec for 100 gb s otn"

Connected through hyperedge HE-2 (induced by source paper "on the total power capacity of regular ldpc codes with iterative message passing decoders"):
  with members:
    - "on the energy complexity of ldpc decoder circuits"
    - "energy consumption of vlsi decoders"
    - "towards a communication theoretic understanding of system level power consumption"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"
    - "graph cover decoding and finite length analysis of message passing iterative decoding of ldpc codes"

Connected through hyperedge HE-3 (induced by source paper "towards approaching total power capacity transmit and decoding power minimization for ldpc codes"):
  with members:
    - "on the energy complexity of ldpc decoder circuits"
    - "energy consumption of vlsi decoders"
    - "towards a communication theoretic understanding of system level power consumption"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"
    - "graph cover decoding and finite length analysis of message passing iterative decoding of ldpc codes"

Connected through hyperedge HE-4 (induced by source paper "multilevel decoders surpassing belief propagation on the binary symmetric channel"):
  with members:
    - "error correction capability of column weight three ldpc codes"
    - "ldpc 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)