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 "on cooperation and interference in the weak interference regime full version with detailed proofs"):
  Abstract: Handling interference is one of the main challenges in the design of wireless networks. In this paper we study the application of cooperation for interference management in the weak interference (WI) regime, focusing on the Z-interference channel with a causal relay (Z-ICR), when the channel coefficients are subject to ergodic phase fading, all transmission powers are finite, and the relay is full-duplex. In order to provide a comprehensive understanding of the benefits of cooperation in the WI regime, we characterize, for the first time, two major performance measures for the ergodic phase fading Z-ICR in the WI regime: The sum-rate capacity and the maximal generalized degrees-of-freedom (GDoF). In the capacity analysis, we obtain conditions on the channel coefficients, subject to which the sum-rate capacity of the ergodic phase fading Z-ICR is achieved by treating interference as noise at each receiver, and explicitly state the corresponding sum-rate capacity. In the GDoF analysis, we derive conditions on the exponents of the magnitudes of the channel coefficients, under which treating interference as noise achieves the maximal GDoF, which is explicitly characterized as well. It is shown that under certain conditions on the channel coefficients, {\em relaying strictly increases} both the sum-rate capacity and the maximal GDoF of the ergodic phase fading Z-interference channel in the WI regime. Our results demonstrate {\em for the first time} the gains from relaying in the presence of interference, {\em when interference is weak and the relay power is finite}, both in increasing the sum-rate capacity and in increasing the maximal GDoF, compared to the channel without a relay.

Includes members:
  Member "cooperation for interference management a gdof perspective":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "approximate capacity of fast fading interference channels with no instantaneous csit")
  Member "diversity multiplexing tradeoff for the interference channel with a relay":
    also connected through other hyperedges:
      (none)
  Member "the ergodic capacity of phase fading interference networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "control data separation across edge and cloud for uplink communications in c ran")
  Member "incremental relaying for the gaussian interference channel with a degraded broadcasting relay":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "capacity bounds for a class of interference relay channels")
  Member "capacity theorems for the fading interference channel with a relay and feedback links":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "diversity multiplexing tradeoff for the interference channel with a relay")
  Member "the gaussian interference relay channel improved achievable rates and sum rate upperbounds using a potent relay":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "approximate capacity of fast fading interference channels with no instantaneous csit")
  Member "capacity bounds for the gaussian interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "vector gaussian successive refinement with degraded side information")
  Member "gaussian interference channel capacity to within one bit":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")

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)