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 the capacity of the carbon copy onto dirty paper channel"):
  Abstract: The "Carbon Copy onto Dirty Paper" (CCDP) channel is the compound "writing on dirty paper" channel in which the channel output is obtained as the sum of the channel input, white Gaussian noise and a Gaussian state sequence randomly selected among a set possible realizations. The transmitter has non-causal knowledge of the set of possible state sequences but does not know which sequence is selected to produce the channel output. We study the capacity of the CCDP channel for two scenarios: (i) the state sequences are independent and identically distributed, and (ii) the state sequences are scaled versions of the same sequence. In the first scenario, we show that a combination of superposition coding, time-sharing and Gel'fand-Pinsker binning is sufficient to approach the capacity to within three bits per channel use for any number of possible state realizations. In the second scenario, we derive capacity to within four bits-per-channel-use for the case of two possible state sequences. This result is extended to the CCDP channel with any number of possible state sequences under certain conditions on the scaling parameters which we denote as "strong fading" regime. We conclude by providing some remarks on the capacity of the CCDP channel in which the state sequences have any jointly Gaussian distribution.

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 dirty paper channel with fast fading and discrete channel states")
  Member "the impact of phase fading on the dirty paper channel":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the capacity of the dirty paper channel with fast fading and discrete channel states")
  Member "is non unique decoding necessary":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "harnessing correlations in distributed erasure coded key value stores")
  Member "an achievability scheme for the compound channel with state noncausally available at the encoder":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "polar codes for broadcast channels with receiver message side information and noncausal state available at the encoder")
  Member "on the capacity of compound state dependent channels with states known at the transmitter":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "asynchronous transmission over single user state dependent channels")
  Member "dirty paper coding for fading channels with partial transmitter side information":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "ergodic fading mimo dirty paper and broadcast channels capacity bounds and lattice strategies")
  Member "writing on dirty paper with resizing and its application to quasi static fading broadcast channels":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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-8 (induced by source paper "on the capacity of the dirty paper channel with fast fading and discrete channel states")

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)