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 "cooperation for interference management a gdof perspective"):
  Abstract: The impact of cooperation on interference management is investigated by studying an elemental wireless network, the so called symmetric interference relay channel (IRC), from a generalized degrees of freedom (GDoF) perspective. This is motivated by the fact that the deployment of relays is considered as a remedy to overcome the bottleneck of current systems in terms of achievable rates. The focus of this work is on the regime in which the interference link is weaker than the source-relay link in the IRC. Our approach towards studying the GDoF goes through the capacity analysis of the linear deterministic IRC (LD-IRC). New upper bounds on the sum-capacity of the LD-IRC based on genie-aided approaches are established. These upper bounds together with some existing upper bounds are achieved by using four novel transmission schemes. Extending the upper bounds and the transmission schemes to the Gaussian case, the GDoF of the Gaussian IRC is characterized for the aforementioned regime. This completes the GDoF results available in the literature for the symmetric GDoF. It is shown that in the strong interference regime, in contrast to the IC, the GDoF is not a monotonically increasing function of the interference level.

Includes members:
  Member "the generalized degrees of freedom of the interference relay channel with strong interference":
    also connected through other hyperedges:
      (none)
  Member "achieving net feedback gain in the butterfly network with a full duplex bidirectional relay":
    also connected through other hyperedges:
      (none)
  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 "the capacity of the interference channel with a cognitive relay in very strong interference":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the capacity region of the two user interference channel with a cognitive relay")
  Member "capacity to within 3 bits for a class of gaussian interference channels with a cognitive relay":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the capacity region of the two user interference channel with a cognitive 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-4 (induced by source paper "approximate capacity of fast fading interference channels with no instantaneous csit")
  Member "symmetric capacity of the gaussian interference channel with an out of band relay to within 1 15 bits":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "capacity bounds for a class of interference relay channels")
  Member "outer bounds for the interference channel with a cognitive relay":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "capacity bounds for a class of interference relay channels")

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)