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: "capacity theorems for the fading interference channel with a relay and feedback links"
  Abstract: Handling interference is one of the main challenges in the design of wireless networks. One of the key approaches to interference management is node cooperation, which can be classified into two main types: relaying and feedback. In this work we consider simultaneous application of both cooperation types in the presence of interference. We obtain exact characterization of the capacity regions for Rayleigh fading and phase fading interference channels with a relay and with feedback links, in the strong and very strong interference regimes. Four feedback configurations are considered: (1) feedback from both receivers to the relay, (2) feedback from each receiver to the relay and to one of the transmitters (either corresponding or opposite), (3) feedback from one of the receivers to the relay, (4) feedback from one of the receivers to the relay and to one of the transmitters. Our results show that there is a strong motivation for incorporating relaying and feedback into wireless networks.

Connected through hyperedge HE-1 (induced by source paper "on cooperation and interference in the weak interference regime full version with detailed proofs"):
  with members:
    - "cooperation for interference management a gdof perspective"
    - "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"
    - "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"

Connected through hyperedge HE-2 (induced by source paper "diversity multiplexing tradeoff for the interference channel with a relay"):
  with members:
    - "the diversity multiplexing tradeoff of the mimo half duplex relay channel"
    - "the gaussian interference relay channel improved achievable rates and sum rate upperbounds using a potent relay"
    - "generalized degrees of freedom of the symmetric gaussian k user interference channel"
    - "mimo two way relay channel diversity multiplexing tradeoff analysis"
    - "gaussian interference channel capacity to within one bit"

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)