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: "mimo wiretap channel under receiver side power constraints with applications to wireless power transfer and cognitive radio"
  Abstract: We consider the multiple-input multiple-output (MIMO) wiretap channel under a minimum receiver-side power constraint in addition to the usual maximum transmitter-side power constraint. This problem is motivated by energy harvesting communications with wireless energy transfer, where an added goal is to deliver a minimum amount of energy to a receiver in addition to delivering secure data to another receiver. In this paper, we characterize the exact secrecy capacity of the MIMO wiretap channel under transmitter and receiver-side power constraints. We first show that solving this problem is equivalent to solving the secrecy capacity of the wiretap channel under a  double-sided correlation matrix  constraint on the channel input. We show the converse by extending the channel enhancement technique to our case. We present two achievable schemes that achieve the secrecy capacity: the first achievable scheme uses a Gaussian codebook with a fixed mean, and the second achievable scheme uses artificial noise (or cooperative jamming) together with a Gaussian codebook. The role of the mean or the artificial noise is to enable energy transfer without sacrificing from the secure rate. This is the first instance of a channel model where either the use of a mean signal or the use of channel prefixing via artificial noise is  strictly necessary  for the MIMO wiretap channel. We then extend our work to consider a maximum receiver-side power constraint instead of a minimum receiver-side power constraint. This problem is motivated by cognitive radio applications, where an added goal is to decrease the received signal energy (interference temperature) at a receiver. We further extend our results to: requiring receiver-side power constraints at both receivers; considering secrecy constraints at both receivers to study broadcast channels with confidential messages; and removing the secrecy constraints to study the classical broadcast channel.

Connected through hyperedge HE-1 (induced by source paper "on the secrecy capacity of a full duplex wirelessly powered communication system"):
  with members:
    - "exploiting interference for secrecy wireless information and power transfer"
    - "capacity of a full duplex wirelessly powered communication system with self interference and processing cost"
    - "power allocation for secure swipt systems with wireless powered cooperative jamming"
    - "physical layer security in heterogeneous networks with jammer selection and full duplex users"
    - "wireless powered communication networks an overview"
    - "accumulate and jam towards secure communication via a wireless powered full duplex jammer"
    - "artificial noise aided secrecy information and power transfer in ofdma systems"
    - "capacity of the gaussian two hop full duplex relay channel with residual self interference"

Connected through hyperedge HE-2 (induced by source paper "optimal and low complexity dynamic spectrum access for rf powered ambient backscatter system with online reinforcement learning"):
  with members:
    - "reinforcement learning approach for rf powered cognitive radio network with ambient backscatter"
    - "stackelberg game for distributed time scheduling in rf powered backscatter cognitive radio networks"
    - "energy efficient scheduling for loss tolerant iot applications with uninformed transmitter"
    - "inference from randomized transmissions by many backscatter sensors"
    - "ambient backscatter communications a contemporary survey"
    - "wirelessly powered backscatter communication networks modeling coverage and capacity"
    - "cognitive and energy harvesting based d2d communication in cellular networks stochastic geometry modeling and analysis"
    - "opportunistic wireless energy harvesting in cognitive radio networks"

Connected through hyperedge HE-3 (induced by source paper "coexistence of rf powered iot and a primary wireless network with secrecy guard zones"):
  with members:
    - "power allocation for secure swipt systems with wireless powered cooperative jamming"
    - "secrecy outage analysis for downlink transmissions in the presence of randomly located eavesdroppers"
    - "modeling and analysis of cellular networks using stochastic geometry a tutorial"
    - "tight lower bounds on the contact distance distribution in poisson hole process"
    - "stochastic geometry based comparison of secrecy enhancement techniques in d2d networks"
    - "a primer on cellular network analysis using stochastic geometry"
    - "spatio temporal interference correlation and joint coverage in cellular networks"
    - "secrecy wireless information and power transfer in fading wiretap channel"

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)