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 "prescient precoding in heterogeneous dsa networks with both underlay and interweave mimo cognitive radios"):
  Abstract: This work examines a novel heterogeneous dynamic spectrum access network where the primary users (PUs) coexist with both underlay and interweave cognitive radios (ICRs); all terminals being potentially equipped with multiple antennas. Underlay cognitive transmitters (UCTs) are allowed to transmit concurrently with PUs subject to interference constraints, while the ICRs employ spectrum sensing and are permitted to access the shared spectrum only when both PUs and UCTs are absent. We investigate the design of MIMO precoding algorithms for the UCT that increase the detection probability at the ICRs, while simultaneously meeting a desired Quality-of-Service target to the underlay cognitive receivers (UCRs) and constraining interference leaked to PUs. The objective of such a proactive approach, referred to as prescient precoding, is to minimize the probability of interference from ICRs to the UCRs and primary receivers due to imperfect spectrum sensing. We begin with downlink prescient precoding algorithms for multiple single-antenna UCRs and multi-antenna PUs/ICRs. We then present prescient block-diagonalization algorithms for the MIMO underlay downlink where spatial multiplexing is performed for a plurality of multi-antenna UCRs. Numerical experiments demonstrate that prescient precoding by UCTs provides a pronounced performance gain compared to conventional underlay precoding strategies.

Includes members:
  Member "beamforming and rate allocation in miso cognitive radio networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "an efficient precoder design for multiuser mimo cognitive radio networks with interference constraints")
  Member "cognitive radio with partial channel state information at the transmitter":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "practical design for multiple antenna cognitive radio networks with coexistence constraint")
  Member "dirty paper coding for the mimo cognitive radio channel with imperfect csit":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "cognitive radio with partial channel state information at the transmitter")
  Member "cooperative multi cell block diagonalization with per base station power constraints":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "cooperative downlink interference transmission and cancellation for cellular connected uav a divide and conquer approach")
  Member "exploiting multi antennas for opportunistic spectrum sharing in cognitive radio networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "optimal precoder designs for sum utility maximization in swipt enabled multi user mimo cognitive radio networks")
  Member "spectrum sensing algorithms for cognitive radio based on statistical covariances":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "unified analysis of cooperative spectrum sensing over composite and generalized fading channels")
  Member "on the fading paper achievable region of the fading mimo broadcast channel":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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-8 (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)