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 "conditions for a monotonic channel capacity"):
  Abstract: Motivated by results in optical communications, where the performance can degrade dramatically if the transmit power is sufficiently increased, the channel capacity is characterized for various kinds of memoryless vector channels. It is proved that for all static point-to-point channels, the channel capacity under an equal-power constraint is a nondecreasing function of power. As a consequence, maximizing the mutual information over all input distributions with a certain power is for such channels equivalent to maximizing it over the larger set of input distributions with upperbounded power. The channel coding theorem is formally proved for an equal-power constraint. For interference channels such as optical wavelength-division multiplexing systems, the primary channel capacity is always nondecreasing with power if all interferers transmit with identical distributions as the primary user. Also, if all input distributions in an interference channel are optimized jointly, then the achievable sum-rate capacity is again nondecreasing. The results generalize to the channel capacity as a function of a wide class of costs, not only power.

Includes members:
  Member "capacity of a nonlinear optical channel with finite memory":
    also connected through other hyperedges:
      - Hyperedge HE-1 (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 "calculation of mutual information for partially coherent gaussian channels with applications to fiber optics":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "models and information rates for wiener phase noise channels")
  Member "optimal alphabets and binary labelings for bicm at low snr":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "multidimensional constellations for uplink scma systems a comparative study")
  Member "lecture notes on network information theory":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the required number of antennas in a point to point large but finite mimo system outage limited scenario")
  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)