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 covert communication with noise uncertainty"
  Abstract: Prior studies on covert communication with noise uncertainty adopted a worst-case approach from the warden's perspective. That is, the worst-case detection performance of the warden is used to assess covertness, which is overly optimistic. Instead of simply considering the worst limit, in this work, we take the distribution of noise uncertainty into account to evaluate the overall covertness in a statistical sense. Specifically, we define new metrics for measuring the covertness, which are then adopted to analyze the maximum achievable rate for a given covertness requirement under both bounded and unbounded noise uncertainty models.

Connected through hyperedge HE-1 (induced by source paper "finite blocklength analysis of gaussian random coding in awgn channels under covert constraints ii a viewpoint of total variation distance"):
  with members:
    - "finite blocklength analysis of gaussian random coding in awgn channels under covert constraints"
    - "first and second order asymptotics in covert communication"
    - "fundamental limits of covert communication over mimo awgn channel"
    - "covert communication in fading channels under channel uncertainty"
    - "covert wireless communication with artificial noise generation"
    - "fundamental limits of communication with low probability of detection"
    - "covert communication over noisy channels a resolvability perspective"
    - "covert communication gains from adversary s ignorance of transmission time"

Connected through hyperedge HE-2 (induced by source paper "multi antenna covert communications in random wireless networks"):
  with members:
    - "fundamental limits of covert communication over mimo awgn channel"
    - "covert wireless communication with a poisson field of interferers"
    - "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"
    - "fundamental limits of communication with low probability of detection"
    - "artificial noise aided secure transmission in large scale spectrum sharing networks"

Connected through hyperedge HE-3 (induced by source paper "covert transmission with a self sustained relay"):
  with members:
    - "achieving covert wireless communications using a full duplex receiver"
    - "multi hop routing in covert wireless networks"
    - "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"
    - "fundamental limits of communication with low probability of detection"

Connected through hyperedge HE-4 (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"
    - "multi hop routing in covert wireless networks"
    - "robust trajectory and transmit power design for secure uav communications"
    - "securing uav communications via trajectory optimization"
    - "covert communication in fading channels under channel uncertainty"

Connected through hyperedge HE-5 (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 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"
    - "fundamental limits of communication with low probability of detection"

Connected through hyperedge HE-6 (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-7 (induced by source paper "gaussian signalling for covert communications"):
  with members:
    - "first and second order asymptotics in covert communication"
    - "covert communication over a k user multiple access channel"
    - "multipath stealth communication with jammers"
    - "covert communication in wireless relay networks"
    - "covert communication achieved by a greedy relay in wireless networks"
    - "covert communication in fading channels under channel uncertainty"
    - "fundamental limits of communication with low probability of detection"
    - "covert communication in the presence of an uninformed jammer"

Connected through hyperedge HE-8 (induced by source paper "covert wireless communication in presence of a multi antenna adversary and delay constraints"):
  with members:
    - "multi antenna covert communications in random wireless networks"
    - "low probability of detection communication opportunities and challenges"
    - "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"
    - "fundamental limits of covert communication over mimo awgn channel"
    - "covert communication achieved by a greedy relay in wireless networks"

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)