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: "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.

Connected through hyperedge HE-1 (induced by source paper "practical design for multiple antenna cognitive radio networks with coexistence constraint"):
  with members:
    - "cooperative cognitive networks optimal distributed and low complexity algorithms"
    - "improved transmission strategies for cognitive radio under the coexistence constraint"
    - "inner and outer bounds for the gaussian cognitive interference channel and new capacity results"
    - "optimal and robust transmit designs for miso channel secrecy by semidefinite programming"
    - "exploiting multi antennas for opportunistic spectrum sharing in cognitive radio networks"
    - "a framework for designing mimo systems with decision feedback equalization or tomlinson harashima precoding"
    - "cognitive radio an information theoretic perspective"

Connected through hyperedge HE-2 (induced by source paper "on the fast fading multiple antenna gaussian broadcast channel with confidential messages and partial csit"):
  with members:
    - "on secrecy rate analysis of mimo wiretap channels driven by finite alphabet input"
    - "on the achievable rate of the fading dirty paper channel with imperfect csit"
    - "secure communication in the low snr regime"
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"
    - "the secrecy capacity of the mimo wiretap channel"

Connected through hyperedge HE-3 (induced by source paper "on the secrecy rate region of a fading multiple antenna gaussian broadcast channel with confidential messages and partial csit"):
  with members:
    - "on secrecy capacity of fast fading multiple input wiretap channels with statistical csit"
    - "on ergodic secrecy capacity for gaussian miso wiretap channels"
    - "secure transmission with multiple antennas ii the mimome wiretap channel"
    - "towards the secrecy capacity of the gaussian mimo wire tap channel the 2 2 1 channel"
    - "transmitter optimization for achieving secrecy capacity in gaussian mimo wiretap channels"
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"
    - "secure communication over fading channels"
    - "a note on the secrecy capacity of the multi antenna wiretap channel"

Connected through hyperedge HE-4 (induced by source paper "ergodic capacity of cognitive radio under imperfect channel state information"):
  with members:
    - "inner and outer bounds for the gaussian cognitive interference channel and new capacity results"
    - "cognitive multiple access network with outage margin in the primary system"
    - "performance of cognitive radio systems with imperfect radio environment map information"
    - "on ergodic sum capacity of fading cognitive multiple access and broadcast channels"
    - "optimal power allocation for fading channels in cognitive radio networks ergodic capacity and outage capacity"
    - "on peak versus average interference power constraints for protecting primary users in cognitive radio networks"
    - "cognitive radio an information theoretic perspective"

Connected through hyperedge HE-5 (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"
    - "interference mitigation through limited receiver cooperation"
    - "capacity gain from two transmitter and two receiver cooperation"
    - "on the fading paper achievable region of the fading mimo broadcast channel"
    - "cognitive radio an information theoretic perspective"

Connected through hyperedge HE-6 (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"
    - "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"
    - "on the fading paper achievable region of the fading mimo broadcast channel"
    - "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)