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 "capacity bounds for wireless ergodic fading broadcast channels with partial csit"):
  Abstract: The two-user wireless ergodic fading Broadcast Channel (BC) with partial Channel State Information at the Transmitter (CSIT) is considered. The CSIT is given by an arbitrary deterministic function of the channel state. This characteristic yields a full control over how much state information is available, from perfect to no information. In literature, capacity derivations for wireless ergodic fading channels, specifically for fading BCs, mostly rely on the analysis of channels comprising of parallel sub-channels. This technique is usually suitable for the cases where perfect state information is available at the transmitters. In this paper, new arguments are proposed to directly derive (without resorting to the analysis of parallel channels) capacity bounds for the two-user fading BC with both common and private messages based on the existing bounds for the discrete channel. Specifically, a novel approach is developed to adapt and evaluate the well-known UV-outer bound for the Gaussian fading channel using the entropy power inequality. Our approach indeed sheds light on the role of broadcast auxiliaries in the fading channel. It is shown that the derived outer bound is optimal for the channel with perfect CSIT as well as for some special cases with partial CSIT. Our outer bound is also directly applicable to the case without CSIT which has been recently considered in several papers. Next, the approach is developed to analyze for the fading BC with secrecy. In the case of perfect CSIT, a full characterization of the secrecy capacity region is derived for the channel with common and confidential messages. This result completes a gap in a previous work by Ekrem and Ulukus. For the channel without common message, the secrecy capacity region is also derived when the transmitter has access only to the degradedness ordering of the channel.

Includes members:
  Member "the capacity region of the wireless ergodic fading interference channel with partial csit to within one bit":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "approximate capacity of fast fading interference channels with no instantaneous csit")
  Member "private broadcasting over independent parallel channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "vector gaussian successive refinement with degraded side information")
  Member "the two user gaussian fading broadcast channel":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "secure communications for the two user broadcast channel with random traffic")
  Member "interference networks with general message sets a random coding scheme":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the k user interference channel strong interference regime")
  Member "ergodic fading interference channels sum capacity and separability":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "interference regime enforcing rate maximization for non orthogonal multiple access noma")
  Member "a note on outer bounds for broadcast channel":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "broadcast channels with privacy leakage constraints")
  Member "fading cognitive multiple access channels with confidential messages":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "strong secrecy for multiple access channels")
  Member "capacity bounds for broadcast channels with confidential messages":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "optimal secure gdof of symmetric gaussian wiretap channel with a helper")

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)