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 of less noisy cognitive interference channels"
  Abstract: Fundamental limits of the cognitive interference channel (CIC) with two pairs of transmitter-receiver has been under exploration for several years. In this paper, we study the discrete memoryless cognitive interference channel (DM-CIC) in which the cognitive transmitter non-causally knows the message of the primary transmitter. The capacity of this channel is not known in general; it is only known in some special cases. Inspired by the concept of less noisy broadcast channel (BC), in this work we introduce the notion of less noisy cognitive interference channel. Unlike BC, due to the inherent asymmetry of the cognitive channel, two different less noisy channels are distinguishable; these are named the primary-less-noisy and cognitive-less-noisy channels. We derive capacity region for the latter case, by introducing inner and outer bounds on the capacity of the DM-CIC and showing that these bounds coincide for the cognitive-less-noisy channel. Having established the capacity region, we prove that superposition coding is the optimal encoding technique.

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"
    - "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 a class of cognitive z interference channels"

Connected through hyperedge HE-2 (induced by source paper "capacity results for the multicast cognitive interference channel"):
  with members:
    - "inner and outer bounds for the gaussian cognitive interference channel and new capacity results"
    - "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-3 (induced by source paper "the capacity of more capable cognitive interference channels"):
  with members:
    - "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 a class of cognitive z interference channels"
    - "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)