human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "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.

Connected through hyperedge HE-1 (induced by source paper "approximate capacity of fast fading interference channels with no instantaneous csit"):
  with members:
    - "capacity bounds for a class of interference relay channels"
    - "capacity results for binary fading interference channels with delayed csit"
    - "ergodic interference alignment with delayed feedback"
    - "degrees of freedom region of the mimo interference channel with output feedback and delayed csit"
    - "the capacity region of the wireless ergodic fading interference channel with partial csit to within one bit"
    - "wireless network information flow a deterministic approach"
    - "ergodic fading interference channels sum capacity and separability"
    - "interference channels with source cooperation"

Connected through hyperedge HE-2 (induced by source paper "fundamental limits on delivery time in cloud and cache aided heterogeneous networks"):
  with members:
    - "fundamental tradeoff between storage and latency in cache aided wireless interference networks"
    - "degrees of freedom of cache aided wireless interference networks"
    - "fundamental limits of cache aided interference management"
    - "coded caching for a large number of users"
    - "fog computing based radio access networks issues and challenges"
    - "joint optimization of cloud and edge processing for fog radio access networks"
    - "backhaul traffic balancing and dynamic content centric clustering for the downlink of fog radio access network"
    - "content centric sparse multicast beamforming for cache enabled cloud ran"

Connected through hyperedge HE-3 (induced by source paper "on cooperation and interference in the weak interference regime full version with detailed proofs"):
  with members:
    - "diversity multiplexing tradeoff for the interference channel with a relay"
    - "the ergodic capacity of phase fading interference networks"
    - "incremental relaying for the gaussian interference channel with a degraded broadcasting relay"
    - "capacity theorems for the fading interference channel with a relay and feedback links"
    - "the gaussian interference relay channel improved achievable rates and sum rate upperbounds using a potent relay"
    - "capacity bounds for the gaussian interference channel"
    - "gaussian interference channel capacity to within one bit"
    - "an extremal inequality motivated by multiterminal information theoretic problems"

Question: Please tell me which class the center node 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)