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: "optimal alphabets and binary labelings for bicm at low snr"
  Abstract: Optimal binary labelings, input distributions, and input alphabets are analyzed for the so-called bit-interleaved coded modulation (BICM) capacity, paying special attention to the low signal-to-noise ratio (SNR) regime. For 8-ary pulse amplitude modulation (PAM) and for 0.75 bit/symbol, the folded binary code results in a higher capacity than the binary reflected Gray code (BRGC) and the natural binary code (NBC). The 1 dB gap between the additive white Gaussian noise (AWGN) capacity and the BICM capacity with the BRGC can be almost completely removed if the input symbol distribution is properly selected. First-order asymptotics of the BICM capacity for arbitrary input alphabets and distributions, dimensions, mean, variance, and binary labeling are developed. These asymptotics are used to define first-order optimal (FOO) constellations for BICM, i.e., constellations that make BICM achieve the Shannon limit -1.59 dB. It is shown that the Eb/N0 required for reliable transmission at asymptotically low rates in BICM can be as high as infinity, that for uniform input distributions and 8-PAM there are only 72 classes of binary labelings with a different first-order asymptotic behavior, and that this number is reduced to only 26 for 8-ary phase shift keying (PSK). A general answer to the question of FOO constellations for BICM is also given: using the Hadamard transform, it is found that for uniform input distributions, a constellation for BICM is FOO if and only if it is a linear projection of a hypercube. A constellation based on PAM or quadrature amplitude modulation input alphabets is FOO if and only if they are labeled by the NBC; if the constellation is based on PSK input alphabets instead, it can never be FOO if the input alphabet has more than four points, regardless of the labeling.

Connected through hyperedge HE-1 (induced by source paper "multidimensional constellations for uplink scma systems a comparative study"):
  with members:
    - "survey on multi access edge computing for internet of things realization"
    - "low complexity receiver for uplink scma system via expectation propagation"
    - "a survey on non orthogonal multiple access for 5g networks research challenges and future trends"
    - "modulation and multiple access for 5g networks"
    - "an optimization perspective of the superiority of noma compared to conventional oma"
    - "polar codes for scma systems"
    - "a survey on low latency towards 5g ran core network and caching solutions"
    - "design of non orthogonal multiple access enhanced backscatter communication"

Connected through hyperedge HE-2 (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"
    - "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"

Connected through hyperedge HE-3 (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"
    - "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"

Connected through hyperedge HE-4 (induced by source paper "conditions for a monotonic channel capacity"):
  with members:
    - "capacity of a nonlinear optical channel with finite memory"
    - "calculation of mutual information for partially coherent gaussian channels with applications to fiber optics"
    - "lecture notes on network information theory"
    - "the noncoherent rician fading channel part i structure of the capacity achieving input"

Connected through hyperedge HE-5 (induced by source paper "high snr asymptotics of mutual information for discrete constellations with applications to bicm"):
  with members:
    - "signal shaping for bicm at low snr"
    - "on the exact ber of bit wise demodulators for one dimensional constellations"
    - "general ber expression for one dimensional constellations"
    - "multiple antenna fading coherent channels with arbitrary inputs characterization and optimization of the reliable information transmission rate"
    - "precoding for outage probability minimization on block fading channels"
    - "mutual information and minimum mean square error in gaussian channels"

Connected through hyperedge HE-6 (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"
    - "probabilistic signal shaping for bit metric decoding"
    - "theoretic shaping bounds for single letter constraints and mismatched decoding"
    - "an efficient algorithm to calculate bicm capacity"

Connected through hyperedge HE-7 (induced by source paper "probabilistic signal shaping for bit metric decoding"):
  with members:
    - "arithmetic distribution matching"
    - "an efficient algorithm to calculate bicm capacity"
    - "operating ldpc codes with zero shaping gap"
    - "constellation shaping for bit interleaved ldpc coded apsk"

Connected through hyperedge HE-8 (induced by source paper "constellation optimization in the presence of strong phase noise"):
  with members:
    - "design of apsk constellations for coherent optical channels with nonlinear phase noise"
    - "soft metrics and their performance analysis for optimal data detection in the presence of strong oscillator phase noise"
    - "constellation design for channels affected by phase noise"

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)