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 communication over fading channels"
  Abstract: The fading broadcast channel with confidential messages (BCC) is investigated, where a source node has common information for two receivers (receivers 1 and 2), and has confidential information intended only for receiver 1. The confidential information needs to be kept as secret as possible from receiver 2. The broadcast channel from the source node to receivers 1 and 2 is corrupted by multiplicative fading gain coefficients in addition to additive Gaussian noise terms. The channel state information (CSI) is assumed to be known at both the transmitter and the receivers. The parallel BCC with independent subchannels is first studied, which serves as an information-theoretic model for the fading BCC. The secrecy capacity region of the parallel BCC is established. This result is then specialized to give the secrecy capacity region of the parallel BCC with degraded subchannels. The secrecy capacity region is then established for the parallel Gaussian BCC, and the optimal source power allocations that achieve the boundary of the secrecy capacity region are derived. In particular, the secrecy capacity region is established for the basic Gaussian BCC. The secrecy capacity results are then applied to study the fading BCC. Both the ergodic and outage performances are studied.

Connected through hyperedge HE-1 (induced by source paper "parallel bcc with one common and two confidential messages and imperfect csit"):
  with members:
    - "achievable secrecy rates over mimome gaussian channels with gmm signals in low noise regime"
    - "principles of physical layer security in multiuser wireless networks a survey"
    - "new results on multiple input multiple output broadcast channels with confidential messages"
    - "capacity region of gaussian mimo broadcast channels with common and confidential messages"
    - "secure transmission with multiple antennas ii the mimome wiretap channel"
    - "the secrecy capacity region of the gaussian mimo multi receiver wiretap channel"
    - "capacity bounds for broadcast channels with confidential messages"
    - "resource allocation for wireless fading relay channels max min solution"

Connected through hyperedge HE-2 (induced by source paper "security in cognitive radio networks"):
  with members:
    - "on the relationship between the multi antenna secrecy communications and cognitive radio communications"
    - "effective capacity analysis of cognitive radio channels for quality of service provisioning"
    - "secrecy in cooperative relay broadcast channels"
    - "on the secrecy capacity of fading channels"

Connected through hyperedge HE-3 (induced by source paper "optimal power allocation in block fading gaussian channels with causal csi and secrecy constraints"):
  with members:
    - "secrecy outage capacity of fading channels"
    - "on the secrecy capacity of fading channels"

Connected through hyperedge HE-4 (induced by source paper "capacity bounds for wireless ergodic fading broadcast channels with partial csit"):
  with members:
    - "the capacity region of the wireless ergodic fading interference channel with partial csit to within one bit"
    - "private broadcasting over independent parallel channels"
    - "the two user gaussian fading broadcast channel"
    - "interference networks with general message sets a random coding scheme"
    - "ergodic fading interference channels sum capacity and separability"
    - "a note on outer bounds for broadcast channel"
    - "fading cognitive multiple access channels with confidential messages"
    - "capacity bounds for broadcast channels with confidential messages"

Connected through hyperedge HE-5 (induced by source paper "to obtain or not to obtain csi in the presence of hybrid adversary"):
  with members:
    - "jamming games in the mimo wiretap channel with an active eavesdropper"
    - "keys through arq theory and practice"
    - "half duplex active eavesdropping in fast fading channels a block markov wyner secrecy encoding scheme"
    - "on the throughput of secure hybrid arq protocols for gaussian block fading channels"
    - "on the secrecy capacity of fading channels"

Connected through hyperedge HE-6 (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"
    - "cognitive radio with partial channel state information at the transmitter"
    - "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"
    - "a note on the secrecy capacity of the multi antenna wiretap channel"

Connected through hyperedge HE-7 (induced by source paper "wireless secrecy in large scale networks"):
  with members:
    - "continuum percolation in the intrinsically secure communications graph"
    - "secure communication in stochastic wireless networks"
    - "techniques for enhanced physical layer security"
    - "on the relationship between the multi antenna secrecy communications and cognitive radio communications"
    - "on secrecy capacity scaling in wireless networks"
    - "secrecy in cooperative relay broadcast channels"
    - "the secrecy graph and some of its properties"
    - "secure nested codes for type ii wiretap channels"

Connected through hyperedge HE-8 (induced by source paper "techniques for enhanced physical layer security"):
  with members:
    - "continuum percolation in the intrinsically secure communications graph"
    - "secure communication in stochastic wireless networks"
    - "on the relationship between the multi antenna secrecy communications and cognitive radio communications"
    - "on secrecy capacity scaling in wireless networks"
    - "secrecy in cooperative relay broadcast channels"
    - "the secrecy graph and some of its properties"
    - "a note on the secrecy capacity of the multi antenna wiretap channel"
    - "secure nested codes for type ii wiretap channels"

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)