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: "improving soft fec performance for higher order modulations via optimized bit channel mappings"
  Abstract: Soft forward error correction with higher-order modulations is often implemented in practice via the pragmatic bit-interleaved coded modulation paradigm, where a single binary code is mapped to a nonbinary modulation. In this paper, we study the optimization of the mapping of the coded bits to the modulation bits for a polarization-multiplexed fiber-optical system without optical inline dispersion compensation. Our focus is on protograph-based low-density parity-check (LDPC) codes which allow for an efficient hardware implementation, suitable for high-speed optical communications. The optimization is applied to the AR4JA protograph family, and further extended to protograph-based spatially coupled LDPC codes assuming a windowed decoder. Full field simulations via the split-step Fourier method are used to verify the analysis. The results show performance gains of up to 0.25 dB, which translate into a possible extension of the transmission reach by roughly up to 8%, without significantly increasing the system complexity.

Connected through hyperedge HE-1 (induced by source paper "optimization of bit mapping and quantized decoding for off the shelf protograph ldpc codes with application to ieee 802 3ca"):
  with members:
    - "achievable rates for probabilistic shaping"
    - "protograph based ldpc code design for shaped bit metric decoding"
    - "constant composition distribution matching"
    - "optimized bit mappings for spatially coupled ldpc codes over parallel binary erasure channels"
    - "staircase codes fec for 100 gb s otn"

Connected through hyperedge HE-2 (induced by source paper "advances in detection and error correction for coherent optical communications regular irregular and spatially coupled ldpc code designs"):
  with members:
    - "spatially coupled sparse codes on graphs theory and practice"
    - "on the convergence speed of spatially coupled ldpc ensembles"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"
    - "a pragmatic coded modulation scheme for high spectral efficiency fiber optic communications"
    - "windowed decoding of protograph based ldpc convolutional codes over erasure channels"
    - "staircase codes fec for 100 gb s otn"
    - "analysis and design of binary message passing decoders"
    - "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec"

Connected through hyperedge HE-3 (induced by source paper "density evolution for deterministic generalized product codes with higher order modulation"):
  with members:
    - "density evolution for deterministic generalized product codes on the binary erasure channel"
    - "a pragmatic coded modulation scheme for high spectral efficiency fiber optic communications"
    - "staircase codes fec for 100 gb s otn"

Connected through hyperedge HE-4 (induced by source paper "replacing the soft fec limit paradigm in the design of optical communication systems"):
  with members:
    - "four dimensional coded modulation with bit wise decoders for future optical communications"
    - "high snr asymptotics of mutual information for discrete constellations with applications to bicm"
    - "on the information loss of the max log approximation in bicm systems"
    - "probabilistic signal shaping for bit metric decoding"
    - "achievable rates for four dimensional coded modulation with a bit wise receiver"
    - "on the exact ber of bit wise demodulators for one dimensional constellations"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"
    - "optimal alphabets and binary labelings for bicm at low snr"

Connected through hyperedge HE-5 (induced by source paper "four dimensional coded modulation with bit wise decoders for future optical communications"):
  with members:
    - "high snr asymptotics of mutual information for discrete constellations with applications to bicm"
    - "probabilistic signal shaping for bit metric decoding"
    - "design of apsk constellations for coherent optical channels with nonlinear phase noise"
    - "signal shaping for bicm at low snr"
    - "general ber expression for one dimensional constellations"
    - "a pragmatic coded modulation scheme for high spectral efficiency fiber optic communications"
    - "calculation of mutual information for partially coherent gaussian channels with applications to fiber optics"
    - "optimal alphabets and binary labelings for bicm at low snr"

Connected through hyperedge HE-6 (induced by source paper "protograph based ldpc code design for bit metric decoding"):
  with members:
    - "constant composition distribution matching"
    - "optimized bit mappings for spatially coupled ldpc codes over parallel binary erasure channels"
    - "achievable rates for shaped bit metric decoding"
    - "probabilistic signal shaping for bit metric decoding"

Connected through hyperedge HE-7 (induced by source paper "terminated and tailbiting spatially coupled codes with optimized bit mappings for spectrally efficient fiber optical systems"):
  with members:
    - "a pragmatic coded modulation scheme for high spectral efficiency fiber optic communications"
    - "windowed decoding of protograph based ldpc convolutional codes over erasure channels"
    - "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"
    - "awgn channel analysis of terminated ldpc convolutional 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)