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: "the sound and the fury hiding communications in noisy wireless networks with interference uncertainty"
  Abstract: Covert communication can prevent the opponent from knowing that a wireless communication has occurred. In the additive white Gaussian noise channels, if we only take the ambient noise into account, a square root law was obtained and the result shows that Alice can reliably and covertly transmit $\mathcal{O}(\sqrt{n})$ bits to Bob in $n$ channel uses. If additional "friendly" node closest to the adversary can produce artificial noise to aid in hiding the communication, the covert throughput can be improved. In this paper, we consider the covert communication in noisy wireless networks, where potential transmitters form a stationary Poisson point process. Alice wishes to communicate covertly to Bob without being detected by the warden Willie. In this scenario, Bob and Willie not only experience the ambient noise, but also the aggregated interference simultaneously. Although the random interference sources are not in collusion with Alice and Bob, our results show that uncertainty in noise and interference experienced by Willie is beneficial to Alice. When the distance between Alice and Willie $d_{a,w}=\omega(n^{\delta/4})$ ($\delta=2/\alpha$ is stability exponent), Alice can reliably and covertly transmit $\mathcal{O}(\log_2\sqrt{n})$ bits to Bob in $n$ channel uses, and there is no limitation on the transmit power of transmitters. Although the covert throughout is lower than the square root law and the friendly jamming scheme, the spatial throughout of the network is higher, and Alice does not presuppose to know the location of Willie. From the network perspective, the communications are hidden in the noisy wireless networks, and what Willie sees is merely a "\emph{shadow}" wireless network where he knows for certain some nodes are transmitting, but he cannot catch anyone red-handed.

Connected through hyperedge HE-1 (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"
    - "on covert communication with noise uncertainty"
    - "fundamental limits of communication with low probability of detection"

Connected through hyperedge HE-2 (induced by source paper "covert wireless communications with active eavesdropper on awgn channels"):
  with members:
    - "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"
    - "limits of reliable communication with low probability of detection on awgn channels"

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)