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: "secure transmission with multiple antennas ii the mimome wiretap channel"
  Abstract: The capacity of the Gaussian wiretap channel model is analyzed when there are multiple antennas at the sender, intended receiver and eavesdropper. The associated channel matrices are fixed and known to all the terminals. A computable characterization of the secrecy capacity is established as the saddle point solution to a minimax problem. The converse is based on a Sato-type argument used in other broadcast settings, and the coding theorem is based on Gaussian wiretap codebooks. #R##N#At high signal-to-noise ratio (SNR), the secrecy capacity is shown to be attained by simultaneously diagonalizing the channel matrices via the generalized singular value decomposition, and independently coding across the resulting parallel channels. The associated capacity is expressed in terms of the corresponding generalized singular values. It is shown that a semi-blind "masked" multi-input multi-output (MIMO) transmission strategy that sends information along directions in which there is gain to the intended receiver, and synthetic noise along directions in which there is not, can be arbitrarily far from capacity in this regime. #R##N#Necessary and sufficient conditions for the secrecy capacity to be zero are provided, which simplify in the limit of many antennas when the entries of the channel matrices are independent and identically distributed. The resulting scaling laws establish that to prevent secure communication, the eavesdropper needs 3 times as many antennas as the sender and intended receiver have jointly, and that the optimimum division of antennas between sender and intended receiver is in the ratio of 2:1.

Connected through hyperedge HE-1 (induced by source paper "multi antenna jamming in covert communication"):
  with members:
    - "achieving covert wireless communications using a full duplex receiver"
    - "fundamental limits of covert communication over mimo awgn channel"
    - "fundamental limits of communication with low probability of detection"
    - "covert communication in the presence of an uninformed jammer"
    - "covert communication over noisy channels a resolvability perspective"
    - "reliable deniable communication hiding messages in noise"
    - "limits of reliable communication with low probability of detection on awgn channels"
    - "cooperative jamming for secure communications in mimo relay networks"

Connected through hyperedge HE-2 (induced by source paper "broadcast channels with privacy leakage constraints"):
  with members:
    - "fourier motzkin elimination software for information theoretic inequalities"
    - "the likelihood encoder for lossy compression"
    - "wiretap channels with random states non causally available at the encoder"
    - "strong secrecy for cooperative broadcast channels"
    - "semantic security capacity for wiretap channels of type ii"
    - "secrecy capacity region of some classes of wiretap broadcast channels"
    - "a technique for deriving one shot achievability results in network information theory"
    - "effective secrecy reliability confusion and stealth"

Connected through hyperedge HE-3 (induced by source paper "secure transmission with large numbers of antennas and finite alphabet inputs"):
  with members:
    - "physical layer security for spectrum sharing systems"
    - "linear precoding of data and artificial noise in secure massive mimo systems"
    - "a survey on wireless security technical challenges recent advances and future trends"
    - "secure massive mimo transmission with an active eavesdropper"
    - "large scale mimo relaying techniques for physical layer security af or df"
    - "multi antenna relay aided wireless physical layer security"
    - "low complexity mimo precoding with discrete signals and statistical csi"
    - "linear precoding for the mimo multiple access channel with finite alphabet inputs and statistical csi"

Connected through hyperedge HE-4 (induced by source paper "safeguarding decentralized wireless networks using full duplex jamming receivers"):
  with members:
    - "optimal power allocation for artificial noise under imperfect csi against spatially random eavesdroppers"
    - "physical layer security in heterogeneous cellular networks"
    - "throughput analysis for full duplex wireless networks with imperfect self interference cancellation"
    - "principles of physical layer security in multiuser wireless networks a survey"
    - "improving physical layer secrecy using full duplex jamming receivers"
    - "enhancing secrecy with multi antenna transmission in wireless ad hoc networks"
    - "in band full duplex wireless challenges and opportunities"
    - "experiment driven characterization of full duplex wireless systems"

Connected through hyperedge HE-5 (induced by source paper "power constrained secrecy rate maximization for joint relay and jammer selection assisted wireless networks"):
  with members:
    - "a survey on wireless security technical challenges recent advances and future trends"
    - "joint relay and jammer selection improves the physical layer security in the face of csi feedback delays"
    - "improving physical layer security in wireless communications using diversity techniques"
    - "multi antenna relay aided wireless physical layer security"
    - "optimization of code rates in sisome wiretap channels"
    - "optimal relay selection for physical layer security in cooperative wireless networks"
    - "on cooperative relaying schemes for wireless physical layer security"
    - "joint relay and jammer selection for secure two way relay networks"

Connected through hyperedge HE-6 (induced by source paper "optimal beamforming for gaussian mimo wiretap channels with two transmit antennas"):
  with members:
    - "optimal signaling for secure communications over gaussian mimo wiretap channels"
    - "an algorithm for global maximization of secrecy rates in gaussian mimo wiretap channels"
    - "principles of physical layer security in multiuser wireless networks a survey"
    - "full rank solutions for the mimo gaussian wiretap channel with an average power constraint"
    - "on secrecy rate analysis of mimo wiretap channels driven by finite alphabet input"
    - "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"
    - "the secrecy capacity of the mimo wiretap channel"

Connected through hyperedge HE-7 (induced by source paper "friendly jamming in a mimo wiretap interference network a nonconvex game approach"):
  with members:
    - "joint power control in wiretap interference channels"
    - "physical layer security for massive mimo an overview on passive eavesdropping and active attacks"
    - "real and complex monotone communication games"
    - "joint sensing and power allocation in nonconvex cognitive radio games nash equilibria and distributed algorithms"
    - "on secrecy rate of the generalized artificial noise assisted secure beamforming for wiretap channels"
    - "on the secure degrees of freedom in the k user gaussian interference channel"

Connected through hyperedge HE-8 (induced by source paper "on the compound mimo wiretap channel with mean feedback"):
  with members:
    - "the secrecy capacity of compound gaussian mimo wiretap channels"
    - "secrecy results for compound wiretap channels"
    - "transmitter optimization for achieving secrecy capacity in gaussian mimo wiretap channels"
    - "the secrecy capacity of the mimo 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)