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: "stochastic geometry based comparison of secrecy enhancement techniques in d2d networks"
  Abstract: This letter presents a performance comparison of two popular secrecy enhancement techniques in wireless networks: (i) creating guard zones by restricting transmissions of legitimate transmitters whenever any eavesdropper is detected in their vicinity, and (ii) adding artificial noise to the confidential messages to make it difficult for the eavesdroppers to decode them. Focusing on a noise-limited regime, we use tools from stochastic geometry to derive the secrecy outage probability at the eavesdroppers as well as the coverage probability at the legitimate users for both these techniques. Using these results, we derive a threshold on the density of the eavesdroppers below which no secrecy enhancing technique is required to ensure a target secrecy outage probability. For eavesdropper densities above this threshold, we concretely characterize the regimes in which each technique outperforms the other. Our results demonstrate that guard zone technique is better when the distances between the transmitters and their legitimate receivers are higher than a certain threshold.

Connected through hyperedge HE-1 (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"
    - "a primer on cellular network analysis using stochastic geometry"
    - "spatio temporal interference correlation and joint coverage in cellular networks"
    - "mimo wiretap channel under receiver side power constraints with applications to wireless power transfer and cognitive radio"
    - "secrecy wireless information and power transfer in fading wiretap channel"

Connected through hyperedge HE-2 (induced by source paper "boundaries as an enhancement technique for physical layer security"):
  with members:
    - "temporal correlation of interference and outage in mobile networks over one dimensional finite regions"
    - "temporal correlation of interference in bounded mobile ad hoc networks with blockage"
    - "distribution of cell size in bounded voronoi tesselations with application to secure local connectivity"
    - "device to device millimeter wave communications interference coverage rate and finite topologies"
    - "physical layer security in heterogeneous cellular networks"
    - "physical layer security in three tier wireless sensor networks a stochastic geometry approach"
    - "analyzing the impact of access point density on the performance of finite area networks"
    - "more is less connectivity in fractal regions"

Connected through hyperedge HE-3 (induced by source paper "boundaries can enhance physical layer security at high data rates"):
  with members:
    - "temporal correlation of interference and outage in mobile networks over one dimensional finite regions"
    - "physical layer security in wireless ad hoc networks under a hybrid full half duplex receiver deployment strategy"
    - "temporal correlation of interference in bounded mobile ad hoc networks with blockage"
    - "physical layer security in heterogeneous cellular networks"
    - "physical layer security in three tier wireless sensor networks a stochastic geometry approach"
    - "improving physical layer security in wireless communications using diversity techniques"
    - "analyzing the impact of access point density on the performance of finite area networks"
    - "more is less connectivity in fractal regions"

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)