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 "impact of 4d channel distribution on the achievable rates in coherent optical communication experiments"):
  Abstract: We experimentally investigate mutual information and generalized mutual information for coherent optical transmission systems. The impact of the assumed channel distribution on the achievable rate is investigated for distributions in up to four dimensions. Single channel and wavelength-division multiplexing (WDM) transmission over transmission links with and without inline dispersion compensation are studied. We show that for conventional WDM systems without inline dispersion compensation, a circularly symmetric complex Gaussian distribution is a good approximation of the channel. For other channels, such as with inline dispersion compensation, this is no longer true and gains in the achievable information rate are obtained by considering more sophisticated four-dimensional (4D) distributions. We also show that for nonlinear channels, gains in the achievable information rate can also be achieved by estimating the mean values of the received constellation in four dimensions. The highest gain for such channels is seen for a 4D correlated Gaussian distribution.

Includes members:
  Member "upper bound on the capacity of a cascade of nonlinear and noisy channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "nonlinearity mitigation in wdm systems models strategies and achievable rates")
  Member "on achievable rates for long haul fiber optic communications":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "nonlinearity mitigation in wdm systems models strategies and achievable rates")
  Member "four dimensional coded modulation with bit wise decoders for future optical communications":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "introducing enumerative sphere shaping for optical communication systems with short blocklengths")
  Member "capacity of a nonlinear optical channel with finite memory":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the log log growth of channel capacity for nondispersive nonlinear optical fiber channel in intermediate power range extension of the model")
  Member "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "reed muller codes theory and algorithms")

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)