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: "dirty paper coding for fading channels with partial transmitter side information"
  Abstract: The problem of Dirty Paper Coding (DPC) over the Fading Dirty Paper Channel (FDPC) Y = H(X + S)+Z, a more general version of Costa's channel, is studied for the case in which there is partial and perfect knowledge of the fading process H at the transmitter (CSIT) and the receiver (CSIR), respectively. A key step in this problem is to determine the optimal inflation factor (under Costa's choice of auxiliary random variable) when there is only partial CSIT. Towards this end, two iterative numerical algorithms are proposed. Both of these algorithms are seen to yield a good choice for the inflation factor. Finally, the high-SNR (signal-to-noise ratio) behavior of the achievable rate over the FDPC is dealt with. It is proved that FDPC (with t transmit and r receive antennas) achieves the largest possible scaling factor of min(t,r) log SNR even with no CSIT. Furthermore, in the high SNR regime, the optimality of Costa's choice of auxiliary random variable is established even when there is partial (or no) CSIT in the special case of FDPC with t <= r. Using the high-SNR scaling-law result of the FDPC (mentioned before), it is shown that a DPC-based multi-user transmission strategy, unlike other beamforming-based multi-user strategies, can achieve a single-user sum-rate scaling factor over the multiple-input multiple-output Gaussian Broadcast Channel with partial (or no) CSIT.

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"
    - "the impact of phase fading on the dirty paper channel"
    - "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"
    - "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 "ergodic fading mimo dirty paper and broadcast channels capacity bounds and lattice strategies"):
  with members:
    - "on the dirty paper channel with fast fading dirt"
    - "the two user gaussian fading broadcast channel"
    - "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"

Connected through hyperedge HE-3 (induced by source paper "transmit designs for the mimo broadcast channel with statistical csi"):
  with members:
    - "linear mimo precoding in jointly correlated fading multiple access channels with finite alphabet signaling"
    - "linear precoder design for mimo interference channels with finite alphabet signaling"
    - "linear beamforming for the spatially correlated miso broadcast channel"
    - "statistical eigenmode transmission over jointly correlated mimo channels"
    - "dirty paper coding without channel information at the transmitter and imperfect estimation at the receiver"
    - "on the fading paper achievable region of the fading mimo broadcast channel"

Connected through hyperedge HE-4 (induced by source paper "relay channel with orthogonal components and structured interference known at the source"):
  with members:
    - "bounds on the capacity of the relay channel with noncausal state at source"
    - "structured interference mitigation in two hop networks"
    - "capacity bounds and exact results for the cognitive z interference channel"
    - "bounds on the capacity of the relay channel with noncausal state information at source"
    - "lecture notes on network information theory"
    - "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"

Connected through hyperedge HE-5 (induced by source paper "filter and nested lattice code design for mimo fading channels with side information"):
  with members:
    - "on the achievable rate of the fading dirty paper channel with imperfect csit"
    - "writing on dirty paper with resizing and its application to quasi static fading broadcast channels"
    - "a lattice based mimo broadcast precoder for multi stream transmission"
    - "on the fading paper achievable region of the fading mimo broadcast channel"
    - "shannon meets wiener ii on mmse estimation in successive decoding schemes"

Connected through hyperedge HE-6 (induced by source paper "a large system analysis of the imperfect csit gaussian broadcast channel with a dpc based transmission strategy"):
  with members:
    - "on the achievable rate of the fading dirty paper channel with imperfect csit"
    - "the degrees of freedom regions of mimo broadcast interference and cognitive radio channels with no csit"
    - "mimo broadcast channels with finite rate feedback"

Connected through hyperedge HE-7 (induced by source paper "dirty paper coding for the mimo cognitive radio channel with imperfect csit"):
  with members:
    - "on the achievable rate of the fading dirty paper channel with imperfect csit"
    - "on the capacity of a class of mimo cognitive radios"
    - "adaptive sum power iterative waterfilling for mimo cognitive radio channels"
    - "cognitive radio an information theoretic perspective"

Connected through hyperedge HE-8 (induced by source paper "on the achievable rate of the fading dirty paper channel with imperfect csit"):
  with members:
    - "duality between channel capacity and rate distortion with two sided state information"

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)