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: "on the dirty paper channel with fast fading dirt"
  Abstract: Costa`s "writing on dirty paper" result establishes that full state pre-cancellation can be attained in the Gel`fand-Pinsker problem with additive state and additive white Gaussian noise. This result holds under the assumptions that full channel knowledge is available at both the transmitter and the receiver. In this work we consider the scenario in which the state is multiplied by an ergodic fading process which is not known at the encoder. We study both the case in which the receiver has knowledge of the fading and the case in which it does not: for both models we derive inner and outer bounds to capacity and determine the distance between the two bounds when possible. For the channel without fading knowledge at either the transmitter or the receiver, the gap between inner and outer bounds is finite for a class of fading distributions which includes a number of canonical fading models. In the capacity approaching strategy for this class, the transmitter performs Costa`s pre-coding against the mean value of the fading times the state while the receiver treats the remaining signal as noise. For the case in which only the receiver has knowledge of the fading, we determine a finite gap between inner and outer bounds for two classes of discrete fading distribution. The first class of distributions is the one in which there exists a probability mass larger than one half while the second class is the one in which the fading is uniformly distributed over values that are exponentially spaced apart. Unfortunately, the capacity in the case of a continuous fading distribution remains very hard to characterize.

Connected through hyperedge HE-1 (induced by source paper "ergodic fading mimo dirty paper and broadcast channels capacity bounds and lattice strategies"):
  with members:
    - "the two user gaussian fading broadcast channel"
    - "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"
    - "on the fading paper achievable region of the fading mimo broadcast channel"

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)