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 "covert transmission with a self sustained relay"):
  Abstract: This paper examines the possibility, performance limits, and associated costs for a self-sustained relay to transmit its own covert information to a destination on top of forwarding the source’s information. Since the source provides energy to the relay for forwarding its information, the source does not allow the relay’s covert transmission and to detect it. Considering the time switching (TS) and power splitting (PS) schemes for energy harvesting, where all the harvested energy is used for transmission at the self-sustained relay, we derive the minimum detection error probability    $\xi ^{\ast }$    at the source based on which we determine the maximum effective covert rate    $\Psi ^{\ast }$    subject to a given covertness constraint on    $\xi ^{\ast }$   . Our analysis shows that    $\xi ^{\ast }$    is the same for the TS and PS schemes, which leads to the fact that the cost of achieving    $\Psi ^{\ast }$    in both the two schemes in terms of the required increase in the energy conversion efficiency at the relay is the same, although the values of    $\Psi ^{\ast }$    in these two schemes can be different in specific scenarios. For example, the TS scheme outperforms the PS scheme in terms of achieving a higher    $\Psi ^{\ast }$    when the transmit power at the source is relatively low. If the covertness constraint is tighter than a specific value, it is the covertness constraint that limits    $\Psi ^{\ast }$   , and otherwise, it is upper bound on the energy conversion efficiency that limits    $\Psi ^{\ast }$   .

Includes members:
  Member "achieving covert wireless communications using a full duplex receiver":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "multi antenna jamming in covert communication")
  Member "multi hop routing in covert wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "secrecy and covert communications against uav surveillance via multi hop networks")
  Member "covert communication achieved by a greedy relay in wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "covert millimeter wave communication via a dual beam transmitter")
  Member "wireless powered dense cellular networks how many small cells do we need":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a brief history on the theoretical analysis of dense small cell wireless networks")
  Member "covert communication in fading channels under channel 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 "covert communications with a full duplex receiver over wireless fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "multi antenna covert communications in random wireless networks")
  Member "covert communication with finite blocklength in awgn channels":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "secrecy and covert communications against uav surveillance via multi hop networks")
  Member "on covert communication with noise uncertainty":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "finite blocklength analysis of gaussian random coding in awgn channels under covert constraints ii a viewpoint of total variation distance")

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)