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: "optimal time scheduling for wireless powered backscatter communication networks"
  Abstract: This letter introduces a novel wireless-powered backscatter communication system which allows sensors to utilize RF signals transmitted from a dedicated RF energy source to transmit data. In the proposed system, when the RF energy source transmits RF signals, the sensors are able to backscatter the RF signals to transmit date to the gateway and/or harvest energy from the RF signals for their operations. By integrating backscattering and energy harvesting techniques, we can optimize the network throughput of the system. In particular, we first formulate the time scheduling problem for the system, and then propose an optimal solution using convex optimization to maximize the overall network throughput. Numerical results show a significant throughput gain achieved by our proposed design over two other baseline schemes.

Connected through hyperedge HE-1 (induced by source paper "capitalizing backscatter aided hybrid relay communications with wireless energy harvesting"):
  with members:
    - "cooperative ambient backscatter communications for green internet of things"
    - "ambient backscatter communications a contemporary survey"
    - "practical non linear energy harvesting model and resource allocation for swipt systems"
    - "relaying protocols for wireless energy harvesting and information processing"
    - "network beamforming using relays with perfect channel information"

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.NI(Networking and Internet Architecture)