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: "multi hop routing in covert wireless networks"
  Abstract: In covert communication, Alice tries to communicate with Bob without being detected by a warden Willie. When the distance between Alice and Bob becomes large compared to the distance between Alice and Willie(s), the performance of covert communication will be degraded. In this case, multi-hop message transmission via intermediate relays can help to improve performance. Hence, in this work multi-hop covert communication over a moderate size network and in the presence of multiple collaborating Willies is considered. The relays can transmit covertly using either a single key for all relays, or different independent keys at the relays. For each case, we develop efficient algorithms to find optimal paths with maximum throughput and minimum end-to-end delay between Alice and Bob. As expected, employing multiple hops significantly improves the ability to communicate covertly versus the case of a single-hop transmission. Furthermore, at the expense of more shared key bits, analytical results and numerical simulations demonstrate that multi-hop covert communication with different independent keys at the relays has better performance than multi-hop covert communication with a single key.

Connected through hyperedge HE-1 (induced by source paper "covert transmission with a self sustained relay"):
  with members:
    - "achieving covert wireless communications using a full duplex receiver"
    - "covert communication achieved by a greedy relay in wireless networks"
    - "wireless powered dense cellular networks how many small cells do we need"
    - "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"
    - "on covert communication with noise uncertainty"
    - "fundamental limits of communication with low probability of detection"

Connected through hyperedge HE-2 (induced by source paper "secrecy and covert communications against uav surveillance via multi hop networks"):
  with members:
    - "safeguarding wireless network with uavs a physical layer security perspective"
    - "coverage probability analysis of uav cellular networks in urban environments"
    - "secure routing with power optimization for ad hoc networks"
    - "securing uav communications via joint trajectory and power control"
    - "robust trajectory and transmit power design for secure uav communications"
    - "securing uav communications via trajectory optimization"
    - "covert communication in fading channels under channel uncertainty"
    - "secure transmission in linear multihop relaying networks"

Connected through hyperedge HE-3 (induced by source paper "challenges in covert wireless communications with active warden on awgn channels"):
  with members:
    - "covert communication over a k user multiple access channel"
    - "covert communication achieved by a greedy relay in wireless networks"
    - "covert wireless communication with a poisson field of interferers"
    - "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-4 (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"
    - "joint optimization of a uav s trajectory and transmit power for covert communications"
    - "covert wireless communications with channel inversion power control in rayleigh fading"
    - "covert communication achieved by a greedy relay in wireless networks"

Connected through hyperedge HE-5 (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"
    - "covert wireless communication with a poisson field of interferers"
    - "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-6 (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"
    - "covert wireless communication with a poisson field of interferers"
    - "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"

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.NI(Networking and Internet Architecture)