human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "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.

Connected through hyperedge HE-1 (induced by source paper "on the capacity of the carbon copy onto dirty paper channel"):
  with members:
    - "on capacity of the dirty paper channel with fading dirt in the strong fading regime"
    - "is non unique decoding necessary"
    - "an achievability scheme for the compound channel with state noncausally available at the encoder"
    - "on the capacity of compound state dependent channels with states known at the transmitter"
    - "dirty paper coding for fading channels with partial transmitter side information"
    - "writing on dirty paper with resizing and its application to quasi static fading broadcast channels"
    - "carbon copying onto dirty paper"
    - "capacity and random coding exponents for channel coding with side information"

Connected through hyperedge HE-2 (induced by source paper "on the capacity of the dirty paper channel with fast fading and discrete channel states"):
  with members:
    - "on capacity of the dirty paper channel with fading dirt in the strong fading regime"
    - "aligned image sets under channel uncertainty settling a conjecture by lapidoth shamai and wigger on the collapse of degrees of freedom under finite precision csit"
    - "the two user gaussian interference channel a deterministic view"
    - "writing on dirty paper with resizing and its application to quasi static fading broadcast channels"
    - "carbon copying onto dirty paper"

Connected through hyperedge HE-3 (induced by source paper "the carbon copy onto dirty paper channel with statistically equivalent states"):
  with members:
    - "an achievability scheme for the compound channel with state noncausally available at the encoder"
    - "carbon copying onto dirty paper"

Connected through hyperedge HE-4 (induced by source paper "on the dirty paper channel with fast fading dirt"):
  with members:
    - "on capacity of the dirty paper channel with fading dirt in the strong fading regime"
    - "an upper bound on the capacity of vector dirty paper with unknown spin and stretch"
    - "writing on dirty paper with resizing and its application to quasi static fading broadcast channels"
    - "carbon copying onto dirty paper"

Question: Please tell me which class the center node 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)