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: "achievable rates and upper bounds for the interference relay channel"
  Abstract: The two user Gaussian interference channel with a full-duplex relay is studied. By using genie aided approaches, two new upper bounds on the achievable sum-rate in this setup are derived. These upper bounds are shown to be tighter than previously known bounds under some conditions. Moreover, a transmit strategy for this setup is proposed. This strategy utilizes the following elements: Block Markov encoding combined with a Han-Kobayashi scheme at the sources, decode and forward at the relay, and Willems' backward decoding at the receivers. This scheme is shown to achieve within a finite gap our upper bounds in certain cases.

Connected through hyperedge HE-1 (induced by source paper "lattice coding and the generalized degrees of freedom of the interference channel with relay"):
  with members:
    - "capacity to within 3 bits for a class of gaussian interference channels with a cognitive relay"
    - "interference channels with source cooperation"
    - "the gaussian interference relay channel improved achievable rates and sum rate upperbounds using a potent relay"
    - "interference channels with destination cooperation"
    - "capacity theorems for the awgn multi way relay channel"
    - "outer bounds for the interference channel with a cognitive relay"
    - "compute and forward harnessing interference through structured codes"
    - "joint physical layer coding and network coding for bi directional relaying"

Connected through hyperedge HE-2 (induced by source paper "on the capacity of the interference channel with a cognitive relay"):
  with members:
    - "the dof of the k user interference channel with a cognitive relay"
    - "inner and outer bounds for the gaussian cognitive interference channel and new capacity results"
    - "an achievable region for a general multi terminal network and its chain graph representation"
    - "a new capacity result for the z gaussian cognitive interference channel"
    - "the capacity of the semi deterministic cognitive interference channel and its application to constant gap results for the gaussian channel"
    - "new results on the capacity of the gaussian cognitive interference channel"
    - "symmetric capacity of the gaussian interference channel with an out of band relay to within 1 15 bits"
    - "outer bounds for the interference channel with a cognitive relay"

Connected through hyperedge HE-3 (induced by source paper "incremental relaying for the gaussian interference channel with a degraded broadcasting relay"):
  with members:
    - "wireless network information flow a deterministic approach"
    - "the capacity region of the mimo interference channel and its reciprocity to within a constant gap"
    - "interference channels with source cooperation"
    - "the gaussian interference relay channel improved achievable rates and sum rate upperbounds using a potent relay"
    - "interference channels with destination cooperation"
    - "interference mitigation through limited transmitter cooperation"
    - "symmetric capacity of the gaussian interference channel with an out of band relay to within 1 15 bits"
    - "interference channel with an out of band relay"

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)