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 dirty paper channel with fading dirt in the strong fading regime"):
  Abstract: The classical writing on dirty paper capacity result establishes that full interference pre-cancellation can be attained in Gelfand-Pinsker problem with additive state and additive white Gaussian noise. This result holds under the idealized assumption that perfect channel knowledge is available at both transmitter and receiver. While channel knowledge at the receiver can be obtained through pilot tones, transmitter channel knowledge is harder to acquire. For this reason, we are interested in characterizing the capacity under the more realistic assumption that only partial channel knowledge is available at the transmitter. We study, more specifically, the dirty paper channel in which the interference sequence in multiplied by fading value unknown to the transmitter but known at the receiver. For this model, we establish an approximate characterization of capacity for the case in which fading values vary greatly in between channel realizations. In this regime, which we term the strong fading regime, the capacity pre-log factor is equal to the inverse of the number of possible fading realizations.

Includes members:
  Member "on the capacity of compound state dependent channels with states known at the transmitter":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the capacity of the carbon copy onto dirty paper channel")
  Member "writing on dirty paper with resizing and its application to quasi static fading broadcast channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the capacity of the carbon copy onto dirty paper channel")
  Member "carbon copying onto dirty paper":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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)