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 semi deterministic cognitive interference channel and its application to constant gap results for the gaussian channel"
  Abstract: The cognitive interference channel (C-IFC) consists of a classical two-user interference channel in which the message of one user (the "primary" user) is non-causally available at the transmitter of the other user (the "cognitive" user). We obtain the capacity of the semi-deterministic C-IFC: a discrete memoryless C-IFC in which the cognitive receiver output is a noise-less deterministic function of the channel inputs. We then use the insights obtained from the capacity-achieving scheme for the semi-deterministic model to derive new, unified and tighter constant gap results for the complex-valued Gaussian C-IFC. We prove: (1) a constant additive gap (difference between inner and outer bounds) of half a bit/sec/Hz per real dimension, of relevance at high SNRs, and (b) a constant multiplicative gap (ratio between outer and inner bounds) of a factor two, of relevance at low SNRs.

Connected through hyperedge HE-1 (induced by source paper "multiuser cognitive radio networks an information theoretic perspective"):
  with members:
    - "on the sum rate of a 2 x 2 interference network"
    - "capacity to within 3 bits for a class of gaussian interference channels with a cognitive relay"
    - "new results on the capacity of the gaussian cognitive interference channel"
    - "new inner and outer bounds for the discrete memoryless cognitive interference channel and some capacity results"
    - "interference channels with one cognitive transmitter"
    - "on the capacity of a class of mimo cognitive radios"
    - "the gaussian mac with conferencing encoders"
    - "on the capacity of interference channels with one cooperating transmitter"

Connected through hyperedge HE-2 (induced by source paper "inner and outer bounds for the gaussian cognitive interference channel and new capacity results"):
  with members:
    - "a new capacity result for the z gaussian cognitive interference channel"
    - "superposition coding based bounds and capacity for the cognitive z interference channels"
    - "new results on the capacity of the gaussian cognitive interference channel"
    - "interference mitigation through limited transmitter cooperation"
    - "on the capacity of a class of cognitive z interference channels"
    - "new inner and outer bounds for the discrete memoryless cognitive interference channel and some capacity results"
    - "interference channels with one cognitive transmitter"
    - "state of the cognitive interference channel a new unified inner bound"

Connected through hyperedge HE-3 (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"
    - "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-4 (induced by source paper "primary rate splitting achieves capacity for the gaussian cognitive interference channel"):
  with members:
    - "an achievable region for a general multi terminal network and its chain graph representation"
    - "new results on the capacity of the gaussian cognitive interference channel"
    - "state of the cognitive interference channel a new unified inner bound"

Connected through hyperedge HE-5 (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"
    - "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"
    - "new inner and outer bounds for the discrete memoryless cognitive interference channel and some capacity results"

Connected through hyperedge HE-6 (induced by source paper "a new capacity result for the z gaussian cognitive interference channel"):
  with members:
    - "inner and outer bounds for the gaussian cognitive interference channel and new capacity results"
    - "new results on the capacity of the gaussian cognitive interference channel"
    - "on the capacity of a class of cognitive z interference channels"
    - "lecture notes on network information theory"
    - "new inner and outer bounds for the discrete memoryless cognitive interference channel and some capacity results"
    - "the capacity region of the cognitive z interference channel with one noiseless component"
    - "on the capacity of interference channels with one cooperating transmitter"
    - "an extremal inequality motivated by multiterminal information theoretic problems"

Connected through hyperedge HE-7 (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"
    - "latent capacity region a case study on symmetric broadcast with common messages"
    - "on the capacity of the interference channel with a cognitive relay"
    - "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"

Connected through hyperedge HE-8 (induced by source paper "an achievable region for a general multi terminal network and its chain graph representation"):
  with members:
    - "an achievable region for a general multi terminal network and the corresponding chain graph representation"
    - "interference networks with general message sets a random coding scheme"
    - "lecture notes on network information theory"
    - "new inner and outer bounds for the discrete memoryless cognitive interference channel and some capacity results"
    - "fundamental constraints on multicast capacity regions"
    - "cognitive interference channels with confidential messages"
    - "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)