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 "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.

Includes members:
  Member "a coding approach to guarantee information integrity against a byzantine relay":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "detecting arbitrary attacks using continuous secured side information in wireless networks")
  Member "secrecy is cheap if the adversary must reconstruct":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a large deviations approach to secure lossy compression")
  Member "cooperation with an untrusted relay a secrecy perspective":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "secure relaying in non orthogonal multiple access trusted and untrusted scenarios")
  Member "joint adaptive modulation coding and cooperative arq for wireless relay networks":
    also connected through other hyperedges:
      (none)
  Member "a simple cooperative diversity method based on network path selection":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "dynwalks global topology and recent changes awareness dynamic network embedding")
  Member "applications of ldpc codes to the wiretap channel":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "explicit codes for the wiretap channel a unified design framework")

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)