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 communications for the two user broadcast channel with random traffic"):
  Abstract: In this work, we study the stability region of the two-user broadcast channel (BC) with bursty data arrivals and security constraints. We consider the scenario, where one of the receivers has a secrecy constraint and its packets need to be kept secret from the other receiver. This is achieved by employing full-duplexing at the receiver with the secrecy constraint, so that it transmits a jamming signal to impede the reception of the other receiver. In this context, the stability region of the two-user BC is characterized for the general decoding case. Then, assuming two different decoding schemes the respective stability regions are derived. The effect of self-interference due to the full-duplex operation on the stability region is also investigated. The stability region of the BC with a secrecy constraint, where the receivers do not have full duplex capability can be obtained as a special case of the results derived in this paper. In addition, the paper considers the problem of maximizing the saturated throughput of the queue, whose packets does not require to be kept secret under minimum service guarantees for the other queue. The results provide new insights on the effect of the secrecy constraint on the stability region of the BC. In particular, it is shown that the stability region with secrecy constraint is sensitive to the coefficient of self-interference cancelation under certain cases.

Includes members:
  Member "wiretap channels nonasymptotic fundamental limits":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "resource allocation for secure multi user downlink miso urllc systems")
  Member "exploiting full duplex receivers for achieving secret communications in multiuser miso networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "vulnerabilities of massive mimo systems to pilot contamination attacks")
  Member "on secrecy metrics for physical layer security over quasi static fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on secure transmission design an information leakage perspective")
  Member "probabilistic cooperation of a full duplex relay in random access networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "wireless network level partial relay cooperation a stable throughput analysis")
  Member "finite blocklength bounds for wiretap channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "physical layer security in the finite blocklength regime over fading channels")
  Member "stable throughput region of the two user broadcast channel":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "stable throughput region of the two user interference channel")
  Member "the stability region of the two user broadcast channel":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "stable throughput region of the two user broadcast channel")
  Member "throughput analysis for full duplex wireless networks with imperfect self interference cancellation":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "performance trade off between uplink and downlink in full duplex communications")

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)