human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "lpd communication a sequential change point detection perspective"):
  Abstract: In this paper, we establish a framework for low probability of detection (LPD) communication from a sequential change-point detection (SCPD) perspective, where a transmitter, Alice, wants to hide her signal transmission to a receiver, Bob, under the surveillance of an adversary, Willie. The new framework facilitates to model LPD communication and further evaluate its performance under the condition that Willie has no prior knowledge on when the transmission from Alice starts and that Willie wants to detect the existence of the communication as quickly as possible in real-time manner. We consider three different sequential tests for Willie, i.e., the Shewhart test, the cumulative sum (CUSUM) test, and the Shiryaev-Roberts (SR) test, to model the detection procedure. Communication is said to be covert if it stops before detection by Willie with high probability. Covert probability defined as the probability that Willie is not alerted during the communication procedure is investigated. We formulate an optimization problem aimed at finding the transmit power and transmission duration such that the total amount of information that can be transmitted is maximized subject to a high covert probability. Under Shewhart test, closed-form approximations of the optimal transmit power and transmission duration are derived, which well approximate the solutions obtained from exhaustive search. As for CUSUM and SR tests, we provide an effective algorithm to search the optimal solution. Numeric results are presented to show the performance of LPD communication.

Includes members:
  Member "multi antenna covert communications in random wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "power efficient irs assisted noma")
  Member "low probability of detection communication opportunities and challenges":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "pilot based channel estimation design in covert wireless communication")
  Member "multi hop routing in covert wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "covert transmission with a self sustained relay")
  Member "covert wireless communication with a poisson field of interferers":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "multi antenna covert communications in random wireless networks")
  Member "on covert communication with noise uncertainty":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "finite blocklength analysis of gaussian random coding in awgn channels under covert constraints ii a viewpoint of total variation distance")
  Member "fundamental limits of communication with low probability of detection":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "keyless covert communication via channel state information")
  Member "covert communication in the presence of an uninformed jammer":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "multi antenna jamming in covert communication")
  Member "covert communication over noisy channels a resolvability perspective":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "keyless covert communication via channel state information")

Question: Please tell me which class the source paper 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)