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 fading paper achievable region of the fading mimo broadcast channel"
  Abstract: We consider transmission over the ergodic fading multi-antenna broadcast (MIMO-BC) channel with partial channel state information at the transmitter and full information at the receiver. Over the equivalent {\it non}-fading channel, capacity has recently been shown to be achievable using transmission schemes that were designed for the ``dirty paper'' channel. We focus on a similar ``fading paper'' model. The evaluation of the fading paper capacity is difficult to obtain. We confine ourselves to the {\it linear-assignment} capacity, which we define, and use convex analysis methods to prove that its maximizing distribution is Gaussian. We compare our fading-paper transmission to an application of dirty paper coding that ignores the partial state information and assumes the channel is fixed at the average fade. We show that a gain is easily achieved by appropriately exploiting the information. We also consider a cooperative upper bound on the sum-rate capacity as suggested by Sato. We present a numeric example that indicates that our scheme is capable of realizing much of this upper bound.

Connected through hyperedge HE-1 (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"
    - "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"

Connected through hyperedge HE-2 (induced by source paper "on capacity of the writing onto fast fading dirt channel"):
  with members:
    - "on capacity of the dirty paper channel with fading dirt in the strong fading regime"
    - "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 "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"
    - "dirty paper coding for fading channels with partial transmitter side information"
    - "statistical eigenmode transmission over jointly correlated mimo channels"
    - "dirty paper coding without channel information at the transmitter and imperfect estimation at the receiver"

Connected through hyperedge HE-4 (induced by source paper "the impact of phase fading on the dirty paper channel"):
  with members:
    - "an upper bound on the capacity of vector dirty paper with unknown spin and stretch"
    - "duality between channel capacity and rate distortion with two sided state information"
    - "carbon copying onto dirty paper"

Connected through hyperedge HE-5 (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"
    - "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"

Connected through hyperedge HE-6 (induced by source paper "improved transmission strategies for cognitive radio under the coexistence constraint"):
  with members:
    - "interference alignment and neutralization in a cognitive 3 user mac interference channel degrees of freedom"
    - "cognitive radio with partial channel state information at the transmitter"
    - "interference mitigation through limited receiver cooperation"
    - "capacity gain from two transmitter and two receiver cooperation"
    - "cognitive radio an information theoretic perspective"

Connected through hyperedge HE-7 (induced by source paper "worst case expected capacity loss of slow fading channels"):
  with members:
    - "secret writing on dirty paper a deterministic view"
    - "writing on dirty paper with resizing and its application to quasi static fading broadcast channels"
    - "gaussian interference channel capacity to within one bit"
    - "writing on fading paper and causal transmitter csi"

Connected through hyperedge HE-8 (induced by source paper "prescient precoding in heterogeneous dsa networks with both underlay and interweave mimo cognitive radios"):
  with members:
    - "beamforming and rate allocation in miso cognitive radio networks"
    - "cognitive radio with partial channel state information at the transmitter"
    - "dirty paper coding for the mimo cognitive radio channel with imperfect csit"
    - "cooperative multi cell block diagonalization with per base station power constraints"
    - "exploiting multi antennas for opportunistic spectrum sharing in cognitive radio networks"
    - "spectrum sensing algorithms for cognitive radio based on statistical covariances"
    - "cognitive radio an information theoretic perspective"

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)