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: "on the capacity of the interference channel with a cognitive relay"
  Abstract: The InterFerence Channel with a Cognitive Relay (IFC-CR) consists of the classical interference channel with two independent source-destination pairs whose communication is aided by an additional node, referred to as the cognitive relay, that has a priori knowledge of both sources' messages. This a priori message knowledge is termed cognition and idealizes the relay learning the messages of the two sources from their transmissions over a wireless channel. This paper presents new inner and outer bounds for the capacity region of the general memoryless IFC-CR that are shown to be tight for a certain class of channels. The new outer bound follows from arguments originally devised for broadcast channels among which Sato's observation that the capacity region of channels with non-cooperative receivers only depends on the channel output conditional marginal distributions. The new inner bound is shown to include all previously proposed coding schemes and it is thus the largest known achievable rate region to date. The new inner and outer bounds coincide for a subset of channel satisfying a strong interference condition. For these channels there is no loss in optimality if both destinations decode both messages. This result parallels analogous results for the classical IFC and for the cognitive IFC and is the first known capacity result for the general IFC-CR. Numerical evaluations of the proposed inner and outer bounds are presented for the Gaussian noise case.

Connected through hyperedge HE-1 (induced by source paper "multi user cognitive interference channels a survey and new capacity results"):
  with members:
    - "the two user causal cognitive interference channel novel outer bounds and constant gap result for the symmetric gaussian noise channel in weak interference"
    - "on the capacity region of the two user interference channel with a cognitive relay"
    - "real interference alignment exploiting the potential of single antenna systems"
    - "on the capacity of the two user gaussian causal cognitive interference channel"
    - "on the gaussian interference channel with half duplex causal cognition"
    - "multiuser cognitive radio networks an information theoretic perspective"
    - "approximate sum capacity of k user cognitive interference channels with cumulative message sharing"
    - "simultaneous nonunique decoding is rate optimal"

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"
    - "the capacity of the interference channel with a cognitive relay in very strong interference"
    - "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"
    - "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 "approximate sum capacity of k user cognitive interference channels with cumulative message sharing"):
  with members:
    - "multiuser cognitive radio networks an information theoretic perspective"
    - "degrees of freedom of interference channels with comp transmission and reception"
    - "inner and outer bounds for the gaussian cognitive interference channel and new capacity results"
    - "interference channels with source cooperation"
    - "interference channels with destination cooperation"
    - "cognitive interference management in retransmission based wireless networks"
    - "feedback capacity of the gaussian interference channel to within 2 bits"
    - "generalized degrees of freedom of the symmetric gaussian k user interference channel"

Connected through hyperedge HE-4 (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"
    - "the capacity of the interference channel with a cognitive relay in very strong interference"
    - "spatially coupled codes over the multiple access channel"

Connected through hyperedge HE-5 (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"
    - "the capacity of the interference channel with a cognitive relay in very strong interference"
    - "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"
    - "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-6 (induced by source paper "an achievable region for a general multi terminal network and the corresponding chain graph representation"):
  with members:
    - "interference networks with general message sets a random coding scheme"
    - "the capacity of the semi deterministic cognitive interference channel and its application to constant gap results for the gaussian channel"
    - "latent capacity region a case study on symmetric broadcast with common messages"
    - "lecture notes on network information theory"
    - "compute and forward harnessing interference through structured codes"
    - "fundamental constraints on multicast capacity regions"
    - "rate regions for relay broadcast channels"

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)