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: "the capacity of the interference channel with a cognitive relay in very strong interference"
  Abstract: The interference channel with a cognitive relay consists of a classical interference channel with two sourcedestination pairs and with an additional cognitive relay that has a priori knowledge of the sources' messages and aids in the sources' transmission. We derive a new outer bound for this channel using an argument originally devised for the "more capable" broadcast channel, and show the achievability of the proposed outer bound in the "very strong interference" regime, a class of channels where there is no loss in optimality if both destinations decode both messages. This result is analogous to the "very strong interference" capacity result for the classical interference channel and for the cognitive interference channel, and is the first capacity known capacity result for the general interference channel with a cognitive relay.

Connected through hyperedge HE-1 (induced by source paper "cooperation for interference management a gdof perspective"):
  with members:
    - "the generalized degrees of freedom of the interference relay channel with strong interference"
    - "achieving net feedback gain in the butterfly network with a full duplex bidirectional relay"
    - "wireless network information flow a deterministic approach"
    - "capacity to within 3 bits for a class of gaussian interference channels with a cognitive relay"
    - "the gaussian interference relay channel improved achievable rates and sum rate upperbounds using a potent relay"
    - "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"
    - "compute and forward harnessing interference through structured codes"

Connected through hyperedge HE-2 (induced by source paper "on the capacity region of the two user interference channel with a cognitive relay"):
  with members:
    - "two birds and one stone gaussian interference channel with a shared out of band relay of limited rate"
    - "inner and outer bounds for the gaussian cognitive interference channel and new capacity results"
    - "wireless network information flow a deterministic approach"
    - "capacity to within 3 bits for a class of gaussian interference channels with a cognitive relay"
    - "the gaussian interference relay channel improved achievable rates and sum rate upperbounds using a potent relay"
    - "on the capacity of the interference channel with a cognitive relay"
    - "interference mitigation through limited transmitter cooperation"
    - "symmetric capacity of the gaussian interference channel with an out of band relay to within 1 15 bits"

Connected through hyperedge HE-3 (induced by source paper "energy efficient cooperative strategies for relay assisted downlink cellular systems part i theoretical framework"):
  with members:
    - "practical coding schemes for cognitive overlay radios"
    - "inner and outer bounds for the gaussian cognitive interference channel and new capacity results"
    - "spatially coupled codes over the multiple access channel"
    - "on the capacity of the interference channel with a cognitive relay"

Connected through hyperedge HE-4 (induced by source paper "on the capacity of the cognitive interference channel with a common cognitive message"):
  with members:
    - "inner and outer bounds for the gaussian cognitive interference channel and new capacity results"
    - "an achievable region for a general multi terminal network and the corresponding chain graph representation"
    - "capacity to within 3 bits for a class of gaussian interference channels with a cognitive relay"
    - "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"
    - "on the capacity of the interference channel with a cognitive relay"
    - "new results on the capacity of the gaussian cognitive interference channel"
    - "outer bounds for the interference channel with a cognitive relay"

Connected through hyperedge HE-5 (induced by source paper "the dof of the k user interference channel with a cognitive relay"):
  with members:
    - "capacity to within 3 bits for a class of gaussian interference channels with a cognitive relay"
    - "outer bounds for the interference channel with a cognitive relay"
    - "approaching the capacity of wireless networks through distributed interference alignment"
    - "interference alignment and the degrees of freedom for the k user interference channel"
    - "degrees of freedom region for the mimo x channel"

Connected through hyperedge HE-6 (induced by source paper "on the capacity of a general multiple access channel and of a cognitive network in the very strong interference regime"):
  with members:
    - "an achievable region for a general multi terminal network and the corresponding chain graph representation"

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)