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 interference channel with causal and noncausal generalized feedback at the cognitive transmitter"
  Abstract: In this paper, taking into account the effect of link delays, we investigate the capacity region of the cognitive interference channel (C-IFC), where cognition can be obtained from either causal or noncausal generalized feedback. For this purpose, we introduce the causal C-IFC with delay (CC-IFC-WD) in which the cognitive user's transmission can depend on L future received symbols as well as the past ones. We show that the CC-IFC-WD model is equivalent to a classical causal C-IFC (CC-IFC) with link delays. Moreover, CC-IFC-WD extends both genie-aided and causal cognitive radio channels and bridges the gap between them. First, we derive an outer bound on the capacity region for the arbitrary value of L and specialize this general outer bound to the strong interference case. Then, under strong interference conditions, we tighten the outer bound. To derive the achievable rate regions, we concentrate on three special cases: 1) classical CC-IFC (L=0); 2) CC-IFC without delay (L=1) ; and 3) CC-IFC with unlimited look ahead in which the cognitive user noncausally knows its entire received sequence. In each case, we obtain a new inner bound on the capacity region. The derived achievable rate regions under special conditions reduce to several previously known results. Moreover, we show that the coding strategy which we use to derive an achievable rate region for the classical CC-IFC achieves the capacity for the classes of degraded and semideterministic classical CC-IFC under strong interference conditions. Furthermore, we extend our achievable rate regions to the Gaussian case. Providing some numerical examples for Gaussian CC-IFC-WD, we compare the performances of the different strategies and investigate the rate gain of the cognitive link for different delay values. We show that one can achieve larger rate regions in the “without delay” and “unlimited look-ahead” cases than in the classical CC-IFC; this improvement is likely due to the fact that, in the former two cases, the cognitive user can cooperate more effectively with the primary user by knowing the current and future received symbols.

Connected through hyperedge HE-1 (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"
    - "inner and outer bounds for the gaussian cognitive interference channel and new capacity results"
    - "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-2 (induced by source paper "on the capacity of the two user gaussian causal cognitive interference channel"):
  with members:
    - "an outer bound for the memoryless two user interference channel with general cooperation"
    - "experiment driven characterization of full duplex wireless systems"
    - "inner and outer bounds for the gaussian cognitive interference channel and new capacity results"
    - "partial decode forward binning schemes for the causal cognitive relay channels"
    - "dependence balance based outer bounds for gaussian networks with cooperation and feedback"
    - "interference channels with source cooperation"
    - "interference channels with destination cooperation"
    - "feedback capacity of the gaussian interference channel to within 2 bits"

Connected through hyperedge HE-3 (induced by source paper "on the gaussian interference channel with half duplex causal cognition"):
  with members:
    - "on the capacity of the two user gaussian causal cognitive interference channel"
    - "interference channels with half duplex source cooperation"
    - "inner and outer bounds for the gaussian cognitive interference channel and new capacity results"
    - "wireless network information flow a deterministic approach"
    - "dependence balance based outer bounds for gaussian networks with cooperation and feedback"
    - "interference channels with source cooperation"
    - "interference channels with destination cooperation"
    - "the two user gaussian interference channel a deterministic view"

Connected through hyperedge HE-4 (induced by source paper "new outer bounds for the interference channel with unilateral source cooperation"):
  with members:
    - "on the capacity of the two user gaussian causal cognitive interference channel"
    - "capacity of all nine models of channel output feedback for the two user interference channel"
    - "interference channels with source cooperation"
    - "interference channels with destination cooperation"
    - "feedback capacity of the gaussian interference channel to within 2 bits"
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-5 (induced by source paper "fundamental limits of communications in interference networks part i basic structures"):
  with members:
    - "on the sum capacity of the discrete memoryless interference channel with one sided weak interference and mixed interference"
    - "on marton s inner bound for broadcast channels"
    - "evaluation of marton s inner bound for the general broadcast channel"
    - "fundamental limits of communications in interference networks part ii information flow in degraded networks"
    - "inner and outer bounds for the gaussian cognitive interference channel and new capacity results"
    - "interference networks with general message sets a random coding scheme"
    - "a new capacity result for the z gaussian cognitive interference channel"
    - "an achievable rate region for cognitive radio channel with common message"

Connected through hyperedge HE-6 (induced by source paper "three user cognitive interference channel capacity region with strong interference"):
  with members:
    - "new inner and outer bounds for the discrete memoryless cognitive interference channel and some capacity results"
    - "the capacity region of the 3 user gaussian interference channel with mixed strong very strong interference"
    - "on the capacity of interference channels with one cooperating transmitter"
    - "cognitive radio an information theoretic perspective"

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)