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 a class of cognitive z interference channels"
  Abstract: We study a special class of the cognitive radio channel in which the receiver of the cognitive pair does not suffer interference from the primary user. Previously developed general encoding schemes for this channel are complex as they attempt to cope with arbitrary channel conditions, which leads to rate regions that are difficult to evaluate. The focus of our work is to derive simple rate regions that are easily computable, thereby providing more insights into achievable rates and good coding strategies under different channel conditions. We first present several explicit achievable regions for the general discrete memoryless case. We also present an improved outer bound on the capacity region for the case of high interference. We then extend these regions to Gaussian channels. With a simple outer bound we establish a new capacity region in the high-interference regime. Lastly, we provide numerical comparisons between the derived achievable rate regions and the outer bounds.

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"
    - "inner and outer bounds for the gaussian cognitive interference channel and new capacity results"
    - "the capacity of more capable cognitive interference channels"
    - "superposition coding based bounds and capacity for the cognitive z interference channels"

Connected through hyperedge HE-2 (induced by source paper "capacity results for the multicast cognitive interference channel"):
  with members:
    - "the capacity of less noisy cognitive interference channels"
    - "inner and outer bounds for the gaussian cognitive interference channel and new capacity results"
    - "the capacity of more capable cognitive interference channels"
    - "cognitive radio an information theoretic perspective"

Connected through hyperedge HE-3 (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"
    - "the capacity of the semi deterministic cognitive interference channel and its application to constant gap results for the gaussian 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"
    - "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-4 (induced by source paper "how much rate splitting is required for a random coding scheme a new achievable rate region for the broadcast channel with cognitive relays"):
  with members:
    - "fundamental limits of communications in interference networks part iii information flow in strong interference regime"
    - "capacity theorems for the cognitive radio channel with confidential messages"
    - "evaluation of marton s inner bound for the general broadcast channel"
    - "fundamental limits of communications in interference networks part i basic structures"
    - "fundamental limits of communications in interference networks part ii information flow in degraded networks"
    - "fundamental limits of communications in interference networks part iv networks with a sequence of less noisy receivers"
    - "interference networks with general message sets a random coding scheme"
    - "capacity bounds and exact results for the cognitive z interference channel"

Connected through hyperedge HE-5 (induced by source paper "on the capacity of interference channel with causal and noncausal generalized feedback at the cognitive transmitter"):
  with members:
    - "lecture notes on network information theory"
    - "new inner and outer bounds for the discrete memoryless cognitive interference channel and some capacity results"
    - "interference channels with one cognitive transmitter"
    - "an achievable rate region for interference channels with conferencing"
    - "on the capacity of interference channels with one cooperating transmitter"
    - "cognitive radio an information theoretic perspective"

Connected through hyperedge HE-6 (induced by source paper "the capacity of less noisy cognitive interference channels"):
  with members:
    - "inner and outer bounds for the gaussian cognitive interference channel and new capacity results"
    - "the capacity of more capable cognitive interference channels"
    - "superposition coding based bounds and capacity for the cognitive z interference channels"
    - "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 "the capacity of more capable cognitive interference channels"):
  with members:
    - "the capacity of less noisy cognitive interference channels"
    - "inner and outer bounds for the gaussian cognitive interference channel and new capacity results"
    - "superposition coding based bounds and capacity for the cognitive z interference channels"
    - "on the capacity of interference channels with one cooperating transmitter"
    - "cognitive radio an information theoretic perspective"

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

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)