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: "cross layer scheduling for ofdma based cognitive radio systems with delay and security constraints"
  Abstract: This paper considers the resource allocation problem in an Orthogonal Frequency Division Multiple Access (OFDMA) based cognitive radio (CR) network, where the CR base station adopts full overlay scheme to transmit both private and open information to multiple users with average delay and power constraints. A stochastic optimization problem is formulated to develop flow control and radio resource allocation in order to maximize the long-term system throughput of open and private information in CR system and ensure the stability of primary system. The corresponding optimal condition for employing full overlay is derived in the context of concurrent transmission of open and private information. An online resource allocation scheme is designed to adapt the transmission of open and private information based on monitoring the status of primary system as well as the channel and queue states in the CR network. The scheme is proven to be asymptotically optimal in solving the stochastic optimization problem without knowing any statistical information. Simulations are provided to verify the analytical results and efficiency of the scheme.

Connected through hyperedge HE-1 (induced by source paper "tradeoff between delay and physical layer security in wireless networks"):
  with members:
    - "when mmwave communications meet network densification a scalable interference coordination perspective"
    - "secure transmission with large numbers of antennas and finite alphabet inputs"
    - "5g software defined vehicular networks"
    - "toward a tractable delay analysis in ultra dense networks"
    - "heterogeneous cellular networks with spatio temporal traffic delay analysis and scheduling"
    - "secure massive mimo transmission with an active eavesdropper"
    - "5g ultra dense cellular networks"
    - "performance laws of large heterogeneous cellular networks"

Connected through hyperedge HE-2 (induced by source paper "energy efficient resource allocation for time varying ofdma relay systems with hybrid energy supplies"):
  with members:
    - "power allocation for conventional and buffer aided link adaptive relaying systems with energy harvesting nodes"
    - "energy efficient resource allocation in ofdma systems with hybrid energy harvesting base station"
    - "maximizing energy efficiency in multi relay ofdma cellular networks"
    - "decentralized delay optimal control for interference networks with limited renewable energy storage"
    - "jointly optimal channel and power assignment for dual hop multi channel multi user relaying"
    - "a cross layer perspective on energy harvesting aided green communications over fading channels"
    - "adaptive power management for wireless base stations in a smart grid environment"
    - "wsr maximized resource allocation in multiple df relays aided ofdma downlink transmission"

Connected through hyperedge HE-3 (induced by source paper "secure transmission of delay sensitive data over wireless fading channels"):
  with members:
    - "secure communications in the presence of a buffer aided wireless powered relay with self energy recycling"
    - "a survey on wireless security technical challenges recent advances and future trends"
    - "joint power control in wiretap interference channels"
    - "opportunistic secrecy with a strict delay constraint"
    - "energy efficient optimization for physical layer security in multi antenna downlink networks with qos guarantee"
    - "secure wireless communication and optimal power control under statistical queueing constraints"
    - "secure communication in the low snr regime"
    - "analysis of energy efficiency in fading channels under qos constraints"

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)