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 "fading cognitive multiple access channels with confidential messages"):
  Abstract: The fading cognitive multiple-access channel with confidential messages (CMAC-CM) is investigated, in which two users attempt to transmit common information to a destination and user 1 also has confidential information intended for the destination. User 1 views user 2 as an eavesdropper and wishes to keep its confidential information as secret as possible from user 2. The multiple-access channel (both the user-to-user channel and the user-to-destination channel) is corrupted by multiplicative fading gain coefficients in addition to additive white Gaussian noise. The channel state information (CSI) is assumed to be known at both the users and the destination. A parallel CMAC-CM with independent subchannels is first studied. The secrecy capacity region of the parallel CMAC-CM is established, which yields the secrecy capacity region of the parallel CMAC-CM with degraded subchannels. Next, the secrecy capacity region is established for the parallel Gaussian CMAC-CM, which is used to study the fading CMAC-CM. When both users know the CSI, they can dynamically change their transmission powers with the channel realization to achieve the optimal performance. The closed-form power allocation function that achieves every boundary point of the secrecy capacity region is derived.

Includes members:
  Member "cooperation with an untrusted relay a secrecy perspective":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "secure relaying in non orthogonal multiple access trusted and untrusted scenarios")
  Member "information theoretically secret key generation for fading wireless channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "covert secret key generation with an active warden")
  Member "on the throughput of secure hybrid arq protocols for gaussian block fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "tradeoff between delay and physical layer security in wireless networks")
  Member "two hop secure communication using an untrusted relay":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "group secret key generation using algebraic rings in three user wireless networks")
  Member "secrecy in cooperative relay broadcast channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "broadcast channels with privacy leakage constraints")
  Member "secure communication over fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "parallel bcc with one common and two confidential messages and imperfect csit")
  Member "the gaussian multiple access wire tap channel with collective secrecy constraints":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on the secrecy capacity of the broadcast wiretap channel with limited csi feedback")
  Member "the discrete memoryless multiple access channel with confidential messages":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "multiple access channel with common message and secrecy constraint")

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.IT(Information Theory)