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 on the binary erasure channel at high rates"
  Abstract: Generalized product codes (GPCs) are extensions of product codes (PCs) where code symbols are protected by two component codes but not necessarily arranged in a rectangular array. We consider a deterministic construction of GPCs (as opposed to randomized code ensembles) and analyze the asymptotic performance over the binary erasure channel under iterative decoding. Our code construction encompasses several classes of GPCs previously proposed in the literature, such as irregular PCs, block-wise braided codes, and staircase codes. It is assumed that the component codes can correct a fixed number of erasures and that the length of each component code tends to infinity. We show that this setup is equivalent to studying the behavior of a peeling algorithm applied to a sparse inhomogeneous random graph. Using a convergence result for these graphs, we derive the density evolution equations that characterize the asymptotic decoding performance. As an application, we discuss the design of irregular GPCs employing a mixture of component codes with different erasure-correcting capabilities.

Connected through hyperedge HE-1 (induced by source paper "binary message passing decoding of product like codes"):
  with members:
    - "binary message passing decoding of product codes based on generalized minimum distance decoding"
    - "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"
    - "staircase codes fec for 100 gb s otn"

Connected through hyperedge HE-2 (induced by source paper "binary message passing decoding of product codes based on generalized minimum distance decoding"):
  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"
    - "staircase codes fec for 100 gb s otn"
    - "approaching capacity at high rates with iterative hard decision decoding"
    - "analysis and design of binary message passing decoders"

Connected through hyperedge HE-3 (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 with higher order modulation"
    - "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-4 (induced by source paper "extended product and integrated interleaved codes"):
  with members:
    - "multi block interleaved codes for local and global read access"
    - "maximally recoverable codes for grid like topologies"
    - "bounds and constructions of codes with multiple localities"
    - "new constructions of sd and mr codes over small finite fields"
    - "integrated interleaved codes as locally recoverable codes properties and performance"
    - "generalized and extended product codes"
    - "repair locality with multiple erasure tolerance"
    - "locality and availability in distributed storage"

Connected through hyperedge HE-5 (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"
    - "density evolution for deterministic generalized product codes with higher order modulation"
    - "experimental demonstration of capacity increase and rate adaptation by probabilistically shaped 64 qam"
    - "constant composition distribution matching"
    - "arithmetic distribution matching"

Connected through hyperedge HE-6 (induced by source paper "miscorrection free decoding of staircase codes"):
  with members:
    - "improved decoding and error floor analysis of staircase codes"
    - "staircase codes fec for 100 gb s otn"
    - "approaching capacity at high rates with iterative hard decision decoding"

Connected through hyperedge HE-7 (induced by source paper "spatially coupled split component codes with iterative algebraic decoding"):
  with members:
    - "deterministic and ensemble based spatially coupled product codes"
    - "a scaling law to predict the finite length performance of spatially coupled ldpc codes"
    - "a simple proof of maxwell saturation for coupled scalar recursions"
    - "staircase codes fec for 100 gb s otn"
    - "approaching capacity at high rates with iterative hard decision decoding"
    - "on the asymptotic performance of iterative decoders for product codes"
    - "finite length scaling for iteratively decoded ldpc ensembles"

Connected through hyperedge HE-8 (induced by source paper "approaching capacity at high rates with iterative hard decision decoding"):
  with members:
    - "deterministic and ensemble based spatially coupled product codes"
    - "a simple proof of maxwell saturation for coupled scalar recursions"
    - "threshold saturation in spatially coupled constraint satisfaction problems"
    - "a simple proof of threshold saturation for coupled scalar recursions"
    - "staircase codes fec for 100 gb s otn"
    - "wave like solutions of general one dimensional spatially coupled systems"
    - "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec"
    - "on the number of errors correctable with codes on graphs"

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)