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: "inner and outer bounds for the gaussian cognitive interference channel and new capacity results"
  Abstract: The capacity of the Gaussian cognitive interference channel, a variation of the classical two-user interference channel where one of the transmitters (referred to as cognitive) has knowledge of both messages, is known in several parameter regimes but remains unknown in general. This paper provides a comparative overview of this channel model as it proceeds through the following contributions. First, several outer bounds are presented: (a) a new outer bound based on the idea of a broadcast channel with degraded message sets, and (b) an outer bound obtained by transforming the channel into channels with known capacity. Next, a compact Fourier-Motzkin eliminated version of the largest known inner bound derived for the discrete memoryless cognitive interference channel is presented and specialized to the Gaussian noise case, where several simplified schemes with jointly Gaussian input are evaluated in closed form and later used to prove a number of results. These include a new set of capacity results for: (a) the “primary decodes cognitive” regime, a subset of the “strong interference” regime that is not included in the “very strong interference” regime for which capacity was known, and (b) the “S-channel in strong interference” in which the primary transmitter does not interfere with the cognitive receiver and the primary receiver experiences strong interference. Next, for a general Gaussian channel the capacity is determined to within one bit/s/Hz and to within a factor two regardless of the channel parameters, thus establishing rate performance guarantees at high and low SNR, respectively. The paper concludes with numerical evaluations and comparisons of the various simplified achievable rate regions and outer bounds in parameter regimes where capacity is unknown, leading to further insight on the capacity region.

Connected through hyperedge HE-1 (induced by source paper "cognitive radio networks an information theoretic perspective"):
  with members:
    - "noma an information theoretic perspective"
    - "non orthogonal multiple access common myths and critical questions"
    - "multi user cognitive interference channels a survey and new capacity results"
    - "massive mimo for next generation wireless systems"
    - "the capacity of less noisy cognitive interference channels"
    - "the capacity of more capable cognitive interference channels"
    - "superposition coding based bounds and capacity for the cognitive z interference channels"
    - "on the capacity of a class of cognitive z interference channels"

Connected through hyperedge HE-2 (induced by source paper "multi phase smart relaying and cooperative jamming in secure cognitive radio networks"):
  with members:
    - "capacity theorems for the cognitive radio channel with confidential messages"
    - "interference assisted secret communication"
    - "strong secrecy from channel resolvability"
    - "secure transmission with multiple antennas ii the mimome wiretap channel"
    - "new inner and outer bounds for the discrete memoryless cognitive interference channel and some capacity results"
    - "towards the secrecy capacity of the gaussian mimo wire tap channel the 2 2 1 channel"
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"
    - "the secrecy capacity of the mimo wiretap channel"

Connected through hyperedge HE-3 (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-4 (induced by source paper "lattice codes for many to one interference channels with and without cognitive messages"):
  with members:
    - "asymmetric compute and forward with csit"
    - "compute and forward finding the best equation"
    - "multiuser cognitive radio networks an information theoretic perspective"
    - "approximate sum capacity of k user cognitive interference channels with cumulative message sharing"
    - "is non unique decoding necessary"
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"
    - "nested lattice codes for gaussian relay networks with interference"
    - "integer forcing linear receivers"

Connected through hyperedge HE-5 (induced by source paper "the two user causal cognitive interference channel novel outer bounds and constant gap result for the symmetric gaussian noise channel in weak interference"):
  with members:
    - "on the capacity of the two user gaussian causal cognitive interference channel"
    - "new outer bounds for the interference channel with unilateral source cooperation"
    - "capacity of all nine models of channel output feedback for the two user interference channel"
    - "an outer bound for the memoryless two user interference channel with general cooperation"
    - "on the capacity of interference channel with causal and noncausal generalized feedback at the cognitive transmitter"
    - "dependence balance based outer bounds for gaussian networks with cooperation and feedback"
    - "interference channels with source cooperation"
    - "interference channels with destination cooperation"

Connected through hyperedge HE-6 (induced by source paper "on the secrecy of the cognitive interference channel with partial channel states"):
  with members:
    - "the effects of limited channel knowledge on cognitive radio system capacity"
    - "capacity theorems for the cognitive radio channel with confidential messages"
    - "secret key agreement with channel state information at the transmitter"
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"
    - "on the capacity of interference channels with one cooperating transmitter"
    - "cognitive radio an information theoretic perspective"

Connected through hyperedge HE-7 (induced by source paper "capacity results for the multicast cognitive interference channel"):
  with members:
    - "the capacity of less noisy cognitive interference channels"
    - "the capacity of more capable cognitive interference channels"
    - "on the capacity of a class of cognitive z interference channels"
    - "cognitive radio an information theoretic perspective"

Connected through hyperedge HE-8 (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"
    - "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"
    - "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"

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)