human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "capacity lower bounds of the noncentral chi channel with applications to soliton amplitude modulation"):
  Abstract: The channel law for amplitude-modulated solitons transmitted through a nonlinear optical fibre with ideal distributed amplification and a receiver based on the nonlinear Fourier transform is a noncentral chi-distribution with $2n$ degrees of freedom, where $n=2$ and $n=3$ correspond to the single- and dual-polarisation cases, respectively. In this paper, we study capacity lower bounds of this channel under an average power constraint in bits per channel use. We develop an asymptotic semi-analytic approximation for a capacity lower bound for arbitrary $n$ and a Rayleigh input distribution. It is shown that this lower bound grows logarithmically with signal-to-noise ratio (SNR), independently of the value of $n$. Numerical results for other continuous input distributions are also provided. A half-Gaussian input distribution is shown to give larger rates than a Rayleigh input distribution for $n=1,2,3$. At an SNR of $25$ dB, the best lower bounds we developed are approximately $3.68$ bit per channel use. The practically relevant case of amplitude shift-keying (ASK) constellations is also numerically analysed. For the same SNR of $25$ dB, a $16$-ASK constellation yields a rate of approximately $3.45$ bit per channel use.

Includes members:
  Member "performance prediction of nonbinary forward error correction in optical transmission experiments":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "achievable information rates for coded modulation with hard decision decoding for coherent fiber optic systems")
  Member "nonlinear frequency division multiplexing":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "nonlinear fourier transform of truncated multi soliton pulses")
  Member "nonlinear frequency division multiplexing in the focusing regime":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "linear and nonlinear frequency division multiplexing")
  Member "a lower bound on the per soliton capacity of the nonlinear optical fibre channel":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "linear and nonlinear frequency division multiplexing")
  Member "upper bound on the capacity of a cascade of nonlinear and noisy channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "nonlinearity mitigation in wdm systems models strategies and achievable rates")
  Member "fast numerical nonlinear fourier transforms":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a signal space distance measure for nondispersive optical fiber")
  Member "upper bound on the capacity of the nonlinear schr odinger channel":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a signal space distance measure for nondispersive optical fiber")
  Member "information transmission using the nonlinear fourier transform part ii numerical methods":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "polarization division multiplexing based on the nonlinear fourier transform")

Question: Please tell me which class the source paper 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)