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: "throughput scaling of covert communication over wireless adhoc networks"
  Abstract: We consider the problem of covert communication over wireless adhoc networks in which (roughly) $n$ legitimate nodes (LNs) and $n^{\kappa}$ for $0<\kappa<1$ non-communicating warden nodes (WNs) are randomly distributed in a square of unit area. Each legitimate source wants to communicate with its intended destination node while ensuring that every WN is unable to detect the presence of the communication. In this scenario, we study the throughput scaling law. Due the covert communication constraint, the transmit powers are necessarily limited. Under this condition, we introduce a preservation region around each WN. This region serves to prevent transmission from the LNs and to increase the transmit power of the LNs outside the preservation regions. For the achievability results, multi-hop (MH), hierarchical cooperation (HC), and hybrid HC-MH schemes are utilized with some appropriate modifications. In the proposed MH and hybrid schemes, because the preservation regions may impede communication along direct data paths, the data paths are suitably modified by taking a detour around each preservation region. To avoid the concentration of detours resulting extra relaying burdens, we distribute the detours evenly over a wide region. In the proposed HC scheme, we control the symbol power and the scheduling of distributed multiple-input multiple-output transmission. We also present matching upper bounds on the throughput scaling under the assumption that every active LN consumes the same average transmit power over the time period in which the WNs observe the channel outputs.

Connected through hyperedge HE-1 (induced by source paper "treating interference as noise is optimal for covert communication over interference channels"):
  with members:
    - "covert communication over a k user multiple access channel"
    - "fundamental limits of covert communication over mimo awgn channel"
    - "time division is optimal for covert communication over some broadcast channels"
    - "covert communication with channel state information at the transmitter"
    - "fundamental limits of communication with low probability of detection"
    - "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)