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 "the capacity region of the wireless ergodic fading interference channel with partial csit to within one bit"):
  Abstract: Fundamental capacity limits are studied for the two-user wireless ergodic fading IC with partial Channel State Information at the Transmitters (CSIT) where each transmitter is equipped with an arbitrary deterministic function of the channel state (this model yields a full control over how much state information is available). One of the main challenges in the analysis of fading networks, specifically multi-receiver networks including fading ICs, is to obtain efficient capacity outer bounds. In this paper, a novel capacity outer bound is established for the two-user ergodic fading IC. For this purpose, by a subtle combination of broadcast channel techniques (i.e., manipulating mutual information functions composed of vector random variables by Csiszar-Korner identity) and genie-aided techniques, first a single-letter outer bound characterized by mutual information functions including some auxiliary random variables is derived. Then, by novel arguments the derived bound is optimized over its auxiliaries only using the entropy power inequality. Besides being well-described, our outer bound is efficient from several aspects. Specifically, it is optimal for the fading IC with uniformly strong interference. Also, it is sum-rate optimal for the channel with uniformly mixed interference. More importantly, it is proved that when each transmitter has access to any amount of CSIT that includes the interference to noise ratio of its non-corresponding receiver, the outer bound differs by no more than one bit from the achievable rate region given by Han-Kobayashi scheme. This result is viewed as a natural generalization of the ETW to within one bit capacity result for the static channel to the wireless ergodic fading case.

Includes members:
  Member "capacity bounds for wireless ergodic fading broadcast channels with partial csit":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "capacity bounds and a certain capacity region for special three receiver broadcast channels with side information")
  Member "fundamental limits of communications in interference networks part i basic structures":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the k user interference channel strong interference regime")
  Member "fundamental limits of communications in interference networks part ii information flow in degraded networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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-4 (induced by source paper "interference regime enforcing rate maximization for non orthogonal multiple access noma")
  Member "interference mitigation through limited transmitter cooperation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "exploiting computation replication for mobile edge computing a fundamental computation communication tradeoff study")
  Member "feedback capacity of the gaussian interference channel to within 2 bits":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "capacity limits of full duplex cellular network")
  Member "a general coding scheme for two user fading interference channels":
    also connected through other hyperedges:
      (none)
  Member "interference mitigation through limited receiver cooperation":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "how much can d2d communication reduce content delivery latency in fog networks with edge caching")

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)