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: "stable throughput region of the two user broadcast channel"
  Abstract: In this paper we consider the two-user broadcast channel and we characterize its stable throughout region. We start the analysis by providing the stability region for the general case without any specific considerations on transmission and reception mechanisms. We also provide conditions for the stable throughput region to be convex. Subsequently, we consider the case where the transmitter uses superposition coding and we consider two special cases for the receivers. The first one is when both receivers treat interference as noise. The second is when the user with a better channel uses successive decoding and the other receiver treats interference as noise.

Connected through hyperedge HE-1 (induced by source paper "stable throughput region of the two user interference channel"):
  with members:
    - "stable throughput and delay analysis of a random access network with queue aware transmission"
    - "effect of energy harvesting on stable throughput in cooperative relay systems"
    - "multi user cognitive interference channels a survey and new capacity results"
    - "achievable outage rate regions for the miso interference channel"
    - "the stability region of the two user interference channel"
    - "relay assisted multiple access with multi packet reception capability and simultaneous transmission and reception"
    - "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels"

Connected through hyperedge HE-2 (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"
    - "the stability 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"

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)