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 "on capacity of the writing onto fast fading dirt channel"):
  Abstract: The classic Costa's "writing on dirty paper" capacity result establishes that full state pre-cancellation can be attained in the Gel'fand-Pinsker channel with additive state and additive Gaussian noise. This result holds under the assumption that perfect channel knowledge is available at both transmitter and receiver: such an assumption is not valid in wireless scenarios affected by fading and with limited feedback rates. For this reason, we investigate the capacity of the "writing on fast fading dirt" channel, a variation of the "writing on dirty paper" channel in which the state sequence is multiplied by an ergodic fading process unknown at the transmitter. We consider two scenarios: when the fading process in not known at either the transmitter or the receiver and when it is known only at the receiver. For both cases we derive novel assessments of capacity which clearly indicate the limits of state pre-cancellation in the presence of fast fading.

Includes members:
  Member "on capacity of the dirty paper channel with fading dirt in the strong fading regime":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the capacity of the carbon copy onto dirty paper channel")
  Member "the two user gaussian interference channel a deterministic view":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "dof region of the decentralized mimo broadcast channel unicode x2014 how many informed antennas do we need")
  Member "writing on dirty paper with resizing and its application to quasi static fading broadcast channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the capacity of the carbon copy onto dirty paper channel")
  Member "on the fading paper achievable region of the fading mimo broadcast channel":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "ergodic fading mimo dirty paper and broadcast channels capacity bounds and lattice strategies")
  Member "carbon copying onto dirty paper":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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)