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: "high snr asymptotics of mutual information for discrete constellations with applications to bicm"
  Abstract: Asymptotic expressions of the mutual information between any discrete input and the corresponding output of the scalar additive white Gaussian noise channel are presented in the limit as the signal-to-noise ratio (SNR) tends to infinity. Asymptotic expressions of the symbol-error probability (SEP) and the minimum mean-square error (MMSE) achieved by estimating the channel input given the channel output are also developed. It is shown that for any input distribution, the conditional entropy of the channel input given the output, MMSE, and SEP have an asymptotic behavior proportional to the Gaussian Q-function. The argument of the Q-function depends only on the minimum Euclidean distance (MED) of the constellation and the SNR, and the proportionality constants are functions of the MED and the probabilities of the pairs of constellation points at MED. The developed expressions are then generalized to study the high-SNR behavior of the generalized mutual information (GMI) for bit-interleaved coded modulation (BICM). By means of these asymptotic expressions, the long-standing conjecture that Gray codes are the binary labelings that maximize the BICM-GMI at high SNR is proven. It is further shown that for any equally spaced constellation whose size is a power of two, there always exists an anti-Gray code giving the lowest BICM-GMI at high SNR.

Connected through hyperedge HE-1 (induced by source paper "introducing enumerative sphere shaping for optical communication systems with short blocklengths"):
  with members:
    - "exploring and experimenting with shaping designs for next generation optical communications"
    - "divergence optimal fixed to fixed length distribution matching with shell mapping"
    - "experimental verification of rate flexibility and probabilistic shaping by 4d signaling"
    - "increasing achievable information rates via geometric shaping"
    - "experimental comparison of probabilistic shaping methods for unrepeated fiber transmission"
    - "a survey on fiber nonlinearity compensation for 400 gb s and beyond optical communication systems"
    - "comparison of geometric and probabilistic shaping with application to atsc 3 0"
    - "on probabilistic shaping of quadrature amplitude modulation for the nonlinear fiber channel"

Connected through hyperedge HE-2 (induced by source paper "asymptotic comparison of ml and map detectors for multidimensional constellations"):
  with members:
    - "on the exact ber of bit wise demodulators for one dimensional constellations"
    - "constellation shaping for bit interleaved ldpc coded apsk"

Connected through hyperedge HE-3 (induced by source paper "a survey on mimo transmission with discrete input signals technical challenges advances and future trends"):
  with members:
    - "asymptotic performance analysis of a k hop amplify and forward relay mimo channel"
    - "iterative distributed minimum total mse approach for secure communications in mimo interference channels"
    - "asymptotic analysis of su mimo channels with transmitter noise and mismatched joint decoding"
    - "secure massive mimo transmission with an active eavesdropper"
    - "interference aligned space time transmission with diversity for the 2 times 2 x network"
    - "space time encoded miso broadcast channel with outdated csit an error rate and diversity performance analysis"
    - "differential distributed space time coding with imperfect synchronization in frequency selective channels"
    - "what will 5g be"

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"
    - "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"
    - "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:
    - "improving soft fec performance for higher order modulations via optimized bit channel mappings"
    - "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 "comparison of the achievable rates in ofdm and single carrier modulation with i i d inputs"):
  with members:
    - "lower bounds and approximations for the information rate of the isi channel"
    - "comparison of ofdm and sc dfe capacities without channel knowledge at the transmitter"
    - "easily computed lower bounds on the information rate of intersymbol interference channels"
    - "spatially coupled codes and threshold saturation on intersymbol interference channels"
    - "estimation in gaussian noise properties of the minimum mean square error"
    - "hessian and concavity of mutual information differential entropy and entropy power in linear vector gaussian channels"
    - "mutual information and minimum mean square error in gaussian channels"

Connected through hyperedge HE-7 (induced by source paper "on discrete alphabets for the two user gaussian interference channel with one receiver lacking knowledge of the interfering codebook"):
  with members:
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-8 (induced by source paper "precoding for outage probability minimization on block fading channels"):
  with members:
    - "low density graph codes for coded cooperation on slow fading relay channels"
    - "precoding by pairing subchannels to increase mimo capacity with discrete input alphabets"
    - "mimo precoding with x and y codes"
    - "space time coding techniques with bit interleaved coded modulations for mimo block fading channels"
    - "mutual information and minimum mean square error in gaussian channels"

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)