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 "the impact of phase fading on the dirty paper channel"):
  Abstract: The impact of phase fading on the classical Costa dirty paper coding channel is studied. We consider a variation of this channel model in which the amplitude of the interference sequence is known at the transmitter while its phase is known at the receiver. Although the capacity of this channel has already been established, it is expressed using an auxiliary random variable and as the solution of a maximization problem. To circumvent the difficulty evaluating capacity, we derive alternative inner and outer bounds and show that the two expressions are to within a finite distance. This provide an approximate characterization of the capacity which depends only on the channel parameters. We consider, in particular, two distributions of the phase fading: circular binomial and circular uniform. The first distribution models the scenario in which the transmitter has a minimal uncertainty over the phase of the interference while the second distribution models complete uncertainty. For circular binomial fading, we show that binning with Gaussian signaling still approaches capacity, as in the channel without phase fading. In the case of circular uniform fading, instead, binning with Gaussian signaling is no longer effective and novel interference avoidance strategies are developed to approach capacity.

Includes members:
  Member "an upper bound on the capacity of vector dirty paper with unknown spin and stretch":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the dirty paper channel with fast fading dirt")
  Member "on the fading paper achievable region of the fading mimo broadcast channel":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "ergodic fading mimo dirty paper and broadcast channels capacity bounds and lattice strategies")
  Member "duality between channel capacity and rate distortion with two sided state information":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "variable length source dispersions differ under maximum and average error criteria")
  Member "carbon copying onto dirty paper":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the capacity of the carbon copy onto dirty paper channel")

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)