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 "ergodic fading one sided interference channels without state information at transmitters"):
  Abstract: This work studies the capacity region of a two-user ergodic interference channel with fading, where only one of the users is subject to interference from the other user, and the channel state information (CSI) is only available at the receivers. A layered erasure model with one-sided interference and with arbitrary fading statistics is studied first, whose capacity region is completely determined as a polygon. Each dominant rate pair can be regarded as the outcome of a trade-off between the rate gain of the interference-free user and the rate loss of the other user due to interference. Using insights from the layered erasure model, inner and outer bounds of the capacity region are provided for the one-sided fading Gaussian interference channels. In particular, the inner bound is achieved by artificially creating layers in the signaling of the interference-free user. The outer bound is developed by characterizing a similar trade-off as in the erasure model by taking a "layered" view using the incremental channel approach. Furthermore, the gap between the inner and outer bounds is no more than 12.772 bits per channel use per user, regardless of the signal-to-noise ratios and fading statistics.

Includes members:
  Member "wireless network information flow a deterministic approach":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "best relay selection in gaussian half duplex diamond networks")
  Member "ergodic fading interference channels sum capacity and separability":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "interference regime enforcing rate maximization for non orthogonal multiple access noma")
  Member "interference channels with destination cooperation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "gdof of interference channel with limited cooperation under finite precision csit")
  Member "the approximate capacity of the many to one and one to many gaussian interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "on the degrees of freedom of the k user gaussian interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "real interference alignment exploiting the potential of single antenna systems")
  Member "isotropic mimo interference channels without csit the loss of degrees of freedom":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "elements of cellular blind interference alignment aligned frequency reuse wireless index coding and interference diversity")
  Member "ergodic layered erasure one sided interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "approximate capacity of fast fading interference channels with no instantaneous csit")
  Member "approximate capacity of the two way relay channel a deterministic approach":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "state space adaptive nonlinear self interference cancellation for full duplex communication")

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)