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 in stochastic wireless networks"
  Abstract: Information-theoretic security -- widely accepted as the strictest notion of security -- relies on channel coding techniques that exploit the inherent randomness of the propagation channels to significantly strengthen the security of digital communications systems. Motivated by recent developments in the field, this paper aims at a characterization of the fundamental secrecy limits of wireless networks. Based on a general model in which legitimate nodes and potential eavesdroppers are randomly scattered in space, the intrinsically secure communications graph (iS-graph) is defined from the point of view of information-theoretic security. Conclusive results are provided for the local connectivity of the Poisson iS-graph, in terms of node degrees and isolation probabilities. It is shown how the secure connectivity of the network varies with the wireless propagation effects, the secrecy rate threshold of each link, and the noise powers of legitimate nodes and eavesdroppers. Sectorized transmission and eavesdropper neutralization are explored as viable strategies for improving the secure connectivity. Lastly, the maximum secrecy rate between a node and each of its neighbours is characterized, and the case of colluding eavesdroppers is studied. The results help clarify how the spatial density of eavesdroppers can compromise the intrinsic security of wireless networks.

Connected through hyperedge HE-1 (induced by source paper "wireless secrecy in large scale networks"):
  with members:
    - "continuum percolation in the intrinsically secure communications graph"
    - "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 communication over fading channels"
    - "secure nested codes for type ii wiretap channels"

Connected through hyperedge HE-2 (induced by source paper "on the throughput cost of physical layer security in decentralized wireless networks"):
  with members:
    - "interference assisted secret communication"
    - "strong secrecy on the binary erasure wiretap channel using large girth ldpc codes"
    - "continuum percolation in the intrinsically secure communications graph"
    - "an overview of the transmission capacity of wireless networks"
    - "secure transmission with multiple antennas ii the mimome wiretap channel"
    - "on secrecy capacity scaling in wireless networks"
    - "on the throughput of secure hybrid arq protocols for gaussian block fading channels"
    - "secrecy in cooperative relay broadcast channels"

Connected through hyperedge HE-3 (induced by source paper "techniques for enhanced physical layer security"):
  with members:
    - "continuum percolation in the intrinsically secure communications graph"
    - "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 communication over fading channels"
    - "a note on the secrecy capacity of the multi antenna wiretap channel"
    - "secure nested codes for type ii wiretap channels"

Connected through hyperedge HE-4 (induced by source paper "percolation and connectivity in the intrinsically secure communications graph"):
  with members:
    - "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"
    - "applications of ldpc codes to the wiretap channel"

Connected through hyperedge HE-5 (induced by source paper "continuum percolation in the intrinsically secure communications graph"):
  with members:
    - "on secrecy capacity scaling in wireless networks"
    - "the secrecy graph and some of its properties"

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)