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 "cognitive radio with partial channel state information at the transmitter"):
  Abstract: In this paper, we present the design of cognitive radio in the Rician channel with partial channel state information at the transmitter (CSIT). We replace the dirty paper coding (DPC) used in the cognitive radio with full CSIT by the linear assignment Gel'fand-Pinsker coding (LA-GPC) which can achieve better error performance when there is only partial CSIT. Based on the achievable rate derived from the LA-GPC, two optimization problems under the fast and slow fading channels are formulated. We derive semi-analytical solutions to find the relaying ratios and precoding coefficients. We also show that the parameters derived by the proposed methods converge to the optimal full CSIT solutions in the asymptotic cases. This result verifies the correctness of the proposed methods asymptotically. Moreover, a new coding scheme is proposed to implement the LA-GPC in practice. Simulation results show that the proposed semi-analytical solutions perform close to the optimal solutions found by brute-force search, and outperform the systems based on naive DPC. Simulation results also show that the proposed practical coding scheme can effectively approach the theoretical rate performance.

Includes members:
  Member "dirty paper coding for the mimo cognitive radio channel with imperfect csit":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "prescient precoding in heterogeneous dsa networks with both underlay and interweave mimo cognitive radios")
  Member "on the achievable rate of the fading dirty paper channel with imperfect csit":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the fast fading multiple antenna gaussian broadcast channel with confidential messages and partial csit")
  Member "writing on dirty paper with resizing and its application to quasi static fading broadcast channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the capacity of the carbon copy onto dirty paper channel")
  Member "on the fading paper achievable region of the fading mimo broadcast channel":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "ergodic fading mimo dirty paper and broadcast channels capacity bounds and lattice strategies")
  Member "cognitive radio an information theoretic perspective":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "cognitive radio networks an information theoretic perspective")

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)