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 agreement capacity over reciprocal fading channels a separation approach"):
  Abstract: Fundamental limits of secret-key agreement over reciprocal wireless channels are investigated. We consider a two-way block-fading channel where the channel gains in the forward and reverse links between the legitimate terminals are correlated. The channel gains between the legitimate terminals are not revealed to any terminal, whereas the channel gains of the eavesdropper are revealed to the eavesdropper. We propose a two-phase transmission scheme, that reserves a certain portion of each coherence block for channel estimation, and the remainder of the coherence block for correlated source generation. The resulting secret-key involves contributions of both channel sequences and source sequences, with the contribution of the latter becoming dominant as the coherence period increases. We also establish an upper bound on the secret-key capacity, which has a form structurally similar to the lower bound. Our upper and lower bounds coincide in the limit of high signal-to-noise-ratio (SNR) and large coherence period, thus establishing the secret-key agreement capacity in this asymptotic regime. Numerical results indicate that the proposed scheme achieves significant gains over training-only schemes, even for moderate SNR and small coherence periods, thus implying the necessity of randomness-sharing in practical secret-key generation systems.

Includes members:
  Member "secret key generation using correlated sources and channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "biometric and physical identifiers with correlated noise for controllable private authentication")
  Member "secrecy via sources and channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "biometric and physical identifiers with correlated noise for controllable private authentication")
  Member "a broadcast approach to secret key generation over slow fading channels":
    also connected through other hyperedges:
      (none)
  Member "secret key agreement with channel state information at the transmitter":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "key and message semantic security over state dependent channels")
  Member "keys through arq theory and practice":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a survey on wireless security technical challenges recent advances and future trends")
  Member "information theoretically secret key generation for fading wireless channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "covert secret key generation with an active warden")

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)