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: "capacity bounds and exact results for the cognitive z interference channel"
  Abstract: We study the discrete memoryless Z-interference channel (ZIC) where the transmitter of the pair that suffers from interference is cognitive. We first provide an upper bound on the capacity of this channel. We then show that, when the channel of the transmitter-receiver pair that does not experience interference is deterministic, our proposed upper bound matches the known lower bound provided by Cao and Chen in 2008. The obtained results imply that, unlike in the Gaussian cognitive ZIC, in the considered channel superposition encoding at the non-cognitive transmitter as well as Gel'fand-Pinsker encoding at the cognitive transmitter are needed in order to minimize the impact of interference. As a byproduct of the obtained capacity region, we obtain the capacity under the generalized Gel'fand-Pinsker conditions where a transmitter-receiver pair communicates in the presence of interference noncausally known at the encoder.

Connected through hyperedge HE-1 (induced by source paper "relay channel with orthogonal components and structured interference known at the source"):
  with members:
    - "bounds on the capacity of the relay channel with noncausal state at source"
    - "structured interference mitigation in two hop networks"
    - "bounds on the capacity of the relay channel with noncausal state information at source"
    - "lecture notes on network information theory"
    - "dirty paper coding for fading channels with partial transmitter side information"
    - "writing on dirty paper with resizing and its application to quasi static fading broadcast channels"
    - "on the fading paper achievable region of the fading mimo broadcast channel"

Connected through hyperedge HE-2 (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"
    - "on the capacity of interference channel with causal and noncausal generalized feedback at the cognitive transmitter"
    - "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"

Connected through hyperedge HE-3 (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"
    - "on the capacity of a class of cognitive z interference 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)