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 two user gaussian fading broadcast channel"
  Abstract: This paper presents outerbounds for the two-user Gaussian fading broadcast channel. These outerbounds are based on Costa's entropy power inequality (Costa-EPI) and are formulated mathematically as a feasibility problem. For classes of the two-user Gaussian fading broadcast channel where the outerbound is found to have a feasible solution, we find conditions under which a suitable inner and outer bound meet. For all such cases, this paper provides a partial characterization of the capacity region of the Gaussian two-user fading broadcast channel.

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"
    - "the stability region of the two user broadcast channel"
    - "throughput analysis for full duplex wireless networks with imperfect self interference cancellation"

Connected through hyperedge HE-2 (induced by source paper "ergodic fading mimo dirty paper and broadcast channels capacity bounds and lattice strategies"):
  with members:
    - "on the dirty paper channel with fast fading dirt"
    - "dirty paper coding for fading channels with partial transmitter side information"
    - "writing on dirty paper with resizing and its application to quasi static fading broadcast channels"
    - "on the fading paper achievable region of the fading mimo broadcast channel"

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

Connected through hyperedge HE-4 (induced by source paper "capacity theorems for broadcast channels with two channel state components known at the receivers"):
  with members:
    - "capacity region of the broadcast channel with two deterministic channel state components"
    - "completely stale transmitter channel state information is still very useful"

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

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

Connected through hyperedge HE-7 (induced by source paper "outage balancing in downlink non orthogonal multiple access with statistical channel state information"):
  with members:
    - "fairness for non orthogonal multiple access in 5g systems"

Connected through hyperedge HE-8 (induced by source paper "capacity region of the broadcast channel with two deterministic channel state components"):
  with members:
    - "the state dependent semideterministic broadcast channel"
    - "capacity bounds for multiuser channels with non causal channel state information at the transmitters"
    - "completely stale transmitter channel state information is still very useful"
    - "on the capacity of the discrete memoryless broadcast channel with feedback"

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)