human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "the stability region of the two user broadcast channel"
  Abstract: In this paper, we characterize the stability region of the two-user broadcast channel. First, we obtain the stability region in the general case. Second, we consider the particular case where each receiver treats the interfering signal as noise, as well as the case in which the packets are transmitted using superposition coding and successive decoding is employed at the strong receiver.

Connected through hyperedge HE-1 (induced by source paper "secure communications for the two user broadcast channel with random traffic"):
  with members:
    - "wiretap channels nonasymptotic fundamental limits"
    - "exploiting full duplex receivers for achieving secret communications in multiuser miso networks"
    - "on secrecy metrics for physical layer security over quasi static fading channels"
    - "probabilistic cooperation of a full duplex relay in random access networks"
    - "finite blocklength bounds for wiretap channels"
    - "stable throughput region of the two user broadcast channel"
    - "throughput analysis for full duplex wireless networks with imperfect self interference cancellation"
    - "fundamental limits of caching with secure delivery"

Connected through hyperedge HE-2 (induced by source paper "stable throughput region of the two user broadcast channel"):
  with members:
    - "the stability region of the two user interference channel"
    - "the two user gaussian fading broadcast channel"
    - "duality and stability regions of multi rate broadcast and multiple access networks"

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