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: "comparison of geometric and probabilistic shaping with application to atsc 3 0"
  Abstract: In this work, geometric shaping (GS) and probabilistic shaping (PS) for the AWGN channel is reviewed. Both approaches are investigated in terms of symbol-metric decoding (SMD) and bit-metric decoding (BMD). For GS, an optimization algorithm based on differential evolution is formulated. Achievable rate analysis reveals that GS suffers from a 0.4 dB performance degradation compared to PS when BMD is used. Forward-error correction simulations of the ATSC 3.0 modulation and coding formats (modcods) confirm the theoretical findings. In particular, PS enables seamless rate adaptation with one single modcod and it outperforms ATSC 3.0 GS modcods by more than 0.5 dB for spectral efficiencies larger than 3.2 bits per channel use.

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"
    - "on probabilistic shaping of quadrature amplitude modulation for the nonlinear fiber channel"
    - "constellation shaping for wdm systems using 256qam 1024qam with probabilistic optimization"

Connected through hyperedge HE-2 (induced by source paper "efficient error correcting codes in the short blocklength regime"):
  with members:
    - "low complexity joint channel estimation and list decoding of short codes"
    - "low latency short packet transmissions fixed length or harq"
    - "design of polar codes in 5g new radio"
    - "joint design of convolutional code and crc under serial list viterbi decoding"
    - "on the error probability of short concatenated polar and cyclic codes with interleaving"
    - "short packets over block memoryless fading channels pilot assisted or noncoherent transmission"
    - "polar code construction for list decoding"
    - "ultra sparse non binary ldpc codes for probabilistic amplitude shaping"

Connected through hyperedge HE-3 (induced by source paper "a compressed sensing approach for distribution matching"):
  with members:
    - "approximate message passing decoder and capacity achieving sparse superposition codes"
    - "capacity achieving sparse superposition codes via approximate message passing decoding"
    - "universal sparse superposition codes with spatial coupling and gamp decoding"
    - "generalized approximate message passing decoder for universal sparse superposition codes"
    - "threshold saturation of spatially coupled sparse superposition codes for all memoryless channels"
    - "proof of threshold saturation for spatially coupled sparse superposition codes"
    - "approximate message passing with spatially coupled structured operators with applications to compressed sensing and sparse superposition codes"
    - "constant composition distribution matching"

Connected through hyperedge HE-4 (induced by source paper "information rates and error exponents for probabilistic amplitude shaping"):
  with members:
    - "achievable rates for probabilistic shaping"
    - "optimal quantization for distribution synthesis"
    - "on probabilistic shaping of quadrature amplitude modulation for the nonlinear fiber channel"
    - "constant composition distribution matching"
    - "informational divergence and entropy rate on rooted trees with probabilities"

Connected through hyperedge HE-5 (induced by source paper "a mismatched joint source channel coding perspective of probabilistic amplitude shaping achievable rates and error exponents"):
  with members:
    - "achievable rates for probabilistic shaping"
    - "optimal quantization for distribution synthesis"
    - "on probabilistic shaping of quadrature amplitude modulation for the nonlinear fiber channel"
    - "constant composition distribution matching"

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)