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: "binary message passing decoding of product codes based on generalized minimum distance decoding"
  Abstract: We propose a binary message passing decoding algorithm for product codes based on generalized minimum distance decoding (GMDD) of the component codes, where the last stage of the GMDD makes a decision based on the Hamming distance metric. The proposed algorithm closes half of the gap between conventional iterative bounded distance decoding (iBDD) and turbo product decoding based on the Chase--Pyndiah algorithm, at the expense of some increase in complexity. Furthermore, the proposed algorithm entails only a limited increase in data flow compared to iBDD.

Connected through hyperedge HE-1 (induced by source paper "on product codes with probabilistic amplitude shaping for high throughput fiber optic systems"):
  with members:
    - "binary message passing decoding of product like codes"
    - "iterative bounded distance decoding of product codes with scaled reliability"
    - "on low complexity decoding of product codes for high throughput fiber optic systems"
    - "energy efficient soft assisted product decoders"
    - "increasing achievable information rates via geometric shaping"
    - "achievable rates for probabilistic shaping"
    - "miscorrection free decoding of staircase codes"
    - "probabilistic amplitude shaping with hard decision decoding and staircase codes"

Connected through hyperedge HE-2 (induced by source paper "binary message passing decoding of product like codes"):
  with members:
    - "low complexity concatenated ldpc staircase codes"
    - "iterative bounded distance decoding of product codes with scaled reliability"
    - "on low complexity decoding of product codes for high throughput fiber optic systems"
    - "energy efficient soft assisted product decoders"
    - "probabilistic amplitude shaping with hard decision decoding and staircase codes"
    - "achievable information rates for coded modulation with hard decision decoding for coherent fiber optic systems"
    - "density evolution for deterministic generalized product codes on the binary erasure channel at high rates"
    - "staircase codes fec for 100 gb s otn"

Connected through hyperedge HE-3 (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 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"
    - "analysis and design of binary message passing decoders"

Connected through hyperedge HE-4 (induced by source paper "on parameter optimization of product codes for iterative bounded distance decoding with scaled reliability"):
  with members:
    - "binary message passing decoding of product like codes"
    - "low complexity concatenated ldpc staircase codes"
    - "iterative bounded distance decoding of product codes with scaled reliability"
    - "energy efficient soft assisted product decoders"
    - "staircase codes fec for 100 gb s otn"
    - "approaching capacity at high rates with iterative hard decision decoding"

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)