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: "energy efficient routing in wireless networks in the presence of jamming"
  Abstract: The effectiveness and the simple implementation of physical layer jammers make them an essential threat for wireless networks. In a multihop wireless network, where jammers can interfere with the transmission of user messages at intermediate nodes along the path, one can employ jamming oblivious routing and then employ physical-layer techniques (e.g., spread spectrum) to suppress jamming. However, whereas these approaches can provide significant gains, the residual jamming can still severely limit system performance. This motivates the consideration of routing approaches that account for the differences in the jamming environment between different paths. First, we take a straightforward approach where an equal outage probability is allocated to each link along a path and develop a minimum energy routing solution. Next, we demonstrate the shortcomings of this approach and then consider the joint problem of outage allocation and routing by employing an approximation to the link outage probability. This yields an efficient and effective routing algorithm that only requires knowledge of the measured jamming at each node. Numerical results demonstrate that the amount of energy saved by the proposed methods with respect to a standard minimum energy routing algorithm, especially for parameters appropriate for terrestrial wireless networks, is substantial.

Connected through hyperedge HE-1 (induced by source paper "energy efficient secrecy in wireless networks based on random jamming"):
  with members:
    - "optimal energy and data routing in networks with energy cooperation"
    - "jamming based on an ephemeral key to obtain everlasting security in wireless environments"
    - "secure degrees of freedom of one hop wireless networks"
    - "scaling laws for secrecy capacity in cooperative wireless networks"
    - "optimal relay selection for physical layer security in cooperative wireless networks"
    - "efficient wireless security through jamming coding and routing"
    - "everlasting secrecy by exploiting non idealities of the eavesdropper s receiver"
    - "on secrecy capacity scaling in wireless networks"

Connected through hyperedge HE-2 (induced by source paper "secrecy rate maximization with outage constraint in multihop relaying networks"):
  with members:
    - "physical layer security of a buffer aided full duplex relaying system"
    - "secure routing in multihop wireless ad hoc networks with decode and forward relaying"
    - "artificial noise aided secrecy information and power transfer in ofdma systems"
    - "energy harvesting for physical layer security in ofdma networks"
    - "when does relay transmission give a more secure connection in wireless ad hoc networks"
    - "optimal relay selection for physical layer security in cooperative wireless networks"
    - "relay placement for physical layer security a secure connection perspective"
    - "rethinking the secrecy outage formulation a secure transmission design perspective"

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)