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: "multiuser cognitive radio networks an information theoretic perspective"
  Abstract: Achievable rate regions and outer bounds are derived for three-user interference channels where the transmitters cooperate in a unidirectional manner via a noncausal message-sharing mechanism. The three-user channel facilitates different ways of message-sharing between the primary and secondary (or cognitive) transmitters. Three natural extensions of unidirectional message-sharing from two users to three users are introduced: (i) Cumulative message sharing; (ii) primary-only message sharing; and (iii) cognitive-only message sharing. To emphasize the notion of interference management, channels are classified based on different rate-splitting strategies at the transmitters. The techniques of superposition coding and Gel’fand–Pinsker’s binning are employed to derive an achievable rate region for each of the cognitive interference channels. The results are specialized to the Gaussian channel, which enables a visual comparison of the achievable rate regions through simulations and help us achieve some additional rate points under extreme assumptions. We also provide key insights into the role of rate-splitting at the transmitters as an aid to better interference management at the receivers.

Connected through hyperedge HE-1 (induced by source paper "multi user cognitive interference channels a survey and new capacity results"):
  with members:
    - "the two user causal cognitive interference channel novel outer bounds and constant gap result for the symmetric gaussian noise channel in weak interference"
    - "on the capacity region of the two user interference channel with a cognitive relay"
    - "real interference alignment exploiting the potential of single antenna systems"
    - "on the capacity of the two user gaussian causal cognitive interference channel"
    - "on the gaussian interference channel with half duplex causal cognition"
    - "approximate sum capacity of k user cognitive interference channels with cumulative message sharing"
    - "simultaneous nonunique decoding is rate optimal"
    - "three user cognitive interference channel capacity region with strong interference"

Connected through hyperedge HE-2 (induced by source paper "lattice codes for many to one interference channels with and without cognitive messages"):
  with members:
    - "asymmetric compute and forward with csit"
    - "compute and forward finding the best equation"
    - "approximate sum capacity of k user cognitive interference channels with cumulative message sharing"
    - "is non unique decoding necessary"
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"
    - "inner and outer bounds for the gaussian cognitive interference channel and new capacity results"
    - "nested lattice codes for gaussian relay networks with interference"
    - "integer forcing linear receivers"

Connected through hyperedge HE-3 (induced by source paper "approximate sum capacity of k user cognitive interference channels with cumulative message sharing"):
  with members:
    - "degrees of freedom of interference channels with comp transmission and reception"
    - "inner and outer bounds for the gaussian cognitive interference channel and new capacity results"
    - "interference channels with source cooperation"
    - "on the capacity of the interference channel with a cognitive relay"
    - "interference channels with destination cooperation"
    - "cognitive interference management in retransmission based wireless networks"
    - "feedback capacity of the gaussian interference channel to within 2 bits"
    - "generalized degrees of freedom of the symmetric gaussian k user interference channel"

Connected through hyperedge HE-4 (induced by source paper "capacity and spectral efficiency of interference avoiding cognitive radio with imperfect detection"):
  with members:
    - "underlay cognitive radio with full or partial channel quality information"
    - "on ergodic sum capacity of fading cognitive multiple access and broadcast channels"
    - "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)