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: "link adaptation with untrusted relay assignment design and performance analysis"
  Abstract: In this paper, a link adaptation and untrusted relay assignment (LAURA) framework for efficient and reliable wireless cooperative communications with physical layer security is proposed. Using sharp channel codes in different transmission modes, reliability for the destination and security in the presence of untrusted relays (low probability of interception) are provided through rate and power allocation. Within this framework, several schemes are designed for highly spectrally efficient link adaptation and relay selection, which involve different levels of complexity and channel state information requirement. Analytical and simulation performance evaluation of the proposed LAURA schemes are provided, which demonstrates the effectiveness of the presented designs. The results indicate that power adaptation at the source plays a critical role in spectral efficiency performance. Also, it is shown that relay selection based on the signal to noise ratio of the source to relays channels provides an interesting balance of performance and complexity within the proposed LAURA framework.

Connected through hyperedge HE-1 (induced by source paper "protecting against untrusted relays an information self encrypted approach"):
  with members:
    - "improving physical layer security in wireless communications using diversity techniques"
    - "optimal relay selection for physical layer security in cooperative wireless networks"
    - "cooperation with an untrusted relay a secrecy perspective"

Connected through hyperedge HE-2 (induced by source paper "secure communication via a wireless energy harvesting untrusted relay"):
  with members:
    - "rf based energy harvesting in decode and forward relaying systems ergodic and outage capacities"
    - "relay selection for wireless communications against eavesdropping a security reliability trade off perspective"
    - "secrecy wireless information and power transfer in fading wiretap channel"
    - "wireless powered relays in cooperative communications time switching relaying protocols and throughput analysis"
    - "distributed power splitting for swipt in relay interference channels using game theory"
    - "interference assisted wireless energy harvesting in cognitive relay network with multiple primary transceivers"
    - "robust beamforming for secure communication in systems with wireless information and power transfer"
    - "wireless networks with rf energy harvesting a contemporary survey"

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)