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: "covert wireless communication with a poisson field of interferers"
  Abstract: In this paper, we study covert communication in wireless networks consisting of a transmitter, Alice, an intended receiver, Bob, a warden, Willie, and a Poisson field of interferers. Bob and Willie are subject to uncertain shot noise due to the ambient signals from interferers in the network. With the aid of stochastic geometry, we analyze the throughput of the covert communication between Alice and Bob subject to given requirements on the covertness against Willie and the reliability of decoding at Bob. We consider non-fading and fading channels. We analytically obtain interesting findings on the impacts of the density and the transmit power of the concurrent interferers on the covert throughput. That is, the density and the transmit power of the interferers have no impact on the covert throughput as long as the network stays in the interference-limited regime, for both the non-fading and the fading cases. When the interference is sufficiently small and comparable with the receiver noise, the covert throughput increases as the density or the transmit power of the concurrent interferers increases.

Connected through hyperedge HE-1 (induced by source paper "multi antenna covert communications in random wireless networks"):
  with members:
    - "fundamental limits of covert communication over mimo awgn channel"
    - "covert communication in fading channels under channel uncertainty"
    - "covert wireless communication with artificial noise generation"
    - "safeguarding decentralized wireless networks using full duplex jamming receivers"
    - "covert communications with a full duplex receiver over wireless fading channels"
    - "on covert communication with noise uncertainty"
    - "fundamental limits of communication with low probability of detection"
    - "artificial noise aided secure transmission in large scale spectrum sharing networks"

Connected through hyperedge HE-2 (induced by source paper "challenges in covert wireless communications with active warden on awgn channels"):
  with members:
    - "multi hop routing in covert wireless networks"
    - "covert communication over a k user multiple access channel"
    - "covert communication achieved by a greedy relay in wireless networks"
    - "covert wireless communication with artificial noise generation"
    - "covert communication with channel state information at the transmitter"
    - "the sound and the fury hiding communications in noisy wireless networks with interference uncertainty"
    - "on covert communication with noise uncertainty"
    - "fundamental limits of communication with low probability of detection"

Connected through hyperedge HE-3 (induced by source paper "pilot based channel estimation design in covert wireless communication"):
  with members:
    - "multi antenna covert communications in random wireless networks"
    - "low probability of detection communication opportunities and challenges"
    - "covert transmission with a self sustained relay"
    - "gaussian signalling for covert communications"
    - "achieving covert wireless communications using a full duplex receiver"
    - "multi hop routing in covert wireless networks"
    - "joint optimization of a uav s trajectory and transmit power for covert communications"
    - "covert wireless communications with channel inversion power control in rayleigh fading"

Connected through hyperedge HE-4 (induced by source paper "lpd communication a sequential change point detection perspective"):
  with members:
    - "multi antenna covert communications in random wireless networks"
    - "low probability of detection communication opportunities and challenges"
    - "multi hop routing in covert wireless networks"
    - "on covert communication with noise uncertainty"
    - "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"
    - "covert communication gains from adversary s ignorance of transmission time"

Connected through hyperedge HE-5 (induced by source paper "low probability of detection communication opportunities and challenges"):
  with members:
    - "multi antenna covert communications in random wireless networks"
    - "gaussian signalling for covert communications"
    - "achieving covert wireless communications using a full duplex receiver"
    - "multi hop routing in covert wireless networks"
    - "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"
    - "covert bits through queues"

Connected through hyperedge HE-6 (induced by source paper "covert wireless communications with channel inversion power control in rayleigh fading"):
  with members:
    - "gaussian signalling for covert communications"
    - "achieving covert wireless communications using a full duplex receiver"
    - "adaptive full duplex jamming receiver for secure d2d links in random networks"
    - "covert communication in wireless relay networks"
    - "covert communication achieved by a greedy relay in wireless networks"
    - "covert communication in fading channels under channel uncertainty"
    - "covert communications with a full duplex receiver over wireless fading channels"
    - "covert communication with finite blocklength in awgn channels"

Connected through hyperedge HE-7 (induced by source paper "achieving covert wireless communications using a full duplex receiver"):
  with members:
    - "covert wireless communications with channel inversion power control in rayleigh fading"
    - "covert communication achieved by a greedy relay in wireless networks"
    - "physical layer security jamming theoretical limits and practical designs in wireless networks"
    - "covert communication in fading channels under channel uncertainty"
    - "covert wireless communication with artificial noise generation"
    - "covert communications with a full duplex receiver over wireless fading channels"
    - "on covert communication with noise uncertainty"
    - "fundamental limits of communication with low probability of detection"

Connected through hyperedge HE-8 (induced by source paper "joint optimization of a uav s trajectory and transmit power for covert communications"):
  with members:
    - "safeguarding wireless network with uavs a physical layer security perspective"
    - "gaussian signalling for covert communications"
    - "capacity characterization of uav enabled two user broadcast channel"
    - "covert communication achieved by a greedy relay in wireless networks"
    - "joint trajectory and communication design for multi uav enabled wireless networks"
    - "securing uav communications via trajectory optimization"
    - "energy efficient data collection in uav enabled wireless sensor network"
    - "on covert communication with noise uncertainty"

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)