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: "transmission of information via the non linear scroedinger equation the random gaussian input case"
  Abstract: The explosion of demand for ultra-high information transmission rates over the last decade has necessitated the usage of increasingly high light intensities for fiber optical transmissions. As a result, the fiber non-linearities need to be treated non-perturbatively. Similar analyses in the past have focused on the effects of non-linearities on existing transmission technologies, e.g. WDM. In this paper we take advantage of the fact that, under certain assumptions, light transmission through optical fibers can be described using the non-linear Schroedinger equation, which is exactly integrable. As a particular example, we show that in the low Gaussian noise limit, the Gaussian input distribution has a higher mutual information than the transmission using WDM over the same available bandwidth.

Connected through hyperedge HE-1 (induced by source paper "the asymptotic capacity of the optical fiber"):
  with members:
    - "nonlinear frequency division multiplexing"
    - "models and information rates for multiuser optical fiber channels with nonlinearity and dispersion"
    - "conditions for a monotonic channel capacity"
    - "upper bound on the capacity of a cascade of nonlinear and noisy channels"
    - "upper bound on the capacity of the nonlinear schr odinger channel"
    - "information transmission using the nonlinear fourier transform part ii numerical methods"
    - "information transmission using the nonlinear fourier transform part i mathematical tools"
    - "information transmission using the nonlinear fourier transform part iii spectrum modulation"

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)