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 achieving input distributions in nondispersive optical fibers"):
  Abstract: This paper investigates the discrete-time per-sample model of the zero-dispersion optical fiber. It is shown that any capacity-achieving input distribution has (continuous) uniform phase and discrete amplitude with a finite number of mass points. This result holds when the input is subject to general input cost constraints that include peak power constraint and joint average and peak power constraint.

Includes members:
  Member "on properties of the support of capacity achieving distributions for additive noise channel models with input cost constraints":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "information measures inequalities and performance bounds for parameter estimation in impulsive noise environments")
  Member "on the finiteness of the capacity of continuous channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on properties of the support of capacity achieving distributions for additive noise channel models with input cost constraints")
  Member "the asymptotic capacity of the optical fiber":
    also connected through other hyperedges:
      (none)
  Member "upper bound on the capacity of a cascade of nonlinear and noisy channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "nonlinearity mitigation in wdm systems models strategies and achievable rates")
  Member "information theoretic proofs of entropy power inequalities":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "vector gaussian successive refinement with degraded side information")
  Member "the noncoherent rician fading channel part i structure of the capacity achieving input":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a simple capacity lower bound for communication with superimposed pilots")

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)