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: "on secrecy capacity scaling in wireless networks"
  Abstract: This work studies the achievable secure rate per source-destination pair in wireless networks. First, a path loss model is considered, where the legitimate and eavesdropper nodes are assumed to be placed according to Poisson point processes with intensities $\lambda$ and $\lambda_e$, respectively. It is shown that, as long as $\lambda_e/\lambda=o((\log n)^{-2})$, almost all of the nodes achieve a perfectly secure rate of $\Omega(\frac{1}{\sqrt{n}})$ for the extended and dense network models. Therefore, under these assumptions, securing the network does not entail a loss in the per-node throughput. The achievability argument is based on a novel multi-hop forwarding scheme where randomization is added in every hop to ensure maximal ambiguity at the eavesdropper(s). Secondly, an ergodic fading model with $n$ source-destination pairs and $n_e$ eavesdroppers is considered. Employing the ergodic interference alignment scheme with an appropriate secrecy pre-coding, each user is shown to achieve a constant positive secret rate for sufficiently large $n$. Remarkably, the scheme does not require eavesdropper CSI (only the statistical knowledge is assumed) and the secure throughput per node increases as we add more legitimate users to the network in this setting. Finally, the effect of eavesdropper collusion on the performance of the proposed schemes is characterized.

Connected through hyperedge HE-1 (induced by source paper "energy efficient secrecy in wireless networks based on random jamming"):
  with members:
    - "energy efficient routing in wireless networks in the presence of jamming"
    - "optimal energy and data routing in networks with energy cooperation"
    - "jamming based on an ephemeral key to obtain everlasting security in wireless environments"
    - "secure degrees of freedom of one hop wireless networks"
    - "scaling laws for secrecy capacity in cooperative wireless networks"
    - "optimal relay selection for physical layer security in cooperative wireless networks"
    - "efficient wireless security through jamming coding and routing"
    - "everlasting secrecy by exploiting non idealities of the eavesdropper s receiver"

Connected through hyperedge HE-2 (induced by source paper "physical layer security in millimeter wave cellular networks"):
  with members:
    - "optimal power allocation for artificial noise under imperfect csi against spatially random eavesdroppers"
    - "performance analysis of outdoor mmwave ad hoc networks"
    - "physical layer security in heterogeneous cellular networks"
    - "stochastic geometry modeling and analysis of multi tier millimeter wave cellular networks"
    - "tractable model for rate in self backhauled millimeter wave cellular networks"
    - "coverage and rate analysis for millimeter wave cellular networks"
    - "millimeter wave cellular wireless networks potentials and challenges"
    - "physical layer security in downlink multi antenna cellular networks"

Connected through hyperedge HE-3 (induced by source paper "enhancing secrecy with multi antenna transmission in wireless ad hoc networks"):
  with members:
    - "jamming games in the mimo wiretap channel with an active eavesdropper"
    - "on the design of artificial noise aided secure multi antenna transmission in slow fading channels"
    - "rethinking the secrecy outage formulation a secure transmission design perspective"
    - "cooperative jamming for secure communications in mimo relay networks"
    - "on the throughput cost of physical layer security in decentralized wireless networks"
    - "secure transmission with artificial noise over fading channels achievable rate and optimal power allocation"
    - "stochastic analysis of non slotted aloha in wireless ad hoc networks"
    - "transmission capacity of ad hoc networks with spatial diversity"

Connected through hyperedge HE-4 (induced by source paper "efficient wireless security through jamming coding and routing"):
  with members:
    - "the secrecy graph and some of its properties"

Connected through hyperedge HE-5 (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"
    - "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-6 (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 communication in stochastic wireless networks"
    - "secure transmission with multiple antennas ii the mimome wiretap channel"
    - "on the throughput of secure hybrid arq protocols for gaussian block fading channels"
    - "secrecy in cooperative relay broadcast channels"

Connected through hyperedge HE-7 (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"
    - "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-8 (induced by source paper "percolation and connectivity in the intrinsically secure communications graph"):
  with members:
    - "secure communication in stochastic wireless networks"
    - "on the relationship between the multi antenna secrecy communications and cognitive radio communications"
    - "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"

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)