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 more capable cognitive interference channels"
  Abstract: By introducing a new outer bound, we establish the capacity region for a class of discrete memoryless cognitive inter- ference channel (DM-CIC) called cognitive-more-capable channel, and we show that superposition coding is the optimal encoding technique. The new capacity region is the largest capacity region for the two-user DM-CIC to date, as all existing capacity results are explicitly shown to be its subsets. In the effort to prove the latter, we also clarify the relation among the existing capacity results of the DM-CIC. Besides, as a byproduct of the introduced outer bound, we find a more tractable presentation of the outer bound introduced in (1, Theorem 3.2). I. INTRODUCTION

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"
    - "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 "interplay between noma and other emerging technologies a survey"):
  with members:
    - "secure relaying in non orthogonal multiple access trusted and untrusted scenarios"
    - "securing downlink massive mimo noma networks with artificial noise"
    - "lens based millimeter wave reconfigurable antenna noma"
    - "what role can noma play in massive mimo"
    - "noma an information theoretic perspective"
    - "joint power and time allocation for noma mec offloading"
    - "multi beam noma for hybrid mmwave systems"
    - "exploiting full half duplex user relaying in noma systems"

Connected through hyperedge HE-3 (induced by source paper "the capacity of degraded cognitive interference channel with unidirectional destination cooperation"):
  with members:
    - "on the capacity region of the cognitive interference channel with unidirectional destination cooperation"
    - "cognitive radio an information theoretic perspective"

Connected through hyperedge HE-4 (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"
    - "on the capacity of a class of cognitive z interference channels"
    - "cognitive radio an information theoretic perspective"

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