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: "maximum throughput of a cooperative energy harvesting cognitive radio user"
  Abstract: In this paper, we investigate the maximum throughput of a saturated rechargeable secondary user (SU) sharing the spectrum with a primary user (PU). The SU harvests energy packets (tokens) from the environment with a certain harvesting rate. All transmitters are assumed to have data buffers to store the incoming data packets. In addition to its own traffic buffer, the SU has a buffer for storing the admitted primary packets for relaying; and a buffer for storing the energy tokens harvested from the environment. We propose a new cooperative cognitive relaying protocol that allows the SU to relay a fraction of the undelivered primary packets. We consider an interference channel model (or a multipacket reception (MPR) channel model), where concurrent transmissions can survive from interference with certain probability characterized by the complement of channel outages. The proposed protocol exploits the primary queue burstiness and receivers' MPR capability. In addition, it efficiently expends the secondary energy tokens under the objective of secondary throughput maximization. Our numerical results show the benefits of cooperation, receivers' MPR capability, and secondary energy queue arrival rate on the system performance from a network layer standpoint.

Connected through hyperedge HE-1 (induced by source paper "cooperation and underlay mode selection in cognitive radio network"):
  with members:
    - "on the stable throughput of cooperative cognitive radio networks with finite relaying buffer"
    - "protocol design and stability analysis of cooperative cognitive radio users"
    - "diversity of mimo multihop relay channels"

Connected through hyperedge HE-2 (induced by source paper "energy efficient cooperative cognitive relaying schemes for cognitive radio networks"):
  with members:
    - "secret key aided scheme for securing untrusted df relaying networks"
    - "low latency ultra reliable 5g communications finite blocklength bounds and coding schemes"
    - "maximum throughput of a secondary user cooperating with an energy aware primary user"
    - "on the coexistence of a primary user with an energy harvesting secondary user a case of cognitive cooperation"

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)