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: "terminated and tailbiting spatially coupled codes with optimized bit mappings for spectrally efficient fiber optical systems"
  Abstract: We study the design of spectrally efficient fiber-optical communication systems based on different spatially coupled (SC) forward error correction (FEC) schemes. In particular, we optimize the allocation of the coded bits from the FEC encoder to the modulation bits of the signal constellation. Two SC code classes are considered. The codes in the first class are protograph-based low-density parity-check (LDPC) codes which are decoded using iterative soft-decision decoding. The codes in the second class are generalized LDPC codes which are decoded using iterative hard-decision decoding. For both code classes, the bit allocation is optimized for the terminated and tailbiting SC cases based on a density evolution analysis. An optimized bit allocation can significantly improve the performance of tailbiting SC codes codes over the baseline sequential allocation, up to the point where they have a comparable gap to capacity as their terminated counterparts, at a lower FEC overhead. For the considered terminated SC codes, the optimization only results in marginal performance improvements, suggesting that in this case a sequential allocation is close to optimal.

Connected through hyperedge HE-1 (induced by source paper "analysis and optimization of tail biting spatially coupled protograph ldpc codes for bicm id systems"):
  with members:
    - "finite length construction of high performance spatially coupled codes via optimized partitioning and lifting"
    - "efficient search of compact qc ldpc and sc ldpc convolutional codes with large girth"
    - "improving the decoding threshold of tailbiting spatially coupled ldpc codes by energy shaping"
    - "compact qc ldpc block and sc ldpc convolutional codes for low latency communications"
    - "design and analysis of time invariant sc ldpc convolutional codes with small constraint length"
    - "wave like decoding of tail biting spatially coupled ldpc codes through iterative demapping"
    - "finite length analysis of spatially coupled regular ldpc ensembles on burst erasure channels"
    - "efficient multi dimensional mapping using qam constellations for bicm id"

Connected through hyperedge HE-2 (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"
    - "density evolution for deterministic generalized product codes on the binary erasure channel at high rates"
    - "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-3 (induced by source paper "improving the decoding threshold of tailbiting spatially coupled ldpc codes by energy shaping"):
  with members:
    - "spatially coupled ldpc codes constructed from protographs"
    - "optimized bit mappings for spatially coupled ldpc codes over parallel binary erasure channels"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"

Connected through hyperedge HE-4 (induced by source paper "continuous transmission of spatially coupled ldpc code chains"):
  with members:
    - "spatially coupled ldpc codes constructed from protographs"
    - "triggering wave like convergence of tail biting spatially coupled ldpc codes"
    - "triggering wave like convergence of tail biting spatially coupled ldpc codes single and dual channel setup"
    - "a scaling law to predict the finite length performance of spatially coupled ldpc codes"
    - "threshold saturation for spatially coupled ldpc and ldgm codes on bms channels"
    - "on the convergence speed of spatially coupled ldpc ensembles"
    - "new codes on graphs constructed by connecting spatially coupled chains"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"

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"
    - "density evolution for deterministic generalized product codes on the binary erasure channel at high rates"
    - "constant composition distribution matching"

Connected through hyperedge HE-6 (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"
    - "density evolution for deterministic generalized product codes with higher order modulation"
    - "on achievable rates for long haul fiber optic communications"
    - "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 "wave like decoding of tail biting spatially coupled ldpc codes through iterative demapping"):
  with members:
    - "spatially coupled ldpc codes constructed from protographs"
    - "triggering wave like convergence of tail biting spatially coupled ldpc codes"
    - "optimized bit mappings for spatially coupled ldpc codes over parallel binary erasure channels"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"
    - "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec"

Connected through hyperedge HE-8 (induced by source paper "construction of near capacity protograph ldpc code sequences with block error thresholds"):
  with members:
    - "spatially coupled ldpc codes constructed from protographs"
    - "protograph based raptor like ldpc codes"
    - "deterministic constructions for large girth protograph ldpc codes"
    - "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec"
    - "strong secrecy on the binary erasure wiretap channel using large girth 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)