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 "level triggered harvest then consume protocol with two bits or less energy state information"):
  Abstract: We propose a variation of harvest-then-consume protocol with low complexity where the harvest and consume phases change when the battery energy level reaches certain thresholds. The proposed protocol allows us to control the possible energy outage during consumption phase. Assuming that the battery is perfect and that the energy arrival is a renewal process, we analyze the duty cycle and the operating cycle speed of the protocol. The proposed protocol also allows for limited battery energy state information. The cases when the system has two-bits, one-bit, and zero-bit of battery energy state information are studied in detail. Numerical simulations verify the obtained formulas.

Includes members:
  Member "accumulate and jam towards secure communication via a wireless powered full duplex jammer":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "state space adaptive nonlinear self interference cancellation for full duplex communication")
  Member "wireless powered relays in cooperative communications time switching relaying protocols and throughput analysis":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on maximizing information reliability in wireless powered cooperative networks")

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)