human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "a secure multiple access scheme for rechargeable wireless sensors in the presence of an eavesdropper"):
  Abstract: We propose a simple yet efficient scheme for a set of energy-harvesting sensors to establish secure communication with a common destination (a master node). An eavesdropper attempts to decode the data sent from the sensors to their common destination. We assume a single modulation scheme that can be implemented efficiently for energy-limited applications. We design a multiple-access scheme for the sensors under secrecy and limited-energy constraints. In a given time slot, each energy-harvesting sensor chooses between sending its packet or remaining idle. The destination assigns a set of data time slots to each sensor. The optimization problem is formulated to maximize the secrecy sum-throughput.

Includes members:
  Member "energy cooperation in energy harvesting communications":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "transmission delay minimization in wireless powered communication systems")
  Member "transmission with energy harvesting nodes in fading wireless channels optimal policies":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "closed form analysis of non linear age of information in status updates with an energy harvesting transmitter")

Question: Please tell me which class the source paper 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.NI(Networking and Internet Architecture)