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 region of the cognitive z interference channel with one noiseless component"
  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 upper and lower bounds on the capacity of this channel. We then show that, when the channel of the transmitter-receiver pair that does not face interference is noiseless, the two bounds coincide and therefore yield the capacity region. 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 result for a generalized Gel'fand-Pinsker problem.

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

Connected through hyperedge HE-2 (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"
    - "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"
    - "on the capacity of interference channels with one cooperating transmitter"
    - "an extremal inequality motivated by multiterminal information theoretic problems"

Connected through hyperedge HE-3 (induced by source paper "on the capacity of a class of cognitive z interference channels"):
  with members:
    - "superposition coding based bounds and capacity for the cognitive z interference channels"
    - "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 interference channels with one cooperating transmitter"
    - "cognitive radio an information theoretic perspective"

Connected through hyperedge HE-4 (induced by source paper "state of the cognitive interference channel a new unified inner bound"):
  with members:
    - "interference channels with one cognitive transmitter"
    - "on the capacity of a class of mimo cognitive radios"
    - "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)