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 wireless communication and optimal power control under statistical queueing constraints"):
  Abstract: In this paper, secure transmission of information over fading broadcast channels is studied in the presence of statistical queueing constraints. Effective capacity is employed as a performance metric to identify the secure throughput of the system, i.e., effective secure throughput. It is assumed that perfect channel side information (CSI) is available at both the transmitter and the receivers. Initially, the scenario in which the transmitter sends common messages to two receivers and confidential messages to one receiver is considered. For this case, effective secure throughput region, which is the region of constant arrival rates of common and confidential messages that can be supported by the buffer-constrained transmitter and fading broadcast channel, is defined. It is proven that this effective throughput region is convex. Then, the optimal power control policies that achieve the boundary points of the effective secure throughput region are investigated and an algorithm for the numerical computation of the optimal power adaptation schemes is provided. Subsequently, the special case in which the transmitter sends only confidential messages to one receiver, is addressed in more detail. For this case, effective secure throughput is formulated and two different power adaptation policies are studied. In particular, it is noted that opportunistic transmission is no longer optimal under buffer constraints and the transmitter should not wait to send the data at a high rate until the main channel is much better than the eavesdropper channel.

Includes members:
  Member "secure broadcasting over fading channels with statistical qos constraints":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "practical ldpc coded modulation schemes for the fading broadcast channel with confidential messages")
  Member "secure communication over fading channels with statistical qos constraints":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "asymptotic regime analysis of noma uplink networks under qos delay constraints")
  Member "on the delay limited secrecy capacity of fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "secret key aided scheme for securing untrusted df relaying networks")
  Member "the impact of qos constraints on the energy efficiency of fixed rate wireless transmissions":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "joint queue aware and channel aware delay optimal scheduling of arbitrarily bursty traffic over multi state time varying channels")
  Member "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "cognitive radio networks an information theoretic perspective")
  Member "secrecy capacity of a class of broadcast channels with an eavesdropper":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "feedback coding schemes for the broadcast channel with mutual secrecy requirement")
  Member "analysis of energy efficiency in fading channels under qos constraints":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "distribution of the sum of fisher snedecor mathcal f random variables and its applications")

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)