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 "secret key generation through a relay"):
  Abstract: We consider problems of two-user secret key generation through an intermediate relay. Each user observes correlated source sequences and communicates to the relay over rate-limited noiseless links. The relay processes and broadcasts information to the two users over another rate-limited link. The users then generate a common secret key based on their sources and information from the relay. In the untrusted relay setting, the goal is to establish key agreement between the two users at the highest key rate without leaking information about the key to the relay. We characterize inner and outer bounds to the optimal tradeoff between communication and key rates. The inner bound is based on the scheme which involves a combination of binning, network coding, and key aggregation techniques. For the trusted relay setting with a public broadcast link, the optimal communication-key rate tradeoff is provided for a special case where the two sources are available losslessly at the relay. The results can be relevant for cloud-based secret key generation services.

Includes members:
  Member "common randomness and key generation with limited interaction":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "multiterminal secret key agreement at asymptotically zero discussion rate")
  Member "secure communication via an untrusted non regenerative relay in fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "enhancing physical layer security in af relay assisted multicarrier wireless transmission enhancing physical layer security in af relay assisted multicarrier wireless transmission")
  Member "on secure source coding with side information at the encoder":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "secure lossy source coding for some classes of helper and gray wyner models")
  Member "common information and secret key capacity":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "communication for generating correlation a unifying survey")
  Member "strongly secure communications over the two way wiretap channel":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "secrecy rates for a channel with two senders and two receivers")
  Member "rate regions of secret key sharing in a new source model":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "strong secrecy in pairwise key agreement over a generalized multiple access channel")
  Member "cooperation with an untrusted relay a secrecy perspective":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "secure relaying in non orthogonal multiple access trusted and untrusted scenarios")
  Member "secret key agreement from correlated gaussian sources by rate limited public communication":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "multiterminal secret key agreement with nearly no discussion")

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)