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: "probabilistic signal shaping for bit metric decoding"
  Abstract: A scheme is proposed that combines probabilistic signal shaping with bit-metric decoding. The transmitter generates symbols according to a distribution on the channel input alphabet. The symbols are labeled by bit strings. At the receiver, the channel output is decoded with respect to a bit-metric. An achievable rate is derived using random coding arguments. For the 8-ASK AWGN channel, numerical results show that at a spectral efficiency of 2 bits/s/Hz, the new scheme outperforms bit-interleaved coded modulation (BICM) without shaping and BICM with bit shaping (i Fabregas and Martinez, 2010) by 0.87 dB and 0.15 dB, respectively, and is within 0.0094 dB of the coded modulation capacity. The new scheme is implemented by combining a distribution matcher with a systematic binary low-density parity-check code. The measured finite-length gains are very close to the gains predicted by the asymptotic theory.

Connected through hyperedge HE-1 (induced by source paper "achievable information rates for probabilistic amplitude shaping a minimum randomness approach via random sign coding arguments"):
  with members:
    - "information rates and error exponents for probabilistic amplitude shaping"
    - "achievable rates for probabilistic shaping"
    - "achievable rates for shaped bit metric decoding"

Connected through hyperedge HE-2 (induced by source paper "awgn goodness is enough capacity achieving lattice codes based on dithered probabilistic shaping"):
  with members:
    - "fundamental limits of communication with low probability of detection"
    - "covert communication over noisy channels a resolvability perspective"
    - "on probabilistic shaping of quadrature amplitude modulation for the nonlinear fiber channel"
    - "algebraic lattice codes achieve the capacity of the compound block fading channel"
    - "lda lattices without dithering achieve capacity on the gaussian channel"
    - "almost universal codes for fading wiretap channels"
    - "construction of capacity achieving lattice codes polar lattices"
    - "on the lattice smoothing parameter problem"

Connected through hyperedge HE-3 (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"
    - "improving soft fec performance for higher order modulations via optimized bit channel mappings"
    - "on the information loss of the max log approximation in bicm systems"
    - "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-4 (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"
    - "improving soft fec performance for higher order modulations via optimized bit channel mappings"
    - "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-5 (induced by source paper "protograph based ldpc code design for shaped bit metric decoding"):
  with members:
    - "triggering wave like convergence of tail biting spatially coupled ldpc codes single and dual channel setup"
    - "protograph based ldpc code design for bit metric decoding"
    - "constant composition distribution matching"
    - "optimized bit mappings for spatially coupled ldpc codes over parallel binary erasure channels"
    - "achievable rates for shaped bit metric decoding"
    - "deterministic constructions for large girth protograph ldpc codes"

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"
    - "improving soft fec performance for higher order modulations via optimized bit channel mappings"
    - "achievable rates for shaped bit metric decoding"

Connected through hyperedge HE-7 (induced by source paper "ldpc coded modulation with probabilistic shaping for optical fiber systems"):
  with members:
    - "constant composition distribution matching"
    - "arithmetic distribution matching"
    - "a pragmatic coded modulation scheme for high spectral efficiency fiber optic communications"
    - "staircase codes fec for 100 gb s otn"

Connected through hyperedge HE-8 (induced by source paper "achievable rates for shaped bit metric decoding"):
  with members:
    - "protograph based ldpc code design for shaped bit metric decoding"
    - "protograph based ldpc code design for bit metric decoding"
    - "theoretic shaping bounds for single letter constraints and mismatched decoding"
    - "an efficient algorithm to calculate bicm capacity"
    - "optimal alphabets and binary labelings for bicm at low snr"

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)