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: "density evolution for deterministic generalized product codes with higher order modulation"
  Abstract: Generalized product codes (GPCs) are extensions of product codes (PCs) where coded bits are protected by two component codes but not necessarily arranged in a rectangular array. It has recently been shown that there exists a large class of deterministic GPCs (including, e.g., irregular PCs, half-product codes, staircase codes, and certain braided codes) for which the asymptotic performance under iterative bounded-distance decoding over the binary erasure channel (BEC) can be rigorously characterized in terms of a density evolution analysis. In this paper, the analysis is extended to the case where transmission takes place over parallel BECs with different erasure probabilities. We use this model to predict the code performance in a coded modulation setup with higher-order signal constellations. We also discuss the design of the bit mapper that determines the allocation of the coded bits to the modulation bits of the signal constellation.

Connected through hyperedge HE-1 (induced by source paper "on low complexity decoding of product codes for high throughput fiber optic systems"):
  with members:
    - "low complexity concatenated ldpc staircase codes"
    - "iterative bounded distance decoding of product codes with scaled reliability"
    - "probabilistic amplitude shaping with hard decision decoding and staircase codes"
    - "density evolution for deterministic generalized product codes on the binary erasure channel at high rates"
    - "terminated and tailbiting spatially coupled codes with optimized bit mappings for spectrally efficient fiber optical systems"
    - "a pragmatic coded modulation scheme for high spectral efficiency fiber optic communications"
    - "staircase codes fec for 100 gb s otn"
    - "analysis and design of binary message passing decoders"

Connected through hyperedge HE-2 (induced by source paper "probabilistic amplitude shaping with hard decision decoding and staircase codes"):
  with members:
    - "probabilistically shaped coded modulation with hard decision decoding for coherent optical systems"
    - "achievable rates for probabilistic shaping"
    - "high throughput probabilistic shaping with product distribution matching"
    - "on probabilistic shaping of quadrature amplitude modulation for the nonlinear fiber channel"
    - "experimental demonstration of capacity increase and rate adaptation by probabilistically shaped 64 qam"
    - "density evolution for deterministic generalized product codes on the binary erasure channel at high rates"
    - "constant composition distribution matching"
    - "arithmetic distribution matching"

Connected through hyperedge HE-3 (induced by source paper "achievable information rates for coded modulation with hard decision decoding for coherent fiber optic systems"):
  with members:
    - "performance prediction of nonbinary forward error correction in optical transmission experiments"
    - "information rates of next generation long haul optical fiber systems using coded modulation"
    - "on achievable rates for long haul fiber optic communications"
    - "terminated and tailbiting spatially coupled codes with optimized bit mappings for spectrally efficient fiber optical systems"
    - "staircase codes fec for 100 gb s otn"
    - "approaching capacity at high rates with iterative hard decision decoding"

Connected through hyperedge HE-4 (induced by source paper "probabilistically shaped coded modulation with hard decision decoding for coherent optical systems"):
  with members:
    - "constant composition distribution matching"
    - "staircase codes fec for 100 gb s otn"

Connected through hyperedge HE-5 (induced by source paper "density evolution for deterministic generalized product codes on the binary erasure channel at high rates"):
  with members:
    - "deterministic and ensemble based spatially coupled product codes"
    - "a simple proof of maxwell saturation for coupled scalar recursions"
    - "irregular product codes"
    - "staircase codes fec for 100 gb s otn"
    - "approaching capacity at high rates with iterative hard decision decoding"
    - "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec"
    - "on the asymptotic performance of iterative decoders for product codes"
    - "finite length scaling for iteratively decoded ldpc ensembles"

Connected through hyperedge HE-6 (induced by source paper "density evolution for deterministic generalized product codes on the binary erasure channel"):
  with members:
    - "a simple proof of maxwell saturation for coupled scalar recursions"
    - "irregular product codes"
    - "staircase codes fec for 100 gb s otn"
    - "approaching capacity at high rates with iterative hard decision decoding"
    - "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec"
    - "on the asymptotic performance of iterative decoders for product codes"
    - "finite length scaling for iteratively decoded ldpc ensembles"

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)