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 a class of interference relay channels"):
  Abstract: The capacity of a class of interference relay channels (IRCs)—the injective semideterministic IRC where the relay can only observe one of the sources—is investigated. We first derive a novel outer bound and two inner bounds which are based on a careful use of each of the available cooperative strategies together with the adequate interference decoding technique. The outer bound extends Telatar and Tse’s work, whereas the inner bounds contain several known results in the literature. Our main result is the characterization of the capacity region of the Gaussian class of IRCs studied within a fixed number of bits per dimension, constant gap. The proof relies on the use of the different cooperative strategies in specific SNR regimes due to their complexity. As a matter of fact, this issue reveals the complex nature of the Gaussian IRC where the combination of a single coding scheme for the Gaussian relay and interference channel may not lead to a good coding scheme for this problem, even when the focus is only on capacity within a constant gap over all possible fading statistics.

Includes members:
  Member "new outer bounds for the interference channel with unilateral source cooperation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the two user causal cognitive interference channel novel outer bounds and constant gap result for the symmetric gaussian noise channel in weak interference")
  Member "mixed noisy network coding and cooperative unicasting in wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "short message noisy network coding with a decode forward option")
  Member "a new achievable scheme for interference relay channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a relay can increase degrees of freedom in bursty mimo interference networks")
  Member "two birds and one stone gaussian interference channel with a shared out of band relay of limited rate":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a novel cooperative strategy for wireless multihop backhaul networks")
  Member "wireless network information flow a deterministic approach":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "best relay selection in gaussian half duplex diamond networks")
  Member "incremental relaying for the gaussian interference channel with a degraded broadcasting relay":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on cooperation and interference in the weak interference regime full version with detailed proofs")
  Member "interference channels with source cooperation":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "gdof of interference channel with limited cooperation under finite precision csit")
  Member "the gaussian interference relay channel improved achievable rates and sum rate upperbounds using a potent relay":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "approximate capacity of fast fading interference channels with no instantaneous csit")

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)