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 "secure transmission of delay sensitive data over wireless fading channels"):
  Abstract: In this paper, throughput and energy efficiency of secure wireless transmission of delay sensitive data generated by random sources is studied. A fading broadcast model in which the transmitter sends confidential and common messages to two receivers is considered. It is assumed that the common and confidential data, generated from Markovian sources, is stored in buffers prior to transmission, and the transmitter operates under constraints on buffer/delay violation probability. Under such statistical quality of service (QoS) constraints, effective capacity of time-varying wireless transmissions and effective bandwidth of Markovian sources are employed to determine the throughput. In particular, secrecy capacity is used to describe the service rate of buffers containing confidential messages. Moreover, energy per bit is used as the energy efficiency metric and energy efficiency is studied in the low signal-to-noise (SNR) regime. Specifically, minimum energy per bit required for the reliable communication of common and confidential messages is determined and wideband slope expressions are identified. The impact of buffer/delay constraints, correlation between channels, source characteristics/burstiness, channel knowledge at the transmitter, power allocation, and secrecy requirements on the throughput and energy efficiency of common and confidential message transmissions is identified.

Includes members:
  Member "secure communications in the presence of a buffer aided wireless powered relay with self energy recycling":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "secure transmission and self energy recycling with partial eavesdropper csi")
  Member "a survey on wireless security technical challenges recent advances and future trends":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "physical layer security in the finite blocklength regime over fading channels")
  Member "joint power control in wiretap interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "physical layer security for rf satellite channels in the finite length regime")
  Member "cross layer scheduling for ofdma based cognitive radio systems with delay and security constraints":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "tradeoff between delay and physical layer security in wireless networks")
  Member "opportunistic secrecy with a strict delay constraint":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the security analysis of a cooperative incremental relaying protocol in the presence of an active eavesdropper")
  Member "energy efficient optimization for physical layer security in multi antenna downlink networks with qos guarantee":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "enabling security and high energy efficiency in the internet of things with massive mimo hybrid precoding")
  Member "secure wireless communication and optimal power control under statistical queueing constraints":
    also connected through other hyperedges:
      (none)
  Member "secure communication in the low snr regime":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "secure transmission with large numbers of antennas and finite alphabet inputs")

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)